./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i -s /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer --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-cad4683 [2019-10-22 08:58:41,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:41,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:41,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:41,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:41,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:41,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:41,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:41,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:41,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:41,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:41,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:41,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:41,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:41,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:41,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:41,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:41,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:41,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:41,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:41,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:41,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:41,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:41,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:41,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:41,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:41,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:41,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:41,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:41,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:41,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:41,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:41,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:41,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:41,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:41,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:41,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:41,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:41,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:41,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:41,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:41,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:58:41,075 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:41,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:41,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:41,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:41,077 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:41,077 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:41,077 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:41,077 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:41,077 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:41,078 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:41,078 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:41,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:41,078 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:41,078 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:41,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:41,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:41,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:41,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:41,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:41,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:41,079 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:41,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:41,080 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:41,080 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:41,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:41,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:41,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:41,080 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:41,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:41,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:41,081 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:41,082 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:41,082 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer 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-10-22 08:58:41,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:41,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:41,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:41,130 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:41,131 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:41,132 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer/../../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2019-10-22 08:58:41,182 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer/data/c386dc461/b3ebe9df3ad24fc5b3ffdfe969ff45ad/FLAGe7e8ef0a6 [2019-10-22 08:58:41,618 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:41,621 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2019-10-22 08:58:41,634 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer/data/c386dc461/b3ebe9df3ad24fc5b3ffdfe969ff45ad/FLAGe7e8ef0a6 [2019-10-22 08:58:41,950 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer/data/c386dc461/b3ebe9df3ad24fc5b3ffdfe969ff45ad [2019-10-22 08:58:41,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:41,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:41,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:41,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:41,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:41,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:41" (1/1) ... [2019-10-22 08:58:41,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db1c696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:41, skipping insertion in model container [2019-10-22 08:58:41,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:41" (1/1) ... [2019-10-22 08:58:41,969 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:42,013 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:42,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:42,392 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:42,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:42,493 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:42,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42 WrapperNode [2019-10-22 08:58:42,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:42,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:42,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:42,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:42,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:42,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:42,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:42,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:42,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:42,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:42,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:42,602 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:42,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_633035f6-ae7b-4076-8f00-5327f22e76af/bin/uautomizer/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-10-22 08:58:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:58:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:58:42,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:58:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:58:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 08:58:42,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:43,177 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:43,177 INFO L284 CfgBuilder]: Removed 74 assume(true) statements. [2019-10-22 08:58:43,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:43 BoogieIcfgContainer [2019-10-22 08:58:43,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:43,180 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:43,180 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:43,183 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:43,184 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:43,184 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:41" (1/3) ... [2019-10-22 08:58:43,185 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4427b755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:43, skipping insertion in model container [2019-10-22 08:58:43,185 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:43,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (2/3) ... [2019-10-22 08:58:43,186 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4427b755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:43, skipping insertion in model container [2019-10-22 08:58:43,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:43,186 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:43" (3/3) ... [2019-10-22 08:58:43,187 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_mutex_double_lock.i [2019-10-22 08:58:43,228 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:43,229 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:43,229 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:43,229 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:43,229 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:43,229 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:43,229 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:43,229 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:43,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-10-22 08:58:43,265 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-10-22 08:58:43,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:43,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:43,271 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:43,271 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:43,271 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:43,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-10-22 08:58:43,275 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-10-22 08:58:43,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:43,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:43,275 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:43,276 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:43,283 INFO L791 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-10-22 08:58:43,283 INFO L793 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-10-22 08:58:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash 28692771, now seen corresponding path program 1 times [2019-10-22 08:58:43,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:43,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999819702] [2019-10-22 08:58:43,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:43,442 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:43,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash 45841, now seen corresponding path program 1 times [2019-10-22 08:58:43,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:43,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47314717] [2019-10-22 08:58:43,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:43,460 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash 87865007, now seen corresponding path program 1 times [2019-10-22 08:58:43,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:43,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955006114] [2019-10-22 08:58:43,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:43,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955006114] [2019-10-22 08:58:43,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:43,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:43,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930460789] [2019-10-22 08:58:43,814 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 08:58:43,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:43,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:43,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:43,833 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-10-22 08:58:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:44,091 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2019-10-22 08:58:44,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:44,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 144 transitions. [2019-10-22 08:58:44,102 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 38 [2019-10-22 08:58:44,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 100 states and 120 transitions. [2019-10-22 08:58:44,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-10-22 08:58:44,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2019-10-22 08:58:44,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 120 transitions. [2019-10-22 08:58:44,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:44,111 INFO L688 BuchiCegarLoop]: Abstraction has 100 states and 120 transitions. [2019-10-22 08:58:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 120 transitions. [2019-10-22 08:58:44,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2019-10-22 08:58:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-22 08:58:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-10-22 08:58:44,149 INFO L711 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-10-22 08:58:44,149 INFO L591 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-10-22 08:58:44,149 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:44,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 95 transitions. [2019-10-22 08:58:44,156 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 25 [2019-10-22 08:58:44,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:44,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:44,157 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:44,157 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:44,157 INFO L791 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-10-22 08:58:44,158 INFO L793 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-10-22 08:58:44,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:44,158 INFO L82 PathProgramCache]: Analyzing trace with hash -701059643, now seen corresponding path program 1 times [2019-10-22 08:58:44,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:44,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208499558] [2019-10-22 08:58:44,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:44,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:44,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:44,354 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:44,362 INFO L82 PathProgramCache]: Analyzing trace with hash 107407, now seen corresponding path program 1 times [2019-10-22 08:58:44,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:44,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375300032] [2019-10-22 08:58:44,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:44,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:44,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:44,377 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:44,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1158213451, now seen corresponding path program 1 times [2019-10-22 08:58:44,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:44,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658698431] [2019-10-22 08:58:44,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:44,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:44,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:44,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658698431] [2019-10-22 08:58:44,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:44,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 08:58:44,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125708755] [2019-10-22 08:58:44,928 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 08:58:44,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:44,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:58:44,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:58:44,929 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. cyclomatic complexity: 23 Second operand 10 states. [2019-10-22 08:58:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:45,784 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2019-10-22 08:58:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:58:45,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 122 transitions. [2019-10-22 08:58:45,787 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 28 [2019-10-22 08:58:45,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 122 transitions. [2019-10-22 08:58:45,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2019-10-22 08:58:45,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2019-10-22 08:58:45,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 122 transitions. [2019-10-22 08:58:45,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:45,790 INFO L688 BuchiCegarLoop]: Abstraction has 103 states and 122 transitions. [2019-10-22 08:58:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 122 transitions. [2019-10-22 08:58:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2019-10-22 08:58:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-22 08:58:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2019-10-22 08:58:45,802 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 100 transitions. [2019-10-22 08:58:45,802 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 100 transitions. [2019-10-22 08:58:45,802 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:45,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 100 transitions. [2019-10-22 08:58:45,803 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 22 [2019-10-22 08:58:45,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:45,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:45,804 INFO L849 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] [2019-10-22 08:58:45,804 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:45,804 INFO L791 eck$LassoCheckResult]: Stem: 462#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); 435#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; 436#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; 484#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; 476#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; 477#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); 479#L642-4 ldv_is_in_set_#res := 0; 440#L647 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 441#L656 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 468#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; 469#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); 466#L642-9 ldv_is_in_set_#res := 0; 444#L647-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 445#L623 assume !(0 == ldv_set_add_#t~ret17);havoc ldv_set_add_#t~ret17; 450#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; 451#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); 461#L642-14 ldv_is_in_set_#res := 0; 448#L647-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 449#L656-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 474#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; 463#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); 464#L642-19 ldv_is_in_set_#res := 0; 497#L647-3 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 496#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; 471#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); 475#L579-1 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 470#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; 456#L642-23 [2019-10-22 08:58:45,805 INFO L793 eck$LassoCheckResult]: Loop: 456#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); 432#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; 433#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; 456#L642-23 [2019-10-22 08:58:45,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:45,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1243409918, now seen corresponding path program 1 times [2019-10-22 08:58:45,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:45,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564864954] [2019-10-22 08:58:45,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:45,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564864954] [2019-10-22 08:58:45,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:45,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:45,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611204203] [2019-10-22 08:58:45,853 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:45,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:45,853 INFO L82 PathProgramCache]: Analyzing trace with hash 168973, now seen corresponding path program 1 times [2019-10-22 08:58:45,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:45,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891120529] [2019-10-22 08:58:45,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:45,864 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:46,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:46,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:46,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:46,004 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-10-22 08:58:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:46,055 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2019-10-22 08:58:46,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:46,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 109 transitions. [2019-10-22 08:58:46,057 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2019-10-22 08:58:46,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 109 transitions. [2019-10-22 08:58:46,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2019-10-22 08:58:46,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2019-10-22 08:58:46,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 109 transitions. [2019-10-22 08:58:46,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:46,059 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2019-10-22 08:58:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 109 transitions. [2019-10-22 08:58:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 64. [2019-10-22 08:58:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 08:58:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2019-10-22 08:58:46,064 INFO L711 BuchiCegarLoop]: Abstraction has 64 states and 77 transitions. [2019-10-22 08:58:46,064 INFO L591 BuchiCegarLoop]: Abstraction has 64 states and 77 transitions. [2019-10-22 08:58:46,064 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:46,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 77 transitions. [2019-10-22 08:58:46,065 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2019-10-22 08:58:46,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:46,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:46,065 INFO L849 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] [2019-10-22 08:58:46,065 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:46,066 INFO L791 eck$LassoCheckResult]: Stem: 642#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); 617#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; 618#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; 662#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; 655#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; 656#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); 658#L642-4 ldv_is_in_set_#res := 0; 622#L647 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 623#L656 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 647#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; 648#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); 646#L642-9 ldv_is_in_set_#res := 0; 626#L647-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 627#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; 659#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); 651#L579 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 632#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; 633#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); 641#L642-14 ldv_is_in_set_#res := 0; 611#L647-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 631#L656-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 652#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; 643#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); 614#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;ldv_is_in_set_#res := 1; 602#L647-3 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 603#L623-1 assume !(0 == ldv_set_add_#t~ret17);havoc ldv_set_add_#t~ret17; 634#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; 635#L642-23 [2019-10-22 08:58:46,066 INFO L793 eck$LassoCheckResult]: Loop: 635#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); 615#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; 616#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; 635#L642-23 [2019-10-22 08:58:46,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1380100276, now seen corresponding path program 1 times [2019-10-22 08:58:46,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:46,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193274531] [2019-10-22 08:58:46,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:46,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193274531] [2019-10-22 08:58:46,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:46,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 08:58:46,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112142247] [2019-10-22 08:58:46,159 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash 168973, now seen corresponding path program 2 times [2019-10-22 08:58:46,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:46,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137067480] [2019-10-22 08:58:46,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:46,169 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:46,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:46,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:58:46,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:58:46,293 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. cyclomatic complexity: 18 Second operand 10 states. [2019-10-22 08:58:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:46,886 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2019-10-22 08:58:46,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 08:58:46,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 150 transitions. [2019-10-22 08:58:46,887 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 54 [2019-10-22 08:58:46,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 150 transitions. [2019-10-22 08:58:46,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2019-10-22 08:58:46,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2019-10-22 08:58:46,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 150 transitions. [2019-10-22 08:58:46,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:46,891 INFO L688 BuchiCegarLoop]: Abstraction has 126 states and 150 transitions. [2019-10-22 08:58:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 150 transitions. [2019-10-22 08:58:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 61. [2019-10-22 08:58:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:58:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-10-22 08:58:46,895 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-10-22 08:58:46,895 INFO L591 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-10-22 08:58:46,895 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:58:46,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 71 transitions. [2019-10-22 08:58:46,896 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2019-10-22 08:58:46,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:46,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:46,897 INFO L849 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-10-22 08:58:46,897 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:46,897 INFO L791 eck$LassoCheckResult]: Stem: 870#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); 844#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; 845#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; 886#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; 879#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; 880#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); 882#L642-4 ldv_is_in_set_#res := 0; 851#L647 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 852#L656 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 873#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; 874#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); 872#L642-9 ldv_is_in_set_#res := 0; 855#L647-1 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 856#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; 883#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); 876#L579 havoc ldv_list_add_#t~mem6.base, ldv_list_add_#t~mem6.offset; 859#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; 860#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); 837#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; 838#L647-2 mutex_lock_#t~ret27 := ldv_is_in_set_#res; 858#L656-3 assume !(0 != mutex_lock_#t~ret27);havoc mutex_lock_#t~ret27; 877#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; 871#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); 841#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;ldv_is_in_set_#res := 1; 829#L647-3 ldv_set_add_#t~ret17 := ldv_is_in_set_#res; 830#L623-1 assume !(0 == ldv_set_add_#t~ret17);havoc ldv_set_add_#t~ret17; 861#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; 862#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); 842#L643-4 [2019-10-22 08:58:46,897 INFO L793 eck$LassoCheckResult]: Loop: 842#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; 843#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; 865#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); 842#L643-4 [2019-10-22 08:58:46,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:46,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1855230134, now seen corresponding path program 1 times [2019-10-22 08:58:46,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:46,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799577351] [2019-10-22 08:58:46,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:46,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799577351] [2019-10-22 08:58:46,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:46,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:46,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845152124] [2019-10-22 08:58:46,957 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:46,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:46,958 INFO L82 PathProgramCache]: Analyzing trace with hash 173833, now seen corresponding path program 3 times [2019-10-22 08:58:46,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:46,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297849032] [2019-10-22 08:58:46,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:46,970 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:47,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:47,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:47,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:47,048 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-10-22 08:58:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:47,073 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2019-10-22 08:58:47,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:47,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 20 transitions. [2019-10-22 08:58:47,073 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:47,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-10-22 08:58:47,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:47,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:47,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:47,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:47,074 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:47,074 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:47,074 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:47,074 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:58:47,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:47,075 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:47,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:47,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:47 BoogieIcfgContainer [2019-10-22 08:58:47,082 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:47,083 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:47,083 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:47,083 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:47,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:43" (3/4) ... [2019-10-22 08:58:47,087 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:47,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:47,088 INFO L168 Benchmark]: Toolchain (without parser) took 5134.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 937.7 MB in the beginning and 947.5 MB in the end (delta: -9.8 MB). Peak memory consumption was 185.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:47,089 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:47,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:47,090 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:47,090 INFO L168 Benchmark]: Boogie Preprocessor took 43.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:47,091 INFO L168 Benchmark]: RCFGBuilder took 577.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:47,091 INFO L168 Benchmark]: BuchiAutomizer took 3902.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.3 MB). Free memory was 1.0 GB in the beginning and 947.5 MB in the end (delta: 62.6 MB). Peak memory consumption was 155.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:47,092 INFO L168 Benchmark]: Witness Printer took 4.42 ms. Allocated memory is still 1.2 GB. Free memory is still 947.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:47,094 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 538.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 577.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3902.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.3 MB). Free memory was 1.0 GB in the beginning and 947.5 MB in the end (delta: 62.6 MB). Peak memory consumption was 155.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.42 ms. Allocated memory is still 1.2 GB. Free memory is still 947.5 MB. 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 3.8s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.9s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 133 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 227 SDtfs, 730 SDslu, 546 SDs, 0 SdLazy, 676 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s 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...