./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad29ac750d7eee43ee0f4c2b7f90b5e7c26b142d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:57:38,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:57:38,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:57:38,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:57:38,599 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:57:38,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:57:38,605 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:57:38,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:57:38,611 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:57:38,613 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:57:38,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:57:38,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:57:38,618 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:57:38,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:57:38,628 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:57:38,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:57:38,633 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:57:38,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:57:38,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:57:38,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:57:38,646 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:57:38,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:57:38,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:57:38,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:57:38,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:57:38,651 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:57:38,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:57:38,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:57:38,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:57:38,659 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:57:38,660 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:57:38,661 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:57:38,661 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:57:38,662 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:57:38,662 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:57:38,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:57:38,665 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:57:38,684 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:57:38,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:57:38,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:57:38,686 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:57:38,686 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:57:38,686 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:57:38,687 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:57:38,687 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:57:38,687 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:57:38,687 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:57:38,687 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:57:38,687 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:57:38,688 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:57:38,688 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:57:38,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:57:38,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:57:38,688 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:57:38,688 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:57:38,688 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:57:38,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:57:38,690 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:57:38,691 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:57:38,691 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:57:38,691 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:57:38,691 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:57:38,692 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:57:38,692 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:57:38,692 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:57:38,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:57:38,692 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:57:38,693 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:57:38,695 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:57:38,695 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad29ac750d7eee43ee0f4c2b7f90b5e7c26b142d [2019-01-01 22:57:38,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:57:38,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:57:38,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:57:38,770 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:57:38,771 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:57:38,772 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i [2019-01-01 22:57:38,838 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821753a37/1b6cd9b32b5e425c825dfd7b522b991f/FLAGcc066f72a [2019-01-01 22:57:39,341 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:57:39,341 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i [2019-01-01 22:57:39,360 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821753a37/1b6cd9b32b5e425c825dfd7b522b991f/FLAGcc066f72a [2019-01-01 22:57:39,644 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821753a37/1b6cd9b32b5e425c825dfd7b522b991f [2019-01-01 22:57:39,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:57:39,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:57:39,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:57:39,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:57:39,655 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:57:39,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:57:39" (1/1) ... [2019-01-01 22:57:39,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f987029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:39, skipping insertion in model container [2019-01-01 22:57:39,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:57:39" (1/1) ... [2019-01-01 22:57:39,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:57:39,750 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:57:40,187 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:57:40,201 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:57:40,346 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:57:40,411 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:57:40,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40 WrapperNode [2019-01-01 22:57:40,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:57:40,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:57:40,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:57:40,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:57:40,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40" (1/1) ... [2019-01-01 22:57:40,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40" (1/1) ... [2019-01-01 22:57:40,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:57:40,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:57:40,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:57:40,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:57:40,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40" (1/1) ... [2019-01-01 22:57:40,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40" (1/1) ... [2019-01-01 22:57:40,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40" (1/1) ... [2019-01-01 22:57:40,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40" (1/1) ... [2019-01-01 22:57:40,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40" (1/1) ... [2019-01-01 22:57:40,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40" (1/1) ... [2019-01-01 22:57:40,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40" (1/1) ... [2019-01-01 22:57:40,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:57:40,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:57:40,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:57:40,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:57:40,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:57:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:57:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 22:57:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:57:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 22:57:40,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:57:40,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 22:57:40,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:57:40,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:57:41,916 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:57:41,917 INFO L280 CfgBuilder]: Removed 74 assue(true) statements. [2019-01-01 22:57:41,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:57:41 BoogieIcfgContainer [2019-01-01 22:57:41,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:57:41,919 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:57:41,919 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:57:41,924 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:57:41,925 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:41,925 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:57:39" (1/3) ... [2019-01-01 22:57:41,927 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f9b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:57:41, skipping insertion in model container [2019-01-01 22:57:41,927 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:41,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:40" (2/3) ... [2019-01-01 22:57:41,928 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f9b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:57:41, skipping insertion in model container [2019-01-01 22:57:41,928 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:41,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:57:41" (3/3) ... [2019-01-01 22:57:41,932 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_mutex_double_lock_false-unreach-call_true-termination.i [2019-01-01 22:57:41,999 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:57:42,001 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:57:42,001 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:57:42,001 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:57:42,001 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:57:42,001 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:57:42,001 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:57:42,002 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:57:42,002 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:57:42,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-01-01 22:57:42,053 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-01-01 22:57:42,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:42,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:42,062 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:57:42,062 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:42,062 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:57:42,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-01-01 22:57:42,069 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-01-01 22:57:42,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:42,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:42,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:57:42,070 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:42,078 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); 14#L-1true havoc main_#res;havoc foo_#t~ret30.base, foo_#t~ret30.offset, foo_#t~ret31.base, foo_#t~ret31.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 68#L653true ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 70#L565true foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 54#L565-1true foo_#t~ret31.base, foo_#t~ret31.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret31.base, foo_#t~ret31.offset;havoc foo_#t~ret31.base, foo_#t~ret31.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 71#L642-3true [2019-01-01 22:57:42,078 INFO L796 eck$LassoCheckResult]: Loop: 71#L642-3true assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 4#L643true assume !(ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset; 69#L642-2true call ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;havoc ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 71#L642-3true [2019-01-01 22:57:42,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:42,085 INFO L82 PathProgramCache]: Analyzing trace with hash 28692771, now seen corresponding path program 1 times [2019-01-01 22:57:42,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:42,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:42,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:42,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:42,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:42,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:42,298 INFO L82 PathProgramCache]: Analyzing trace with hash 45841, now seen corresponding path program 1 times [2019-01-01 22:57:42,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:42,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:42,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:42,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:42,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:42,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:42,317 INFO L82 PathProgramCache]: Analyzing trace with hash 87865007, now seen corresponding path program 1 times [2019-01-01 22:57:42,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:42,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:42,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:42,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:42,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:57:42,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:57:43,175 WARN L181 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-01-01 22:57:43,780 WARN L181 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 22:57:43,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:57:43,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:57:43,802 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-01-01 22:57:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:44,157 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2019-01-01 22:57:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:57:44,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-01-01 22:57:44,166 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 38 [2019-01-01 22:57:44,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 100 states and 120 transitions. [2019-01-01 22:57:44,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-01-01 22:57:44,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2019-01-01 22:57:44,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 120 transitions. [2019-01-01 22:57:44,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:44,177 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 120 transitions. [2019-01-01 22:57:44,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 120 transitions. [2019-01-01 22:57:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2019-01-01 22:57:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-01 22:57:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-01-01 22:57:44,214 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-01-01 22:57:44,214 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-01-01 22:57:44,214 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:57:44,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 95 transitions. [2019-01-01 22:57:44,217 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 25 [2019-01-01 22:57:44,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:44,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:44,218 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:57:44,218 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:44,219 INFO L794 eck$LassoCheckResult]: Stem: 253#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); 226#L-1 havoc main_#res;havoc foo_#t~ret30.base, foo_#t~ret30.offset, foo_#t~ret31.base, foo_#t~ret31.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 227#L653 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 277#L565 foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 270#L565-1 foo_#t~ret31.base, foo_#t~ret31.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret31.base, foo_#t~ret31.offset;havoc foo_#t~ret31.base, foo_#t~ret31.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 271#L642-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 273#L642-4 ldv_is_in_set_#res := 0; 231#L647 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 232#L656 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 258#L656-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 259#L642-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 257#L642-9 ldv_is_in_set_#res := 0; 235#L647-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 236#L623 assume 0 == ldv_set_add_#t~ret17;havoc ldv_set_add_#t~ret17;havoc ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset;ldv_successful_malloc_#in~size := 12;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 274#L565-2 ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset := ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;havoc ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;call write~$Pointer$(ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, 4);ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset, ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset := ldv_set_add_~le~0.base, 4 + ldv_set_add_~le~0.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset, ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset;ldv_list_add_~new.base, ldv_list_add_~new.offset := ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset;ldv_list_add_~head.base, ldv_list_add_~head.offset := ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset;call ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset := read~$Pointer$(ldv_list_add_~head.base, ldv_list_add_~head.offset, 4);__ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset, __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset, __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset := ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset, ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset;havoc __ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~next.base, __ldv_list_add_~next.offset;__ldv_list_add_~new.base, __ldv_list_add_~new.offset := __ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset;__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset := __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset;__ldv_list_add_~next.base, __ldv_list_add_~next.offset := __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset;call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~next.base, 4 + __ldv_list_add_~next.offset, 4);call write~$Pointer$(__ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.base, __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~new.base, 4 + __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, 4); 263#L579 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 264#L622 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 268#L642-13 [2019-01-01 22:57:44,220 INFO L796 eck$LassoCheckResult]: Loop: 268#L642-13 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 216#L643-2 assume !(ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset; 218#L642-12 call ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;havoc ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 268#L642-13 [2019-01-01 22:57:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:44,220 INFO L82 PathProgramCache]: Analyzing trace with hash -701059643, now seen corresponding path program 1 times [2019-01-01 22:57:44,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:44,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:44,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:44,473 INFO L82 PathProgramCache]: Analyzing trace with hash 107407, now seen corresponding path program 1 times [2019-01-01 22:57:44,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:44,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:44,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:44,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:44,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:44,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:44,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1158213451, now seen corresponding path program 1 times [2019-01-01 22:57:44,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:44,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:44,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:44,829 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 22:57:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:45,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:57:45,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 22:57:45,290 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-01-01 22:57:45,419 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 22:57:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 22:57:45,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-01 22:57:45,421 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. cyclomatic complexity: 23 Second operand 10 states. [2019-01-01 22:57:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:46,234 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2019-01-01 22:57:46,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 22:57:46,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 130 transitions. [2019-01-01 22:57:46,239 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 34 [2019-01-01 22:57:46,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 108 states and 130 transitions. [2019-01-01 22:57:46,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2019-01-01 22:57:46,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2019-01-01 22:57:46,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 130 transitions. [2019-01-01 22:57:46,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:46,243 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 130 transitions. [2019-01-01 22:57:46,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 130 transitions. [2019-01-01 22:57:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2019-01-01 22:57:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-01 22:57:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2019-01-01 22:57:46,252 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 114 transitions. [2019-01-01 22:57:46,252 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 114 transitions. [2019-01-01 22:57:46,252 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:57:46,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 114 transitions. [2019-01-01 22:57:46,254 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-01-01 22:57:46,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:46,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:46,255 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:57:46,255 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:46,256 INFO L794 eck$LassoCheckResult]: Stem: 463#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); 436#L-1 havoc main_#res;havoc foo_#t~ret30.base, foo_#t~ret30.offset, foo_#t~ret31.base, foo_#t~ret31.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 437#L653 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 488#L565 foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 481#L565-1 foo_#t~ret31.base, foo_#t~ret31.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret31.base, foo_#t~ret31.offset;havoc foo_#t~ret31.base, foo_#t~ret31.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 482#L642-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 485#L642-4 ldv_is_in_set_#res := 0; 441#L647 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 442#L656 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 470#L656-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 471#L642-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 468#L642-9 ldv_is_in_set_#res := 0; 445#L647-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 446#L623 assume 0 == ldv_set_add_#t~ret17;havoc ldv_set_add_#t~ret17;havoc ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset;ldv_successful_malloc_#in~size := 12;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 486#L565-2 ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset := ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;havoc ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;call write~$Pointer$(ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, 4);ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset, ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset := ldv_set_add_~le~0.base, 4 + ldv_set_add_~le~0.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset, ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset;ldv_list_add_~new.base, ldv_list_add_~new.offset := ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset;ldv_list_add_~head.base, ldv_list_add_~head.offset := ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset;call ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset := read~$Pointer$(ldv_list_add_~head.base, ldv_list_add_~head.offset, 4);__ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset, __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset, __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset := ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset, ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset;havoc __ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~next.base, __ldv_list_add_~next.offset;__ldv_list_add_~new.base, __ldv_list_add_~new.offset := __ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset;__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset := __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset;__ldv_list_add_~next.base, __ldv_list_add_~next.offset := __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset;call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~next.base, 4 + __ldv_list_add_~next.offset, 4);call write~$Pointer$(__ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.base, __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~new.base, 4 + __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, 4); 474#L579 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 475#L622 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 490#L642-13 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 491#L642-14 ldv_is_in_set_#res := 0; 429#L647-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 476#L656-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 477#L656-5 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 464#L642-18 [2019-01-01 22:57:46,256 INFO L796 eck$LassoCheckResult]: Loop: 464#L642-18 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 432#L643-3 assume !(ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset; 433#L642-17 call ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;havoc ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 464#L642-18 [2019-01-01 22:57:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:46,257 INFO L82 PathProgramCache]: Analyzing trace with hash 644937291, now seen corresponding path program 1 times [2019-01-01 22:57:46,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:46,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:46,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:46,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:46,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:46,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:57:46,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 22:57:46,443 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:57:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:46,443 INFO L82 PathProgramCache]: Analyzing trace with hash 135211, now seen corresponding path program 1 times [2019-01-01 22:57:46,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:46,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:46,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:46,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:46,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:46,585 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-01-01 22:57:46,858 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 22:57:46,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 22:57:46,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 22:57:46,860 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. cyclomatic complexity: 28 Second operand 8 states. [2019-01-01 22:57:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:47,829 INFO L93 Difference]: Finished difference Result 201 states and 245 transitions. [2019-01-01 22:57:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 22:57:47,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 245 transitions. [2019-01-01 22:57:47,837 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 78 [2019-01-01 22:57:47,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 201 states and 245 transitions. [2019-01-01 22:57:47,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2019-01-01 22:57:47,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-01-01 22:57:47,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 245 transitions. [2019-01-01 22:57:47,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:47,845 INFO L705 BuchiCegarLoop]: Abstraction has 201 states and 245 transitions. [2019-01-01 22:57:47,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 245 transitions. [2019-01-01 22:57:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 101. [2019-01-01 22:57:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 22:57:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2019-01-01 22:57:47,857 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-01-01 22:57:47,857 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-01-01 22:57:47,858 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:57:47,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 121 transitions. [2019-01-01 22:57:47,859 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 31 [2019-01-01 22:57:47,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:47,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:47,862 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:57:47,862 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:47,862 INFO L794 eck$LassoCheckResult]: Stem: 784#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); 754#L-1 havoc main_#res;havoc foo_#t~ret30.base, foo_#t~ret30.offset, foo_#t~ret31.base, foo_#t~ret31.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 755#L653 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 809#L565 foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 800#L565-1 foo_#t~ret31.base, foo_#t~ret31.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret31.base, foo_#t~ret31.offset;havoc foo_#t~ret31.base, foo_#t~ret31.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 801#L642-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 803#L642-4 ldv_is_in_set_#res := 0; 759#L647 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 760#L656 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 789#L656-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 790#L642-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 788#L642-9 ldv_is_in_set_#res := 0; 763#L647-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 764#L623 assume 0 == ldv_set_add_#t~ret17;havoc ldv_set_add_#t~ret17;havoc ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset;ldv_successful_malloc_#in~size := 12;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 804#L565-2 ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset := ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;havoc ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;call write~$Pointer$(ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, 4);ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset, ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset := ldv_set_add_~le~0.base, 4 + ldv_set_add_~le~0.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset, ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset;ldv_list_add_~new.base, ldv_list_add_~new.offset := ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset;ldv_list_add_~head.base, ldv_list_add_~head.offset := ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset;call ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset := read~$Pointer$(ldv_list_add_~head.base, ldv_list_add_~head.offset, 4);__ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset, __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset, __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset := ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset, ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset;havoc __ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~next.base, __ldv_list_add_~next.offset;__ldv_list_add_~new.base, __ldv_list_add_~new.offset := __ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset;__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset := __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset;__ldv_list_add_~next.base, __ldv_list_add_~next.offset := __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset;call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~next.base, 4 + __ldv_list_add_~next.offset, 4);call write~$Pointer$(__ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.base, __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~new.base, 4 + __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, 4); 792#L579 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 793#L622 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 811#L642-13 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 746#L643-2 assume ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset;havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset;ldv_is_in_set_#res := 1; 747#L647-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 767#L656-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 799#L656-5 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 786#L642-18 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 750#L643-3 [2019-01-01 22:57:47,862 INFO L796 eck$LassoCheckResult]: Loop: 750#L643-3 assume !(ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset; 751#L642-17 call ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;havoc ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 785#L642-18 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 750#L643-3 [2019-01-01 22:57:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:47,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1431910219, now seen corresponding path program 1 times [2019-01-01 22:57:47,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:47,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:47,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:47,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:48,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:57:48,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:57:48,015 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:57:48,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:48,015 INFO L82 PathProgramCache]: Analyzing trace with hash 140071, now seen corresponding path program 2 times [2019-01-01 22:57:48,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:48,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:48,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:48,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:48,369 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-01 22:57:48,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:57:48,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:57:48,415 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. cyclomatic complexity: 29 Second operand 4 states. [2019-01-01 22:57:48,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:48,472 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2019-01-01 22:57:48,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:57:48,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 115 transitions. [2019-01-01 22:57:48,476 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 35 [2019-01-01 22:57:48,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 91 states and 108 transitions. [2019-01-01 22:57:48,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2019-01-01 22:57:48,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2019-01-01 22:57:48,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 108 transitions. [2019-01-01 22:57:48,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:48,479 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 108 transitions. [2019-01-01 22:57:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 108 transitions. [2019-01-01 22:57:48,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2019-01-01 22:57:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-01 22:57:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-01-01 22:57:48,486 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-01-01 22:57:48,486 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-01-01 22:57:48,486 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:57:48,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 82 transitions. [2019-01-01 22:57:48,487 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 22 [2019-01-01 22:57:48,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:48,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:48,490 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:57:48,490 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:57:48,492 INFO L794 eck$LassoCheckResult]: Stem: 985#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); 958#L-1 havoc main_#res;havoc foo_#t~ret30.base, foo_#t~ret30.offset, foo_#t~ret31.base, foo_#t~ret31.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; 959#L653 ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 1002#L565 foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 998#L565-1 foo_#t~ret31.base, foo_#t~ret31.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret31.base, foo_#t~ret31.offset;havoc foo_#t~ret31.base, foo_#t~ret31.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 999#L642-3 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 1000#L642-4 ldv_is_in_set_#res := 0; 965#L647 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 966#L656 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 990#L656-2 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 991#L642-8 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 989#L642-9 ldv_is_in_set_#res := 0; 969#L647-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 970#L623 assume !(0 == ldv_set_add_#t~ret17);havoc ldv_set_add_#t~ret17; 973#L622 mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret27, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 974#L642-13 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 984#L642-14 ldv_is_in_set_#res := 0; 971#L647-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 972#L656-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 993#L656-5 ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset, ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_set_add_#t~ret17, ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;ldv_set_add_~new.base, ldv_set_add_~new.offset := ldv_set_add_#in~new.base, ldv_set_add_#in~new.offset;ldv_set_add_~s.base, ldv_set_add_~s.offset := ldv_set_add_#in~s.base, ldv_set_add_#in~s.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 986#L642-18 assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); 987#L642-19 ldv_is_in_set_#res := 0; 946#L647-3 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 947#L623-1 assume 0 == ldv_set_add_#t~ret17;havoc ldv_set_add_#t~ret17;havoc ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset;ldv_successful_malloc_#in~size := 12;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc5.base, ldv_successful_malloc_#t~malloc5.offset;assume 0 != (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; 992#L565-3 ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset := ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;havoc ldv_set_add_#t~ret18.base, ldv_set_add_#t~ret18.offset;call write~$Pointer$(ldv_set_add_~new.base, ldv_set_add_~new.offset, ldv_set_add_~le~0.base, ldv_set_add_~le~0.offset, 4);ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset, ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset := ldv_set_add_~le~0.base, 4 + ldv_set_add_~le~0.offset, ldv_set_add_~s.base, ldv_set_add_~s.offset;havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset, ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset;ldv_list_add_~new.base, ldv_list_add_~new.offset := ldv_list_add_#in~new.base, ldv_list_add_#in~new.offset;ldv_list_add_~head.base, ldv_list_add_~head.offset := ldv_list_add_#in~head.base, ldv_list_add_#in~head.offset;call ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset := read~$Pointer$(ldv_list_add_~head.base, ldv_list_add_~head.offset, 4);__ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset, __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset, __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset := ldv_list_add_~new.base, ldv_list_add_~new.offset, ldv_list_add_~head.base, ldv_list_add_~head.offset, ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset;havoc __ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~next.base, __ldv_list_add_~next.offset;__ldv_list_add_~new.base, __ldv_list_add_~new.offset := __ldv_list_add_#in~new.base, __ldv_list_add_#in~new.offset;__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset := __ldv_list_add_#in~prev.base, __ldv_list_add_#in~prev.offset;__ldv_list_add_~next.base, __ldv_list_add_~next.offset := __ldv_list_add_#in~next.base, __ldv_list_add_#in~next.offset;call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~next.base, 4 + __ldv_list_add_~next.offset, 4);call write~$Pointer$(__ldv_list_add_~next.base, __ldv_list_add_~next.offset, __ldv_list_add_~new.base, __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, __ldv_list_add_~new.base, 4 + __ldv_list_add_~new.offset, 4);call write~$Pointer$(__ldv_list_add_~new.base, __ldv_list_add_~new.offset, __ldv_list_add_~prev.base, __ldv_list_add_~prev.offset, 4); 994#L579-1 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 995#L622-1 mutex_unlock_#in~m.base, mutex_unlock_#in~m.offset := foo_~m2~0.base, foo_~m2~0.offset;havoc mutex_unlock_#t~ret28, mutex_unlock_~m.base, mutex_unlock_~m.offset;mutex_unlock_~m.base, mutex_unlock_~m.offset := mutex_unlock_#in~m.base, mutex_unlock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_unlock_~m.base, mutex_unlock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;havoc ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; 1009#L642-23 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 956#L643-4 [2019-01-01 22:57:48,492 INFO L796 eck$LassoCheckResult]: Loop: 956#L643-4 assume !(ldv_is_in_set_#t~mem25.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem25.offset == ldv_is_in_set_~e.offset);havoc ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset; 957#L642-22 call ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, 4 + ldv_is_in_set_~m~1.offset, 4);ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset := ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;havoc ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset - 4; 979#L642-23 assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem25.base, ldv_is_in_set_#t~mem25.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); 956#L643-4 [2019-01-01 22:57:48,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:48,499 INFO L82 PathProgramCache]: Analyzing trace with hash 108998346, now seen corresponding path program 1 times [2019-01-01 22:57:48,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:48,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:48,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:57:48,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:48,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:57:48,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:57:48,594 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:57:48,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:48,595 INFO L82 PathProgramCache]: Analyzing trace with hash 173833, now seen corresponding path program 1 times [2019-01-01 22:57:48,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:48,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:48,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:48,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:49,079 WARN L181 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-01 22:57:49,241 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-01 22:57:49,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:57:49,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:57:49,242 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-01-01 22:57:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:49,258 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-01-01 22:57:49,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:57:49,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 13 transitions. [2019-01-01 22:57:49,260 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:57:49,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-01-01 22:57:49,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:57:49,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:57:49,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:57:49,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:49,261 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:57:49,261 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:57:49,261 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:57:49,261 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:57:49,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:57:49,264 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:57:49,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:57:49,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:57:49 BoogieIcfgContainer [2019-01-01 22:57:49,271 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:57:49,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:57:49,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:57:49,272 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:57:49,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:57:41" (3/4) ... [2019-01-01 22:57:49,275 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:57:49,276 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:57:49,276 INFO L168 Benchmark]: Toolchain (without parser) took 9627.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -98.6 MB). Peak memory consumption was 109.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:49,278 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:57:49,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:49,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:57:49,280 INFO L168 Benchmark]: Boogie Preprocessor took 80.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:49,282 INFO L168 Benchmark]: RCFGBuilder took 1337.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:49,283 INFO L168 Benchmark]: BuchiAutomizer took 7352.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 3.0 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:57:49,284 INFO L168 Benchmark]: Witness Printer took 4.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:57:49,290 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 761.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1337.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7352.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 3.0 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic). 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 1.4s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 156 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 101 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 257 SDtfs, 616 SDslu, 558 SDs, 0 SdLazy, 580 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...