14.45/6.50 NO 14.45/6.50 14.45/6.50 Ultimate: Cannot open display: 14.45/6.50 This is Ultimate 0.1.24-8dc7c08-m 14.45/6.50 [2019-03-28 12:14:45,625 INFO L170 SettingsManager]: Resetting all preferences to default values... 14.45/6.50 [2019-03-28 12:14:45,627 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 14.45/6.50 [2019-03-28 12:14:45,639 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 14.45/6.50 [2019-03-28 12:14:45,639 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 14.45/6.50 [2019-03-28 12:14:45,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 14.45/6.50 [2019-03-28 12:14:45,641 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 14.45/6.50 [2019-03-28 12:14:45,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 14.45/6.50 [2019-03-28 12:14:45,645 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 14.45/6.50 [2019-03-28 12:14:45,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 14.45/6.50 [2019-03-28 12:14:45,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 14.45/6.50 [2019-03-28 12:14:45,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 14.45/6.50 [2019-03-28 12:14:45,647 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 14.45/6.50 [2019-03-28 12:14:45,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 14.45/6.50 [2019-03-28 12:14:45,649 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 14.45/6.50 [2019-03-28 12:14:45,650 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 14.45/6.50 [2019-03-28 12:14:45,651 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 14.45/6.50 [2019-03-28 12:14:45,653 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 14.45/6.50 [2019-03-28 12:14:45,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 14.45/6.50 [2019-03-28 12:14:45,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 14.45/6.50 [2019-03-28 12:14:45,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 14.45/6.50 [2019-03-28 12:14:45,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 14.45/6.50 [2019-03-28 12:14:45,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 14.45/6.50 [2019-03-28 12:14:45,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 14.45/6.50 [2019-03-28 12:14:45,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 14.45/6.50 [2019-03-28 12:14:45,661 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 14.45/6.50 [2019-03-28 12:14:45,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 14.45/6.50 [2019-03-28 12:14:45,662 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 14.45/6.50 [2019-03-28 12:14:45,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 14.45/6.50 [2019-03-28 12:14:45,663 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 14.45/6.50 [2019-03-28 12:14:45,664 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 14.45/6.50 [2019-03-28 12:14:45,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 14.45/6.50 [2019-03-28 12:14:45,665 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 14.45/6.50 [2019-03-28 12:14:45,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 14.45/6.50 [2019-03-28 12:14:45,666 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 14.45/6.50 [2019-03-28 12:14:45,666 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 14.45/6.50 [2019-03-28 12:14:45,667 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 14.45/6.50 [2019-03-28 12:14:45,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 14.45/6.50 [2019-03-28 12:14:45,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 14.45/6.50 [2019-03-28 12:14:45,669 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 14.45/6.50 [2019-03-28 12:14:45,683 INFO L110 SettingsManager]: Loading preferences was successful 14.45/6.50 [2019-03-28 12:14:45,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 14.45/6.50 [2019-03-28 12:14:45,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 14.45/6.50 [2019-03-28 12:14:45,685 INFO L133 SettingsManager]: * Rewrite not-equals=true 14.45/6.50 [2019-03-28 12:14:45,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 14.45/6.50 [2019-03-28 12:14:45,685 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 14.45/6.50 [2019-03-28 12:14:45,686 INFO L133 SettingsManager]: * Use SBE=true 14.45/6.50 [2019-03-28 12:14:45,686 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 14.45/6.50 [2019-03-28 12:14:45,686 INFO L133 SettingsManager]: * Use old map elimination=false 14.45/6.50 [2019-03-28 12:14:45,686 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 14.45/6.50 [2019-03-28 12:14:45,686 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 14.45/6.50 [2019-03-28 12:14:45,687 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 14.45/6.50 [2019-03-28 12:14:45,687 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 14.45/6.50 [2019-03-28 12:14:45,687 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 14.45/6.50 [2019-03-28 12:14:45,687 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.45/6.50 [2019-03-28 12:14:45,687 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 14.45/6.50 [2019-03-28 12:14:45,687 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 14.45/6.50 [2019-03-28 12:14:45,688 INFO L133 SettingsManager]: * Check division by zero=IGNORE 14.45/6.50 [2019-03-28 12:14:45,688 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 14.45/6.50 [2019-03-28 12:14:45,688 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 14.45/6.50 [2019-03-28 12:14:45,688 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 14.45/6.50 [2019-03-28 12:14:45,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 14.45/6.50 [2019-03-28 12:14:45,689 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 14.45/6.50 [2019-03-28 12:14:45,689 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 14.45/6.50 [2019-03-28 12:14:45,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 14.45/6.50 [2019-03-28 12:14:45,689 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 14.45/6.50 [2019-03-28 12:14:45,689 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 14.45/6.50 [2019-03-28 12:14:45,690 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 14.45/6.50 [2019-03-28 12:14:45,690 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 14.45/6.50 [2019-03-28 12:14:45,715 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 14.45/6.50 [2019-03-28 12:14:45,728 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 14.45/6.50 [2019-03-28 12:14:45,732 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 14.45/6.50 [2019-03-28 12:14:45,733 INFO L271 PluginConnector]: Initializing CDTParser... 14.45/6.50 [2019-03-28 12:14:45,734 INFO L276 PluginConnector]: CDTParser initialized 14.45/6.50 [2019-03-28 12:14:45,734 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 14.45/6.50 [2019-03-28 12:14:45,800 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/dec3e42613bf431bbae18ea6f44c57b8/FLAG7e8de965e 14.45/6.50 [2019-03-28 12:14:46,158 INFO L307 CDTParser]: Found 1 translation units. 14.45/6.50 [2019-03-28 12:14:46,159 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 14.45/6.50 [2019-03-28 12:14:46,166 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/dec3e42613bf431bbae18ea6f44c57b8/FLAG7e8de965e 14.45/6.50 [2019-03-28 12:14:46,556 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/dec3e42613bf431bbae18ea6f44c57b8 14.45/6.50 [2019-03-28 12:14:46,568 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 14.45/6.50 [2019-03-28 12:14:46,570 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 14.45/6.50 [2019-03-28 12:14:46,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 14.45/6.50 [2019-03-28 12:14:46,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 14.45/6.50 [2019-03-28 12:14:46,574 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 14.45/6.50 [2019-03-28 12:14:46,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:14:46" (1/1) ... 14.45/6.50 [2019-03-28 12:14:46,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6030bc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46, skipping insertion in model container 14.45/6.50 [2019-03-28 12:14:46,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:14:46" (1/1) ... 14.45/6.50 [2019-03-28 12:14:46,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 14.45/6.50 [2019-03-28 12:14:46,608 INFO L176 MainTranslator]: Built tables and reachable declarations 14.45/6.50 [2019-03-28 12:14:46,776 INFO L206 PostProcessor]: Analyzing one entry point: main 14.45/6.50 [2019-03-28 12:14:46,780 INFO L191 MainTranslator]: Completed pre-run 14.45/6.50 [2019-03-28 12:14:46,801 INFO L206 PostProcessor]: Analyzing one entry point: main 14.45/6.50 [2019-03-28 12:14:46,817 INFO L195 MainTranslator]: Completed translation 14.45/6.50 [2019-03-28 12:14:46,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46 WrapperNode 14.45/6.50 [2019-03-28 12:14:46,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 14.45/6.50 [2019-03-28 12:14:46,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 14.45/6.50 [2019-03-28 12:14:46,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 14.45/6.50 [2019-03-28 12:14:46,819 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 14.45/6.50 [2019-03-28 12:14:46,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (1/1) ... 14.45/6.50 [2019-03-28 12:14:46,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (1/1) ... 14.45/6.50 [2019-03-28 12:14:46,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 14.45/6.50 [2019-03-28 12:14:46,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 14.45/6.50 [2019-03-28 12:14:46,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 14.45/6.50 [2019-03-28 12:14:46,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized 14.45/6.50 [2019-03-28 12:14:46,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (1/1) ... 14.45/6.50 [2019-03-28 12:14:46,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (1/1) ... 14.45/6.50 [2019-03-28 12:14:46,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (1/1) ... 14.45/6.50 [2019-03-28 12:14:46,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (1/1) ... 14.45/6.50 [2019-03-28 12:14:46,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (1/1) ... 14.45/6.50 [2019-03-28 12:14:46,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (1/1) ... 14.45/6.50 [2019-03-28 12:14:46,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (1/1) ... 14.45/6.50 [2019-03-28 12:14:46,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 14.45/6.50 [2019-03-28 12:14:46,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 14.45/6.50 [2019-03-28 12:14:46,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... 14.45/6.50 [2019-03-28 12:14:46,940 INFO L276 PluginConnector]: RCFGBuilder initialized 14.45/6.50 [2019-03-28 12:14:46,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (1/1) ... 14.45/6.50 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 14.45/6.50 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 14.45/6.50 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 14.45/6.50 [2019-03-28 12:14:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 14.45/6.50 [2019-03-28 12:14:47,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 14.45/6.50 [2019-03-28 12:14:47,202 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 14.45/6.50 [2019-03-28 12:14:47,203 INFO L286 CfgBuilder]: Removed 35 assue(true) statements. 14.45/6.50 [2019-03-28 12:14:47,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:14:47 BoogieIcfgContainer 14.45/6.50 [2019-03-28 12:14:47,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 14.45/6.50 [2019-03-28 12:14:47,205 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 14.45/6.50 [2019-03-28 12:14:47,205 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 14.45/6.50 [2019-03-28 12:14:47,207 INFO L276 PluginConnector]: BlockEncodingV2 initialized 14.45/6.50 [2019-03-28 12:14:47,208 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:14:47" (1/1) ... 14.45/6.50 [2019-03-28 12:14:47,225 INFO L313 BlockEncoder]: Initial Icfg 38 locations, 55 edges 14.45/6.50 [2019-03-28 12:14:47,228 INFO L258 BlockEncoder]: Using Remove infeasible edges 14.45/6.50 [2019-03-28 12:14:47,229 INFO L263 BlockEncoder]: Using Maximize final states 14.45/6.50 [2019-03-28 12:14:47,230 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 14.45/6.50 [2019-03-28 12:14:47,230 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 14.45/6.50 [2019-03-28 12:14:47,232 INFO L296 BlockEncoder]: Using Remove sink states 14.45/6.50 [2019-03-28 12:14:47,234 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 14.45/6.50 [2019-03-28 12:14:47,234 INFO L179 BlockEncoder]: Using Rewrite not-equals 14.45/6.50 [2019-03-28 12:14:47,261 INFO L185 BlockEncoder]: Using Use SBE 14.45/6.50 [2019-03-28 12:14:47,292 INFO L200 BlockEncoder]: SBE split 15 edges 14.45/6.50 [2019-03-28 12:14:47,297 INFO L70 emoveInfeasibleEdges]: Removed 6 edges and 0 locations because of local infeasibility 14.45/6.50 [2019-03-28 12:14:47,299 INFO L71 MaximizeFinalStates]: 0 new accepting states 14.45/6.50 [2019-03-28 12:14:47,331 INFO L100 BaseMinimizeStates]: Removed 22 edges and 11 locations by large block encoding 14.45/6.50 [2019-03-28 12:14:47,334 INFO L70 RemoveSinkStates]: Removed 12 edges and 7 locations by removing sink states 14.45/6.50 [2019-03-28 12:14:47,336 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 14.45/6.50 [2019-03-28 12:14:47,336 INFO L71 MaximizeFinalStates]: 0 new accepting states 14.45/6.50 [2019-03-28 12:14:47,342 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 14.45/6.50 [2019-03-28 12:14:47,343 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 14.45/6.50 [2019-03-28 12:14:47,343 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 14.45/6.50 [2019-03-28 12:14:47,343 INFO L71 MaximizeFinalStates]: 0 new accepting states 14.45/6.50 [2019-03-28 12:14:47,346 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 14.45/6.50 [2019-03-28 12:14:47,347 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 14.45/6.50 [2019-03-28 12:14:47,347 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 14.45/6.50 [2019-03-28 12:14:47,348 INFO L71 MaximizeFinalStates]: 0 new accepting states 14.45/6.50 [2019-03-28 12:14:47,348 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 14.45/6.50 [2019-03-28 12:14:47,348 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 14.45/6.50 [2019-03-28 12:14:47,349 INFO L313 BlockEncoder]: Encoded RCFG 16 locations, 43 edges 14.45/6.50 [2019-03-28 12:14:47,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:14:47 BasicIcfg 14.45/6.50 [2019-03-28 12:14:47,349 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 14.45/6.50 [2019-03-28 12:14:47,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 14.45/6.50 [2019-03-28 12:14:47,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... 14.45/6.50 [2019-03-28 12:14:47,354 INFO L276 PluginConnector]: TraceAbstraction initialized 14.45/6.50 [2019-03-28 12:14:47,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:14:46" (1/4) ... 14.45/6.50 [2019-03-28 12:14:47,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757de505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:14:47, skipping insertion in model container 14.45/6.50 [2019-03-28 12:14:47,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (2/4) ... 14.45/6.50 [2019-03-28 12:14:47,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757de505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:14:47, skipping insertion in model container 14.45/6.50 [2019-03-28 12:14:47,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:14:47" (3/4) ... 14.45/6.50 [2019-03-28 12:14:47,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757de505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:14:47, skipping insertion in model container 14.45/6.50 [2019-03-28 12:14:47,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:14:47" (4/4) ... 14.45/6.50 [2019-03-28 12:14:47,358 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 14.45/6.50 [2019-03-28 12:14:47,368 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 14.45/6.50 [2019-03-28 12:14:47,376 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 14.45/6.50 [2019-03-28 12:14:47,393 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 14.45/6.50 [2019-03-28 12:14:47,422 INFO L133 ementStrategyFactory]: Using default assertion order modulation 14.45/6.50 [2019-03-28 12:14:47,422 INFO L382 AbstractCegarLoop]: Interprodecural is true 14.45/6.50 [2019-03-28 12:14:47,423 INFO L383 AbstractCegarLoop]: Hoare is true 14.45/6.50 [2019-03-28 12:14:47,423 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 14.45/6.50 [2019-03-28 12:14:47,423 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 14.45/6.50 [2019-03-28 12:14:47,423 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 14.45/6.50 [2019-03-28 12:14:47,423 INFO L387 AbstractCegarLoop]: Difference is false 14.45/6.50 [2019-03-28 12:14:47,423 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 14.45/6.50 [2019-03-28 12:14:47,423 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 14.45/6.50 [2019-03-28 12:14:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. 14.45/6.50 [2019-03-28 12:14:47,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 14.45/6.50 [2019-03-28 12:14:47,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. 14.45/6.50 [2019-03-28 12:14:47,509 INFO L451 ceAbstractionStarter]: At program point L97(lines 97 100) the Hoare annotation is: true 14.45/6.50 [2019-03-28 12:14:47,509 INFO L451 ceAbstractionStarter]: At program point L62(lines 55 64) the Hoare annotation is: true 14.45/6.50 [2019-03-28 12:14:47,510 INFO L451 ceAbstractionStarter]: At program point L89(lines 89 92) the Hoare annotation is: true 14.45/6.50 [2019-03-28 12:14:47,510 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 84) no Hoare annotation was computed. 14.45/6.50 [2019-03-28 12:14:47,510 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. 14.45/6.50 [2019-03-28 12:14:47,510 INFO L448 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. 14.45/6.50 [2019-03-28 12:14:47,510 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 43) no Hoare annotation was computed. 14.45/6.50 [2019-03-28 12:14:47,510 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. 14.45/6.50 [2019-03-28 12:14:47,511 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true 14.45/6.50 [2019-03-28 12:14:47,511 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 63) no Hoare annotation was computed. 14.45/6.50 [2019-03-28 12:14:47,511 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. 14.45/6.50 [2019-03-28 12:14:47,511 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. 14.45/6.50 [2019-03-28 12:14:47,511 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true 14.45/6.50 [2019-03-28 12:14:47,512 INFO L451 ceAbstractionStarter]: At program point L78(lines 78 113) the Hoare annotation is: true 14.45/6.50 [2019-03-28 12:14:47,512 INFO L451 ceAbstractionStarter]: At program point L76-2(lines 76 114) the Hoare annotation is: true 14.45/6.50 [2019-03-28 12:14:47,512 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 108) no Hoare annotation was computed. 14.45/6.50 [2019-03-28 12:14:47,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:14:47 BasicIcfg 14.45/6.50 [2019-03-28 12:14:47,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 14.45/6.50 [2019-03-28 12:14:47,522 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 14.45/6.50 [2019-03-28 12:14:47,522 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 14.45/6.50 [2019-03-28 12:14:47,525 INFO L276 PluginConnector]: BuchiAutomizer initialized 14.45/6.50 [2019-03-28 12:14:47,526 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 14.45/6.50 [2019-03-28 12:14:47,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:14:46" (1/5) ... 14.45/6.50 [2019-03-28 12:14:47,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c1b61ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:14:47, skipping insertion in model container 14.45/6.50 [2019-03-28 12:14:47,527 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 14.45/6.50 [2019-03-28 12:14:47,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:46" (2/5) ... 14.45/6.50 [2019-03-28 12:14:47,528 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c1b61ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:14:47, skipping insertion in model container 14.45/6.50 [2019-03-28 12:14:47,528 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 14.45/6.50 [2019-03-28 12:14:47,528 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:14:47" (3/5) ... 14.45/6.50 [2019-03-28 12:14:47,528 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c1b61ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:14:47, skipping insertion in model container 14.45/6.50 [2019-03-28 12:14:47,529 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 14.45/6.50 [2019-03-28 12:14:47,529 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:14:47" (4/5) ... 14.45/6.50 [2019-03-28 12:14:47,529 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c1b61ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:14:47, skipping insertion in model container 14.45/6.50 [2019-03-28 12:14:47,529 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 14.45/6.50 [2019-03-28 12:14:47,529 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:14:47" (5/5) ... 14.45/6.50 [2019-03-28 12:14:47,531 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 14.45/6.50 [2019-03-28 12:14:47,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation 14.45/6.50 [2019-03-28 12:14:47,557 INFO L374 BuchiCegarLoop]: Interprodecural is true 14.45/6.50 [2019-03-28 12:14:47,557 INFO L375 BuchiCegarLoop]: Hoare is true 14.45/6.50 [2019-03-28 12:14:47,558 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 14.45/6.50 [2019-03-28 12:14:47,558 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 14.45/6.50 [2019-03-28 12:14:47,558 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 14.45/6.50 [2019-03-28 12:14:47,558 INFO L379 BuchiCegarLoop]: Difference is false 14.45/6.50 [2019-03-28 12:14:47,558 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 14.45/6.50 [2019-03-28 12:14:47,558 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 14.45/6.50 [2019-03-28 12:14:47,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. 14.45/6.50 [2019-03-28 12:14:47,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 14.45/6.50 [2019-03-28 12:14:47,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.45/6.50 [2019-03-28 12:14:47,582 INFO L119 BuchiIsEmpty]: Starting construction of run 14.45/6.50 [2019-03-28 12:14:47,589 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 14.45/6.50 [2019-03-28 12:14:47,589 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 14.45/6.50 [2019-03-28 12:14:47,589 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 14.45/6.50 [2019-03-28 12:14:47,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. 14.45/6.50 [2019-03-28 12:14:47,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 14.45/6.50 [2019-03-28 12:14:47,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.45/6.50 [2019-03-28 12:14:47,592 INFO L119 BuchiIsEmpty]: Starting construction of run 14.45/6.50 [2019-03-28 12:14:47,592 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 14.45/6.50 [2019-03-28 12:14:47,592 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 14.45/6.50 [2019-03-28 12:14:47,597 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue [252] ULTIMATE.startENTRY-->L76-2: Formula: (and (= 0 v_~open_called~0_9) (= v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20 0) (= |v_ULTIMATE.start_my_init_#res_5| 0) (= v_~ldv_mutex~0_17 1)) InVars {} OutVars{ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_8|, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~ret1=|v_ULTIMATE.start_main_#t~ret1_5|, ~open_called~0=v_~open_called~0_9, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_5|, ULTIMATE.start_my_init_#res=|v_ULTIMATE.start_my_init_#res_5|, ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_19|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_5|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ~ldv_mutex~0=v_~ldv_mutex~0_17, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_5|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~ret1, ~open_called~0, ULTIMATE.start_main_#t~post8, ULTIMATE.start_my_init_#res, ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_main_#t~ret9, ~ldv_mutex~0, ULTIMATE.start_main_#t~ret7, ULTIMATE.start_main_#t~ret5] 10#L76-2true 14.45/6.50 [2019-03-28 12:14:47,598 INFO L796 eck$LassoCheckResult]: Loop: 10#L76-2true [214] L76-2-->L80: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) |v_ULTIMATE.start_main_#t~switch4_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet2] 3#L80true [144] L80-->L81: Formula: |v_ULTIMATE.start_main_#t~switch4_4| InVars {ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_4|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_4|} AuxVars[] AssignedVars[] 6#L81true [225] L81-->L78: Formula: (> 0 v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_7) InVars {ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_7} OutVars{ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_7} AuxVars[] AssignedVars[] 16#L78true [168] L78-->L76-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet3] 10#L76-2true 14.45/6.50 [2019-03-28 12:14:47,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.50 [2019-03-28 12:14:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash 283, now seen corresponding path program 1 times 14.45/6.50 [2019-03-28 12:14:47,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.50 [2019-03-28 12:14:47,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.50 [2019-03-28 12:14:47,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.50 [2019-03-28 12:14:47,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.45/6.50 [2019-03-28 12:14:47,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.50 [2019-03-28 12:14:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.50 [2019-03-28 12:14:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.50 [2019-03-28 12:14:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.50 [2019-03-28 12:14:47,674 INFO L82 PathProgramCache]: Analyzing trace with hash 7444322, now seen corresponding path program 1 times 14.45/6.50 [2019-03-28 12:14:47,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.50 [2019-03-28 12:14:47,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:47,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:47,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:47,684 INFO L82 PathProgramCache]: Analyzing trace with hash 267877244, now seen corresponding path program 1 times 14.45/6.51 [2019-03-28 12:14:47,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:47,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:47,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.45/6.51 [2019-03-28 12:14:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 14.45/6.51 [2019-03-28 12:14:47,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 14.45/6.51 [2019-03-28 12:14:47,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 14.45/6.51 [2019-03-28 12:14:47,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 14.45/6.51 [2019-03-28 12:14:47,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 14.45/6.51 [2019-03-28 12:14:47,807 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. 14.45/6.51 [2019-03-28 12:14:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 14.45/6.51 [2019-03-28 12:14:47,873 INFO L93 Difference]: Finished difference Result 16 states and 42 transitions. 14.45/6.51 [2019-03-28 12:14:47,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 14.45/6.51 [2019-03-28 12:14:47,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 42 transitions. 14.45/6.51 [2019-03-28 12:14:47,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 14.45/6.51 [2019-03-28 12:14:47,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 42 transitions. 14.45/6.51 [2019-03-28 12:14:47,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 14.45/6.51 [2019-03-28 12:14:47,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 14.45/6.51 [2019-03-28 12:14:47,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 42 transitions. 14.45/6.51 [2019-03-28 12:14:47,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 14.45/6.51 [2019-03-28 12:14:47,887 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 42 transitions. 14.45/6.51 [2019-03-28 12:14:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 42 transitions. 14.45/6.51 [2019-03-28 12:14:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 14.45/6.51 [2019-03-28 12:14:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 14.45/6.51 [2019-03-28 12:14:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 42 transitions. 14.45/6.51 [2019-03-28 12:14:47,918 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 42 transitions. 14.45/6.51 [2019-03-28 12:14:47,918 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 42 transitions. 14.45/6.51 [2019-03-28 12:14:47,918 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 14.45/6.51 [2019-03-28 12:14:47,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 42 transitions. 14.45/6.51 [2019-03-28 12:14:47,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 14.45/6.51 [2019-03-28 12:14:47,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.45/6.51 [2019-03-28 12:14:47,920 INFO L119 BuchiIsEmpty]: Starting construction of run 14.45/6.51 [2019-03-28 12:14:47,920 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 14.45/6.51 [2019-03-28 12:14:47,920 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 14.45/6.51 [2019-03-28 12:14:47,921 INFO L794 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY [252] ULTIMATE.startENTRY-->L76-2: Formula: (and (= 0 v_~open_called~0_9) (= v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20 0) (= |v_ULTIMATE.start_my_init_#res_5| 0) (= v_~ldv_mutex~0_17 1)) InVars {} OutVars{ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_8|, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~ret1=|v_ULTIMATE.start_main_#t~ret1_5|, ~open_called~0=v_~open_called~0_9, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_5|, ULTIMATE.start_my_init_#res=|v_ULTIMATE.start_my_init_#res_5|, ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_19|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_5|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ~ldv_mutex~0=v_~ldv_mutex~0_17, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_5|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~ret1, ~open_called~0, ULTIMATE.start_main_#t~post8, ULTIMATE.start_my_init_#res, ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_main_#t~ret9, ~ldv_mutex~0, ULTIMATE.start_main_#t~ret7, ULTIMATE.start_main_#t~ret5] 54#L76-2 14.45/6.51 [2019-03-28 12:14:47,921 INFO L796 eck$LassoCheckResult]: Loop: 54#L76-2 [214] L76-2-->L80: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) |v_ULTIMATE.start_main_#t~switch4_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet2] 46#L80 [144] L80-->L81: Formula: |v_ULTIMATE.start_main_#t~switch4_4| InVars {ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_4|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_4|} AuxVars[] AssignedVars[] 47#L81 [226] L81-->L78: Formula: (< 0 v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_7) InVars {ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_7} OutVars{ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_7} AuxVars[] AssignedVars[] 44#L78 [168] L78-->L76-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet3] 54#L76-2 14.45/6.51 [2019-03-28 12:14:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:47,922 INFO L82 PathProgramCache]: Analyzing trace with hash 283, now seen corresponding path program 2 times 14.45/6.51 [2019-03-28 12:14:47,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:47,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:47,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:47,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:47,929 INFO L82 PathProgramCache]: Analyzing trace with hash 7444353, now seen corresponding path program 1 times 14.45/6.51 [2019-03-28 12:14:47,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:47,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash 267877275, now seen corresponding path program 1 times 14.45/6.51 [2019-03-28 12:14:47,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:47,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:47,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.45/6.51 [2019-03-28 12:14:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 14.45/6.51 [2019-03-28 12:14:47,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 14.45/6.51 [2019-03-28 12:14:47,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 14.45/6.51 [2019-03-28 12:14:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 14.45/6.51 [2019-03-28 12:14:47,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 14.45/6.51 [2019-03-28 12:14:47,981 INFO L87 Difference]: Start difference. First operand 16 states and 42 transitions. cyclomatic complexity: 27 Second operand 3 states. 14.45/6.51 [2019-03-28 12:14:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 14.45/6.51 [2019-03-28 12:14:48,100 INFO L93 Difference]: Finished difference Result 27 states and 69 transitions. 14.45/6.51 [2019-03-28 12:14:48,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 14.45/6.51 [2019-03-28 12:14:48,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 69 transitions. 14.45/6.51 [2019-03-28 12:14:48,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 14.45/6.51 [2019-03-28 12:14:48,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 69 transitions. 14.45/6.51 [2019-03-28 12:14:48,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 14.45/6.51 [2019-03-28 12:14:48,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 14.45/6.51 [2019-03-28 12:14:48,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 69 transitions. 14.45/6.51 [2019-03-28 12:14:48,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 14.45/6.51 [2019-03-28 12:14:48,106 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 69 transitions. 14.45/6.51 [2019-03-28 12:14:48,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 69 transitions. 14.45/6.51 [2019-03-28 12:14:48,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 14.45/6.51 [2019-03-28 12:14:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 14.45/6.51 [2019-03-28 12:14:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 69 transitions. 14.45/6.51 [2019-03-28 12:14:48,110 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 69 transitions. 14.45/6.51 [2019-03-28 12:14:48,110 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 69 transitions. 14.45/6.51 [2019-03-28 12:14:48,110 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 14.45/6.51 [2019-03-28 12:14:48,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 69 transitions. 14.45/6.51 [2019-03-28 12:14:48,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 14.45/6.51 [2019-03-28 12:14:48,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.45/6.51 [2019-03-28 12:14:48,112 INFO L119 BuchiIsEmpty]: Starting construction of run 14.45/6.51 [2019-03-28 12:14:48,112 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 14.45/6.51 [2019-03-28 12:14:48,112 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 14.45/6.51 [2019-03-28 12:14:48,112 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY [252] ULTIMATE.startENTRY-->L76-2: Formula: (and (= 0 v_~open_called~0_9) (= v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20 0) (= |v_ULTIMATE.start_my_init_#res_5| 0) (= v_~ldv_mutex~0_17 1)) InVars {} OutVars{ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_8|, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~ret1=|v_ULTIMATE.start_main_#t~ret1_5|, ~open_called~0=v_~open_called~0_9, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_5|, ULTIMATE.start_my_init_#res=|v_ULTIMATE.start_my_init_#res_5|, ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_19|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_5|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ~ldv_mutex~0=v_~ldv_mutex~0_17, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_5|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~ret1, ~open_called~0, ULTIMATE.start_main_#t~post8, ULTIMATE.start_my_init_#res, ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_main_#t~ret9, ~ldv_mutex~0, ULTIMATE.start_main_#t~ret7, ULTIMATE.start_main_#t~ret5] 105#L76-2 14.45/6.51 [2019-03-28 12:14:48,113 INFO L796 eck$LassoCheckResult]: Loop: 105#L76-2 [214] L76-2-->L80: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) |v_ULTIMATE.start_main_#t~switch4_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet2] 94#L80 [224] L80-->L88: Formula: (and (not |v_ULTIMATE.start_main_#t~switch4_6|) |v_ULTIMATE.start_main_#t~switch4_5| (= 1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4] 96#L88 [193] L88-->L89: Formula: |v_ULTIMATE.start_main_#t~switch4_7| InVars {ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_7|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_7|} AuxVars[] AssignedVars[] 110#L89 [233] L89-->L78: Formula: (< v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11 1) InVars {ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11} OutVars{ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11} AuxVars[] AssignedVars[] 98#L78 [168] L78-->L76-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet3] 105#L76-2 14.45/6.51 [2019-03-28 12:14:48,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:48,113 INFO L82 PathProgramCache]: Analyzing trace with hash 283, now seen corresponding path program 3 times 14.45/6.51 [2019-03-28 12:14:48,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:48,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:48,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:48,120 INFO L82 PathProgramCache]: Analyzing trace with hash 233128693, now seen corresponding path program 1 times 14.45/6.51 [2019-03-28 12:14:48,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:48,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:48,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.45/6.51 [2019-03-28 12:14:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 14.45/6.51 [2019-03-28 12:14:48,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 14.45/6.51 [2019-03-28 12:14:48,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 14.45/6.51 [2019-03-28 12:14:48,132 INFO L811 eck$LassoCheckResult]: loop already infeasible 14.45/6.51 [2019-03-28 12:14:48,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 14.45/6.51 [2019-03-28 12:14:48,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 14.45/6.51 [2019-03-28 12:14:48,132 INFO L87 Difference]: Start difference. First operand 27 states and 69 transitions. cyclomatic complexity: 43 Second operand 3 states. 14.45/6.51 [2019-03-28 12:14:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 14.45/6.51 [2019-03-28 12:14:48,209 INFO L93 Difference]: Finished difference Result 51 states and 113 transitions. 14.45/6.51 [2019-03-28 12:14:48,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 14.45/6.51 [2019-03-28 12:14:48,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 113 transitions. 14.45/6.51 [2019-03-28 12:14:48,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 14.45/6.51 [2019-03-28 12:14:48,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 113 transitions. 14.45/6.51 [2019-03-28 12:14:48,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 14.45/6.51 [2019-03-28 12:14:48,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 14.45/6.51 [2019-03-28 12:14:48,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 113 transitions. 14.45/6.51 [2019-03-28 12:14:48,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 14.45/6.51 [2019-03-28 12:14:48,215 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 113 transitions. 14.45/6.51 [2019-03-28 12:14:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 113 transitions. 14.45/6.51 [2019-03-28 12:14:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. 14.45/6.51 [2019-03-28 12:14:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 14.45/6.51 [2019-03-28 12:14:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 81 transitions. 14.45/6.51 [2019-03-28 12:14:48,219 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 81 transitions. 14.45/6.51 [2019-03-28 12:14:48,220 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 81 transitions. 14.45/6.51 [2019-03-28 12:14:48,220 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 14.45/6.51 [2019-03-28 12:14:48,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 81 transitions. 14.45/6.51 [2019-03-28 12:14:48,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 14.45/6.51 [2019-03-28 12:14:48,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.45/6.51 [2019-03-28 12:14:48,221 INFO L119 BuchiIsEmpty]: Starting construction of run 14.45/6.51 [2019-03-28 12:14:48,222 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 14.45/6.51 [2019-03-28 12:14:48,222 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 14.45/6.51 [2019-03-28 12:14:48,222 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY [252] ULTIMATE.startENTRY-->L76-2: Formula: (and (= 0 v_~open_called~0_9) (= v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20 0) (= |v_ULTIMATE.start_my_init_#res_5| 0) (= v_~ldv_mutex~0_17 1)) InVars {} OutVars{ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_8|, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~ret1=|v_ULTIMATE.start_main_#t~ret1_5|, ~open_called~0=v_~open_called~0_9, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_5|, ULTIMATE.start_my_init_#res=|v_ULTIMATE.start_my_init_#res_5|, ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_19|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_5|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ~ldv_mutex~0=v_~ldv_mutex~0_17, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_5|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~ret1, ~open_called~0, ULTIMATE.start_main_#t~post8, ULTIMATE.start_my_init_#res, ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_main_#t~ret9, ~ldv_mutex~0, ULTIMATE.start_main_#t~ret7, ULTIMATE.start_main_#t~ret5] 197#L76-2 14.45/6.51 [2019-03-28 12:14:48,223 INFO L796 eck$LassoCheckResult]: Loop: 197#L76-2 [214] L76-2-->L80: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (= 0 |v_ULTIMATE.start_main_#t~nondet3_3|) |v_ULTIMATE.start_main_#t~switch4_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet2] 208#L80 [222] L80-->L88: Formula: (and (not |v_ULTIMATE.start_main_#t~switch4_6|) (not |v_ULTIMATE.start_main_#t~switch4_5|) (> 1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4] 206#L88 [193] L88-->L89: Formula: |v_ULTIMATE.start_main_#t~switch4_7| InVars {ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_7|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_7|} AuxVars[] AssignedVars[] 201#L89 [233] L89-->L78: Formula: (< v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11 1) InVars {ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11} OutVars{ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11} AuxVars[] AssignedVars[] 182#L78 [168] L78-->L76-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet3] 197#L76-2 14.45/6.51 [2019-03-28 12:14:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash 283, now seen corresponding path program 4 times 14.45/6.51 [2019-03-28 12:14:48,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:48,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash 233069111, now seen corresponding path program 1 times 14.45/6.51 [2019-03-28 12:14:48,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:48,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.45/6.51 [2019-03-28 12:14:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 14.45/6.51 [2019-03-28 12:14:48,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 14.45/6.51 [2019-03-28 12:14:48,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 14.45/6.51 [2019-03-28 12:14:48,239 INFO L811 eck$LassoCheckResult]: loop already infeasible 14.45/6.51 [2019-03-28 12:14:48,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 14.45/6.51 [2019-03-28 12:14:48,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 14.45/6.51 [2019-03-28 12:14:48,239 INFO L87 Difference]: Start difference. First operand 33 states and 81 transitions. cyclomatic complexity: 49 Second operand 3 states. 14.45/6.51 [2019-03-28 12:14:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 14.45/6.51 [2019-03-28 12:14:48,303 INFO L93 Difference]: Finished difference Result 41 states and 87 transitions. 14.45/6.51 [2019-03-28 12:14:48,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 14.45/6.51 [2019-03-28 12:14:48,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 87 transitions. 14.45/6.51 [2019-03-28 12:14:48,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 14.45/6.51 [2019-03-28 12:14:48,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 87 transitions. 14.45/6.51 [2019-03-28 12:14:48,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 14.45/6.51 [2019-03-28 12:14:48,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 14.45/6.51 [2019-03-28 12:14:48,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 87 transitions. 14.45/6.51 [2019-03-28 12:14:48,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 14.45/6.51 [2019-03-28 12:14:48,308 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 87 transitions. 14.45/6.51 [2019-03-28 12:14:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 87 transitions. 14.45/6.51 [2019-03-28 12:14:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. 14.45/6.51 [2019-03-28 12:14:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 14.45/6.51 [2019-03-28 12:14:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 87 transitions. 14.45/6.51 [2019-03-28 12:14:48,313 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 87 transitions. 14.45/6.51 [2019-03-28 12:14:48,313 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 87 transitions. 14.45/6.51 [2019-03-28 12:14:48,313 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 14.45/6.51 [2019-03-28 12:14:48,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 87 transitions. 14.45/6.51 [2019-03-28 12:14:48,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 14.45/6.51 [2019-03-28 12:14:48,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.45/6.51 [2019-03-28 12:14:48,314 INFO L119 BuchiIsEmpty]: Starting construction of run 14.45/6.51 [2019-03-28 12:14:48,315 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 14.45/6.51 [2019-03-28 12:14:48,315 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 14.45/6.51 [2019-03-28 12:14:48,315 INFO L794 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY [252] ULTIMATE.startENTRY-->L76-2: Formula: (and (= 0 v_~open_called~0_9) (= v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20 0) (= |v_ULTIMATE.start_my_init_#res_5| 0) (= v_~ldv_mutex~0_17 1)) InVars {} OutVars{ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_8|, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~ret1=|v_ULTIMATE.start_main_#t~ret1_5|, ~open_called~0=v_~open_called~0_9, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_5|, ULTIMATE.start_my_init_#res=|v_ULTIMATE.start_my_init_#res_5|, ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_19|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_5|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ~ldv_mutex~0=v_~ldv_mutex~0_17, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_5|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~ret1, ~open_called~0, ULTIMATE.start_main_#t~post8, ULTIMATE.start_my_init_#res, ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_main_#t~ret9, ~ldv_mutex~0, ULTIMATE.start_main_#t~ret7, ULTIMATE.start_main_#t~ret5] 269#L76-2 14.45/6.51 [2019-03-28 12:14:48,316 INFO L796 eck$LassoCheckResult]: Loop: 269#L76-2 [215] L76-2-->L80: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (not |v_ULTIMATE.start_main_#t~switch4_3|) (> 0 |v_ULTIMATE.start_main_#t~nondet3_3|)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet2] 270#L80 [222] L80-->L88: Formula: (and (not |v_ULTIMATE.start_main_#t~switch4_6|) (not |v_ULTIMATE.start_main_#t~switch4_5|) (> 1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4] 296#L88 [193] L88-->L89: Formula: |v_ULTIMATE.start_main_#t~switch4_7| InVars {ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_7|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_7|} AuxVars[] AssignedVars[] 279#L89 [233] L89-->L78: Formula: (< v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11 1) InVars {ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11} OutVars{ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11} AuxVars[] AssignedVars[] 259#L78 [168] L78-->L76-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet3] 269#L76-2 14.45/6.51 [2019-03-28 12:14:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash 283, now seen corresponding path program 5 times 14.45/6.51 [2019-03-28 12:14:48,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:48,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:48,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:48,323 INFO L82 PathProgramCache]: Analyzing trace with hash 233992632, now seen corresponding path program 1 times 14.45/6.51 [2019-03-28 12:14:48,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:48,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:48,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.45/6.51 [2019-03-28 12:14:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 14.45/6.51 [2019-03-28 12:14:48,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 14.45/6.51 [2019-03-28 12:14:48,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 14.45/6.51 [2019-03-28 12:14:48,333 INFO L811 eck$LassoCheckResult]: loop already infeasible 14.45/6.51 [2019-03-28 12:14:48,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 14.45/6.51 [2019-03-28 12:14:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 14.45/6.51 [2019-03-28 12:14:48,334 INFO L87 Difference]: Start difference. First operand 41 states and 87 transitions. cyclomatic complexity: 47 Second operand 3 states. 14.45/6.51 [2019-03-28 12:14:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 14.45/6.51 [2019-03-28 12:14:48,402 INFO L93 Difference]: Finished difference Result 41 states and 73 transitions. 14.45/6.51 [2019-03-28 12:14:48,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 14.45/6.51 [2019-03-28 12:14:48,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 73 transitions. 14.45/6.51 [2019-03-28 12:14:48,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 14.45/6.51 [2019-03-28 12:14:48,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 73 transitions. 14.45/6.51 [2019-03-28 12:14:48,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 14.45/6.51 [2019-03-28 12:14:48,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 14.45/6.51 [2019-03-28 12:14:48,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 73 transitions. 14.45/6.51 [2019-03-28 12:14:48,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 14.45/6.51 [2019-03-28 12:14:48,407 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 73 transitions. 14.45/6.51 [2019-03-28 12:14:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 73 transitions. 14.45/6.51 [2019-03-28 12:14:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. 14.45/6.51 [2019-03-28 12:14:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 14.45/6.51 [2019-03-28 12:14:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. 14.45/6.51 [2019-03-28 12:14:48,410 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 73 transitions. 14.45/6.51 [2019-03-28 12:14:48,411 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 73 transitions. 14.45/6.51 [2019-03-28 12:14:48,411 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 14.45/6.51 [2019-03-28 12:14:48,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 73 transitions. 14.45/6.51 [2019-03-28 12:14:48,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 14.45/6.51 [2019-03-28 12:14:48,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.45/6.51 [2019-03-28 12:14:48,412 INFO L119 BuchiIsEmpty]: Starting construction of run 14.45/6.51 [2019-03-28 12:14:48,412 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 14.45/6.51 [2019-03-28 12:14:48,412 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 14.45/6.51 [2019-03-28 12:14:48,413 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY [252] ULTIMATE.startENTRY-->L76-2: Formula: (and (= 0 v_~open_called~0_9) (= v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20 0) (= |v_ULTIMATE.start_my_init_#res_5| 0) (= v_~ldv_mutex~0_17 1)) InVars {} OutVars{ULTIMATE.start_main_#t~post10=|v_ULTIMATE.start_main_#t~post10_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_8|, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_20, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~ret1=|v_ULTIMATE.start_main_#t~ret1_5|, ~open_called~0=v_~open_called~0_9, ULTIMATE.start_main_#t~post8=|v_ULTIMATE.start_main_#t~post8_5|, ULTIMATE.start_my_init_#res=|v_ULTIMATE.start_my_init_#res_5|, ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_19|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_5|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ~ldv_mutex~0=v_~ldv_mutex~0_17, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_5|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post10, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~ret1, ~open_called~0, ULTIMATE.start_main_#t~post8, ULTIMATE.start_my_init_#res, ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_main_#t~ret9, ~ldv_mutex~0, ULTIMATE.start_main_#t~ret7, ULTIMATE.start_main_#t~ret5] 357#L76-2 14.45/6.51 [2019-03-28 12:14:48,413 INFO L796 eck$LassoCheckResult]: Loop: 357#L76-2 [217] L76-2-->L80: Formula: (and (not |v_ULTIMATE.start_main_#t~switch4_3|) (< 0 |v_ULTIMATE.start_main_#t~nondet3_3|) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet2] 360#L80 [224] L80-->L88: Formula: (and (not |v_ULTIMATE.start_main_#t~switch4_6|) |v_ULTIMATE.start_main_#t~switch4_5| (= 1 |v_ULTIMATE.start_main_#t~nondet3_4|)) InVars {ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4] 382#L88 [193] L88-->L89: Formula: |v_ULTIMATE.start_main_#t~switch4_7| InVars {ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_7|} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_7|} AuxVars[] AssignedVars[] 365#L89 [233] L89-->L78: Formula: (< v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11 1) InVars {ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11} OutVars{ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0=v_ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0_11} AuxVars[] AssignedVars[] 351#L78 [168] L78-->L76-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~switch4=|v_ULTIMATE.start_main_#t~switch4_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~switch4, ULTIMATE.start_main_#t~nondet3] 357#L76-2 14.45/6.51 [2019-03-28 12:14:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:48,414 INFO L82 PathProgramCache]: Analyzing trace with hash 283, now seen corresponding path program 6 times 14.45/6.51 [2019-03-28 12:14:48,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:48,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:48,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:48,421 INFO L82 PathProgramCache]: Analyzing trace with hash 235899256, now seen corresponding path program 1 times 14.45/6.51 [2019-03-28 12:14:48,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:48,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:48,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.45/6.51 [2019-03-28 12:14:48,430 INFO L82 PathProgramCache]: Analyzing trace with hash -280614754, now seen corresponding path program 1 times 14.45/6.51 [2019-03-28 12:14:48,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.45/6.51 [2019-03-28 12:14:48,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.45/6.51 [2019-03-28 12:14:48,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.45/6.51 [2019-03-28 12:14:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.45/6.51 [2019-03-28 12:14:48,510 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement 14.45/6.51 [2019-03-28 12:14:48,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:14:48 BasicIcfg 14.45/6.51 [2019-03-28 12:14:48,521 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 14.45/6.51 [2019-03-28 12:14:48,522 INFO L168 Benchmark]: Toolchain (without parser) took 1953.11 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 564.9 MB in the beginning and 476.5 MB in the end (delta: 88.4 MB). Peak memory consumption was 108.8 MB. Max. memory is 50.3 GB. 14.45/6.51 [2019-03-28 12:14:48,523 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 14.45/6.51 [2019-03-28 12:14:48,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.56 ms. Allocated memory is still 649.6 MB. Free memory was 564.9 MB in the beginning and 554.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 14.45/6.51 [2019-03-28 12:14:48,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.03 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 554.1 MB in the beginning and 636.2 MB in the end (delta: -82.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 50.3 GB. 14.45/6.51 [2019-03-28 12:14:48,525 INFO L168 Benchmark]: Boogie Preprocessor took 25.58 ms. Allocated memory is still 670.0 MB. Free memory was 636.2 MB in the beginning and 633.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 14.45/6.51 [2019-03-28 12:14:48,526 INFO L168 Benchmark]: RCFGBuilder took 264.62 ms. Allocated memory is still 670.0 MB. Free memory was 633.1 MB in the beginning and 612.3 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. 14.45/6.51 [2019-03-28 12:14:48,526 INFO L168 Benchmark]: BlockEncodingV2 took 144.74 ms. Allocated memory is still 670.0 MB. Free memory was 612.3 MB in the beginning and 601.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 14.45/6.51 [2019-03-28 12:14:48,527 INFO L168 Benchmark]: TraceAbstraction took 170.94 ms. Allocated memory is still 670.0 MB. Free memory was 601.5 MB in the beginning and 590.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 14.45/6.51 [2019-03-28 12:14:48,528 INFO L168 Benchmark]: BuchiAutomizer took 999.16 ms. Allocated memory is still 670.0 MB. Free memory was 590.7 MB in the beginning and 476.5 MB in the end (delta: 114.2 MB). Peak memory consumption was 114.2 MB. Max. memory is 50.3 GB. 14.45/6.51 [2019-03-28 12:14:48,532 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 14.45/6.51 --- Results --- 14.45/6.51 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 14.45/6.51 - StatisticsResult: Initial Icfg 14.45/6.51 38 locations, 55 edges 14.45/6.51 - StatisticsResult: Encoded RCFG 14.45/6.51 16 locations, 43 edges 14.45/6.51 * Results from de.uni_freiburg.informatik.ultimate.core: 14.45/6.51 - StatisticsResult: Toolchain Benchmarks 14.45/6.51 Benchmark results are: 14.45/6.51 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 14.45/6.51 * CACSL2BoogieTranslator took 247.56 ms. Allocated memory is still 649.6 MB. Free memory was 564.9 MB in the beginning and 554.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 14.45/6.51 * Boogie Procedure Inliner took 95.03 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 554.1 MB in the beginning and 636.2 MB in the end (delta: -82.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 50.3 GB. 14.45/6.51 * Boogie Preprocessor took 25.58 ms. Allocated memory is still 670.0 MB. Free memory was 636.2 MB in the beginning and 633.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 14.45/6.51 * RCFGBuilder took 264.62 ms. Allocated memory is still 670.0 MB. Free memory was 633.1 MB in the beginning and 612.3 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 50.3 GB. 14.45/6.51 * BlockEncodingV2 took 144.74 ms. Allocated memory is still 670.0 MB. Free memory was 612.3 MB in the beginning and 601.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 14.45/6.51 * TraceAbstraction took 170.94 ms. Allocated memory is still 670.0 MB. Free memory was 601.5 MB in the beginning and 590.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 14.45/6.51 * BuchiAutomizer took 999.16 ms. Allocated memory is still 670.0 MB. Free memory was 590.7 MB in the beginning and 476.5 MB in the end (delta: 114.2 MB). Peak memory consumption was 114.2 MB. Max. memory is 50.3 GB. 14.45/6.51 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 14.45/6.51 - GenericResult: Unfinished Backtranslation 14.45/6.51 Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement 14.45/6.51 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 14.45/6.51 - AllSpecificationsHoldResult: All specifications hold 14.45/6.51 We were not able to verify any specifiation because the program does not contain any specification. 14.45/6.51 - InvariantResult [Line: 76]: Loop Invariant 14.45/6.51 Derived loop invariant: 1 14.45/6.51 - InvariantResult [Line: -1]: Loop Invariant 14.45/6.51 Derived loop invariant: 1 14.45/6.51 - InvariantResult [Line: 16]: Loop Invariant 14.45/6.51 Derived loop invariant: 1 14.45/6.51 - InvariantResult [Line: 97]: Loop Invariant 14.45/6.51 Derived loop invariant: 1 14.45/6.51 - InvariantResult [Line: 78]: Loop Invariant 14.45/6.51 Derived loop invariant: 1 14.45/6.51 - InvariantResult [Line: 55]: Loop Invariant 14.45/6.51 Derived loop invariant: 1 14.45/6.51 - InvariantResult [Line: 89]: Loop Invariant 14.45/6.51 Derived loop invariant: 1 14.45/6.51 - StatisticsResult: Ultimate Automizer benchmark data 14.45/6.51 CFG has 1 procedures, 16 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 14.45/6.51 - StatisticsResult: Constructed decomposition of program 14.45/6.51 Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 41 locations. 14.45/6.51 - StatisticsResult: Timing statistics 14.45/6.51 BüchiAutomizer plugin needed 0.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 111 SDslu, 68 SDs, 0 SdLazy, 229 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 14.45/6.51 - TerminationAnalysisResult: Nontermination possible 14.45/6.51 Buchi Automizer proved that your program is nonterminating for some inputs 14.45/6.51 - FixpointNonTerminationResult [Line: 76]: Nontermination argument in form of an infinite program execution. 14.45/6.51 [2019-03-28 12:14:48,543 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement 14.45/6.51 [2019-03-28 12:14:48,544 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement 14.45/6.51 Nontermination argument in form of an infinite execution 14.45/6.51 State at position 0 is 14.45/6.51 {} 14.45/6.51 State at position 1 is 14.45/6.51 {\result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70343231=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f058fde=0, ldv_mutex=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22fd7c3f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@65c5ded8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f625bed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2200e0bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21f1122b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ede6eef=1, NULL=0, open_called=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@330133e5=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7df642a4=0, ldv_s_misc_fops_file_operations=0} 14.45/6.51 - StatisticsResult: NonterminationArgumentStatistics 14.45/6.51 Fixpoint 14.45/6.51 - NonterminatingLassoResult [Line: 76]: Nonterminating execution 14.45/6.51 Found a nonterminating execution for the following lasso shaped sequence of statements. 14.45/6.51 Stem: 14.45/6.51 [L9] int ldv_mutex = 1; 14.45/6.51 [L11] int open_called = 0; 14.45/6.51 [L74] int ldv_s_misc_fops_file_operations = 0; 14.45/6.51 [L69] open_called = 0 14.45/6.51 [L70] return 0; 14.45/6.51 Loop: 14.45/6.51 [L76] COND TRUE __VERIFIER_nondet_int() 14.45/6.51 [L80] case 0: 14.45/6.51 [L88] case 1: 14.45/6.51 [L89] COND FALSE !(ldv_s_misc_fops_file_operations==1) 14.45/6.51 End of lasso representation. 14.45/6.51 RESULT: Ultimate proved your program to be incorrect! 14.45/6.51 !SESSION 2019-03-28 12:14:43.262 ----------------------------------------------- 14.45/6.51 eclipse.buildId=unknown 14.45/6.51 java.version=1.8.0_181 14.45/6.51 java.vendor=Oracle Corporation 14.45/6.51 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 14.45/6.51 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 14.45/6.51 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 14.45/6.51 14.45/6.51 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:14:48.778 14.45/6.51 !MESSAGE The workspace will exit with unsaved changes in this session. 14.45/6.51 Received shutdown request... 14.45/6.51 Ultimate: 14.45/6.51 GTK+ Version Check 14.45/6.51 EOF