./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f9ba8a94cfe208dd98ece1b8faeac531fdfb99db ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:45:52,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:45:52,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:45:52,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:45:52,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:45:52,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:45:52,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:45:52,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:45:52,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:45:52,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:45:52,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:45:52,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:45:52,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:45:52,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:45:52,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:45:52,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:45:52,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:45:52,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:45:52,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:45:52,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:45:52,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:45:52,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:45:52,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:45:52,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:45:52,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:45:52,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:45:52,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:45:52,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:45:52,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:45:52,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:45:52,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:45:52,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:45:52,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:45:52,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:45:52,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:45:52,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:45:52,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:45:52,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:45:52,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:45:52,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:45:52,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:45:52,091 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:45:52,104 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:45:52,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:45:52,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:45:52,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:45:52,105 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:45:52,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:45:52,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:45:52,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:45:52,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:45:52,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:45:52,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:45:52,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:45:52,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:45:52,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:45:52,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:45:52,107 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:45:52,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:45:52,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:45:52,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:45:52,108 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:45:52,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:45:52,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:45:52,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:45:52,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:45:52,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:45:52,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:45:52,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:45:52,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:45:52,110 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:45:52,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/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(G ! call(__VERIFIER_error())) ) 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 -> f9ba8a94cfe208dd98ece1b8faeac531fdfb99db [2019-12-07 18:45:52,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:45:52,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:45:52,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:45:52,235 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:45:52,235 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:45:52,236 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix001_tso.opt.i [2019-12-07 18:45:52,274 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/data/868162e7b/d93fa7686b784e46a002f592418a1480/FLAG00b5c1275 [2019-12-07 18:45:52,749 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:45:52,749 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/sv-benchmarks/c/pthread-wmm/mix001_tso.opt.i [2019-12-07 18:45:52,760 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/data/868162e7b/d93fa7686b784e46a002f592418a1480/FLAG00b5c1275 [2019-12-07 18:45:53,256 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/data/868162e7b/d93fa7686b784e46a002f592418a1480 [2019-12-07 18:45:53,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:45:53,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:45:53,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:45:53,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:45:53,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:45:53,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:45:53" (1/1) ... [2019-12-07 18:45:53,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f87f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53, skipping insertion in model container [2019-12-07 18:45:53,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:45:53" (1/1) ... [2019-12-07 18:45:53,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:45:53,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:45:53,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:45:53,567 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:45:53,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:45:53,656 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:45:53,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53 WrapperNode [2019-12-07 18:45:53,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:45:53,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:45:53,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:45:53,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:45:53,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53" (1/1) ... [2019-12-07 18:45:53,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53" (1/1) ... [2019-12-07 18:45:53,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:45:53,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:45:53,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:45:53,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:45:53,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53" (1/1) ... [2019-12-07 18:45:53,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53" (1/1) ... [2019-12-07 18:45:53,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53" (1/1) ... [2019-12-07 18:45:53,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53" (1/1) ... [2019-12-07 18:45:53,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53" (1/1) ... [2019-12-07 18:45:53,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53" (1/1) ... [2019-12-07 18:45:53,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53" (1/1) ... [2019-12-07 18:45:53,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:45:53,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:45:53,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:45:53,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:45:53,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:45:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:45:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:45:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:45:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:45:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:45:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:45:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:45:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:45:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:45:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:45:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:45:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:45:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:45:53,770 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:45:54,169 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:45:54,169 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:45:54,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:45:54 BoogieIcfgContainer [2019-12-07 18:45:54,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:45:54,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:45:54,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:45:54,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:45:54,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:45:53" (1/3) ... [2019-12-07 18:45:54,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f82a9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:45:54, skipping insertion in model container [2019-12-07 18:45:54,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:53" (2/3) ... [2019-12-07 18:45:54,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f82a9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:45:54, skipping insertion in model container [2019-12-07 18:45:54,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:45:54" (3/3) ... [2019-12-07 18:45:54,175 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_tso.opt.i [2019-12-07 18:45:54,181 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:45:54,181 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:45:54,185 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:45:54,186 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:45:54,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,214 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,214 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,215 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,215 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,226 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,226 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,226 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,226 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,226 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:54,249 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:45:54,261 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:45:54,261 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:45:54,261 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:45:54,261 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:45:54,262 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:45:54,262 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:45:54,262 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:45:54,262 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:45:54,272 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-07 18:45:54,273 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 18:45:54,335 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 18:45:54,335 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:45:54,350 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 910 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 18:45:54,374 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 18:45:54,408 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 18:45:54,408 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:45:54,416 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 910 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 18:45:54,441 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 18:45:54,441 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:45:57,866 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 18:45:58,160 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 18:45:58,279 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124432 [2019-12-07 18:45:58,279 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-07 18:45:58,282 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-07 18:46:01,088 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-07 18:46:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-07 18:46:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:46:01,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:01,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:01,096 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash -614729650, now seen corresponding path program 1 times [2019-12-07 18:46:01,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:01,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529250889] [2019-12-07 18:46:01,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:01,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529250889] [2019-12-07 18:46:01,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:01,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:46:01,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330601372] [2019-12-07 18:46:01,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:46:01,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:01,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:46:01,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:46:01,266 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-07 18:46:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:01,644 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-07 18:46:01,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:46:01,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 18:46:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:01,900 INFO L225 Difference]: With dead ends: 44562 [2019-12-07 18:46:01,900 INFO L226 Difference]: Without dead ends: 41502 [2019-12-07 18:46:01,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:46:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-07 18:46:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-07 18:46:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-07 18:46:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-07 18:46:03,405 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-07 18:46:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:03,406 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-07 18:46:03,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:46:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-07 18:46:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:46:03,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:03,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:03,410 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:03,410 INFO L82 PathProgramCache]: Analyzing trace with hash 652997656, now seen corresponding path program 1 times [2019-12-07 18:46:03,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:03,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641739430] [2019-12-07 18:46:03,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:03,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641739430] [2019-12-07 18:46:03,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:03,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:46:03,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046139109] [2019-12-07 18:46:03,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:46:03,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:03,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:46:03,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:46:03,481 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-07 18:46:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:04,123 INFO L93 Difference]: Finished difference Result 66122 states and 260012 transitions. [2019-12-07 18:46:04,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:46:04,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:46:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:04,294 INFO L225 Difference]: With dead ends: 66122 [2019-12-07 18:46:04,294 INFO L226 Difference]: Without dead ends: 66092 [2019-12-07 18:46:04,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:46:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66092 states. [2019-12-07 18:46:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 64446. [2019-12-07 18:46:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64446 states. [2019-12-07 18:46:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64446 states to 64446 states and 254822 transitions. [2019-12-07 18:46:05,963 INFO L78 Accepts]: Start accepts. Automaton has 64446 states and 254822 transitions. Word has length 13 [2019-12-07 18:46:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:05,963 INFO L462 AbstractCegarLoop]: Abstraction has 64446 states and 254822 transitions. [2019-12-07 18:46:05,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:46:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 64446 states and 254822 transitions. [2019-12-07 18:46:05,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:46:05,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:05,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:05,968 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:05,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:05,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1079576864, now seen corresponding path program 1 times [2019-12-07 18:46:05,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:05,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618763686] [2019-12-07 18:46:05,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:06,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618763686] [2019-12-07 18:46:06,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:06,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:46:06,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310672919] [2019-12-07 18:46:06,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:46:06,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:06,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:46:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:46:06,010 INFO L87 Difference]: Start difference. First operand 64446 states and 254822 transitions. Second operand 4 states. [2019-12-07 18:46:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:06,643 INFO L93 Difference]: Finished difference Result 82254 states and 320688 transitions. [2019-12-07 18:46:06,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:46:06,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:46:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:06,831 INFO L225 Difference]: With dead ends: 82254 [2019-12-07 18:46:06,831 INFO L226 Difference]: Without dead ends: 82226 [2019-12-07 18:46:06,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:46:07,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82226 states. [2019-12-07 18:46:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82226 to 73414. [2019-12-07 18:46:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73414 states. [2019-12-07 18:46:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73414 states to 73414 states and 288912 transitions. [2019-12-07 18:46:09,660 INFO L78 Accepts]: Start accepts. Automaton has 73414 states and 288912 transitions. Word has length 16 [2019-12-07 18:46:09,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:09,660 INFO L462 AbstractCegarLoop]: Abstraction has 73414 states and 288912 transitions. [2019-12-07 18:46:09,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:46:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 73414 states and 288912 transitions. [2019-12-07 18:46:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:46:09,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:09,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:09,668 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash -624278653, now seen corresponding path program 1 times [2019-12-07 18:46:09,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:09,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559142469] [2019-12-07 18:46:09,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:09,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559142469] [2019-12-07 18:46:09,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:09,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:46:09,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813554103] [2019-12-07 18:46:09,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:46:09,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:46:09,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:46:09,747 INFO L87 Difference]: Start difference. First operand 73414 states and 288912 transitions. Second operand 3 states. [2019-12-07 18:46:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:10,026 INFO L93 Difference]: Finished difference Result 73434 states and 288812 transitions. [2019-12-07 18:46:10,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:46:10,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:46:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:10,183 INFO L225 Difference]: With dead ends: 73434 [2019-12-07 18:46:10,183 INFO L226 Difference]: Without dead ends: 73434 [2019-12-07 18:46:10,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:46:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73434 states. [2019-12-07 18:46:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73434 to 73349. [2019-12-07 18:46:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73349 states. [2019-12-07 18:46:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73349 states to 73349 states and 288633 transitions. [2019-12-07 18:46:11,945 INFO L78 Accepts]: Start accepts. Automaton has 73349 states and 288633 transitions. Word has length 18 [2019-12-07 18:46:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:11,945 INFO L462 AbstractCegarLoop]: Abstraction has 73349 states and 288633 transitions. [2019-12-07 18:46:11,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:46:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 73349 states and 288633 transitions. [2019-12-07 18:46:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:46:11,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:11,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:11,952 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:11,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash 152584349, now seen corresponding path program 1 times [2019-12-07 18:46:11,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:11,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556388705] [2019-12-07 18:46:11,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:12,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556388705] [2019-12-07 18:46:12,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:12,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:46:12,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942204330] [2019-12-07 18:46:12,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:46:12,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:12,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:46:12,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:46:12,018 INFO L87 Difference]: Start difference. First operand 73349 states and 288633 transitions. Second operand 4 states. [2019-12-07 18:46:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:12,322 INFO L93 Difference]: Finished difference Result 68874 states and 270636 transitions. [2019-12-07 18:46:12,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:46:12,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 18:46:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:12,483 INFO L225 Difference]: With dead ends: 68874 [2019-12-07 18:46:12,483 INFO L226 Difference]: Without dead ends: 68874 [2019-12-07 18:46:12,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:46:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68874 states. [2019-12-07 18:46:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68874 to 68874. [2019-12-07 18:46:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68874 states. [2019-12-07 18:46:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68874 states to 68874 states and 270636 transitions. [2019-12-07 18:46:14,221 INFO L78 Accepts]: Start accepts. Automaton has 68874 states and 270636 transitions. Word has length 19 [2019-12-07 18:46:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:14,221 INFO L462 AbstractCegarLoop]: Abstraction has 68874 states and 270636 transitions. [2019-12-07 18:46:14,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:46:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 68874 states and 270636 transitions. [2019-12-07 18:46:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:46:14,233 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:14,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:14,233 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash -482510294, now seen corresponding path program 1 times [2019-12-07 18:46:14,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:14,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072826002] [2019-12-07 18:46:14,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:14,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072826002] [2019-12-07 18:46:14,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:14,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:46:14,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960104632] [2019-12-07 18:46:14,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:46:14,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:14,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:46:14,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:46:14,281 INFO L87 Difference]: Start difference. First operand 68874 states and 270636 transitions. Second operand 5 states. [2019-12-07 18:46:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:15,069 INFO L93 Difference]: Finished difference Result 81922 states and 317702 transitions. [2019-12-07 18:46:15,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:46:15,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 18:46:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:15,224 INFO L225 Difference]: With dead ends: 81922 [2019-12-07 18:46:15,225 INFO L226 Difference]: Without dead ends: 81870 [2019-12-07 18:46:15,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:46:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81870 states. [2019-12-07 18:46:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81870 to 68462. [2019-12-07 18:46:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68462 states. [2019-12-07 18:46:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68462 states to 68462 states and 269172 transitions. [2019-12-07 18:46:16,867 INFO L78 Accepts]: Start accepts. Automaton has 68462 states and 269172 transitions. Word has length 22 [2019-12-07 18:46:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:16,868 INFO L462 AbstractCegarLoop]: Abstraction has 68462 states and 269172 transitions. [2019-12-07 18:46:16,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:46:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 68462 states and 269172 transitions. [2019-12-07 18:46:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:46:16,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:16,929 INFO L410 BasicCegarLoop]: trace 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, 1, 1, 1, 1] [2019-12-07 18:46:16,929 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:16,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:16,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1940822117, now seen corresponding path program 1 times [2019-12-07 18:46:16,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:16,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798463849] [2019-12-07 18:46:16,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:16,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798463849] [2019-12-07 18:46:16,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:16,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:46:16,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729055706] [2019-12-07 18:46:16,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:46:16,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:16,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:46:16,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:46:16,966 INFO L87 Difference]: Start difference. First operand 68462 states and 269172 transitions. Second operand 3 states. [2019-12-07 18:46:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:17,219 INFO L93 Difference]: Finished difference Result 68462 states and 266022 transitions. [2019-12-07 18:46:17,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:46:17,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 18:46:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:17,349 INFO L225 Difference]: With dead ends: 68462 [2019-12-07 18:46:17,349 INFO L226 Difference]: Without dead ends: 68462 [2019-12-07 18:46:17,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:46:17,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68462 states. [2019-12-07 18:46:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68462 to 68302. [2019-12-07 18:46:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68302 states. [2019-12-07 18:46:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68302 states to 68302 states and 265518 transitions. [2019-12-07 18:46:18,976 INFO L78 Accepts]: Start accepts. Automaton has 68302 states and 265518 transitions. Word has length 32 [2019-12-07 18:46:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:18,976 INFO L462 AbstractCegarLoop]: Abstraction has 68302 states and 265518 transitions. [2019-12-07 18:46:18,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:46:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 68302 states and 265518 transitions. [2019-12-07 18:46:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:46:19,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:19,030 INFO L410 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1] [2019-12-07 18:46:19,030 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:19,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:19,031 INFO L82 PathProgramCache]: Analyzing trace with hash 325215007, now seen corresponding path program 1 times [2019-12-07 18:46:19,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:19,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677639414] [2019-12-07 18:46:19,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:19,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:19,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677639414] [2019-12-07 18:46:19,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:19,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:46:19,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137542681] [2019-12-07 18:46:19,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:46:19,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:19,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:46:19,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:46:19,090 INFO L87 Difference]: Start difference. First operand 68302 states and 265518 transitions. Second operand 5 states. [2019-12-07 18:46:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:19,560 INFO L93 Difference]: Finished difference Result 95302 states and 375926 transitions. [2019-12-07 18:46:19,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:46:19,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 18:46:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:19,769 INFO L225 Difference]: With dead ends: 95302 [2019-12-07 18:46:19,769 INFO L226 Difference]: Without dead ends: 95302 [2019-12-07 18:46:19,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:46:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95302 states. [2019-12-07 18:46:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95302 to 92742. [2019-12-07 18:46:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92742 states. [2019-12-07 18:46:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92742 states to 92742 states and 366722 transitions. [2019-12-07 18:46:21,892 INFO L78 Accepts]: Start accepts. Automaton has 92742 states and 366722 transitions. Word has length 33 [2019-12-07 18:46:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:21,892 INFO L462 AbstractCegarLoop]: Abstraction has 92742 states and 366722 transitions. [2019-12-07 18:46:21,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:46:21,893 INFO L276 IsEmpty]: Start isEmpty. Operand 92742 states and 366722 transitions. [2019-12-07 18:46:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:46:21,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:21,976 INFO L410 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1] [2019-12-07 18:46:21,976 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:21,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash 249335433, now seen corresponding path program 2 times [2019-12-07 18:46:21,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:21,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943244232] [2019-12-07 18:46:21,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:22,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943244232] [2019-12-07 18:46:22,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:22,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:46:22,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040670525] [2019-12-07 18:46:22,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:46:22,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:22,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:46:22,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:46:22,027 INFO L87 Difference]: Start difference. First operand 92742 states and 366722 transitions. Second operand 4 states. [2019-12-07 18:46:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:22,375 INFO L93 Difference]: Finished difference Result 91922 states and 363250 transitions. [2019-12-07 18:46:22,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:46:22,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 18:46:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:22,565 INFO L225 Difference]: With dead ends: 91922 [2019-12-07 18:46:22,566 INFO L226 Difference]: Without dead ends: 91922 [2019-12-07 18:46:22,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:46:23,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91922 states. [2019-12-07 18:46:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91922 to 91106. [2019-12-07 18:46:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91106 states. [2019-12-07 18:46:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91106 states to 91106 states and 359790 transitions. [2019-12-07 18:46:24,749 INFO L78 Accepts]: Start accepts. Automaton has 91106 states and 359790 transitions. Word has length 33 [2019-12-07 18:46:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:24,749 INFO L462 AbstractCegarLoop]: Abstraction has 91106 states and 359790 transitions. [2019-12-07 18:46:24,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:46:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 91106 states and 359790 transitions. [2019-12-07 18:46:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:46:24,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:24,833 INFO L410 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:24,833 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:24,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:24,833 INFO L82 PathProgramCache]: Analyzing trace with hash -301630929, now seen corresponding path program 1 times [2019-12-07 18:46:24,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:24,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326480053] [2019-12-07 18:46:24,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:24,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326480053] [2019-12-07 18:46:24,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:24,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:46:24,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052391751] [2019-12-07 18:46:24,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:46:24,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:24,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:46:24,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:46:24,884 INFO L87 Difference]: Start difference. First operand 91106 states and 359790 transitions. Second operand 4 states. [2019-12-07 18:46:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:25,216 INFO L93 Difference]: Finished difference Result 91080 states and 359713 transitions. [2019-12-07 18:46:25,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:46:25,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 18:46:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:25,396 INFO L225 Difference]: With dead ends: 91080 [2019-12-07 18:46:25,396 INFO L226 Difference]: Without dead ends: 91080 [2019-12-07 18:46:25,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:46:26,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91080 states. [2019-12-07 18:46:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91080 to 91056. [2019-12-07 18:46:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91056 states. [2019-12-07 18:46:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91056 states to 91056 states and 359643 transitions. [2019-12-07 18:46:27,336 INFO L78 Accepts]: Start accepts. Automaton has 91056 states and 359643 transitions. Word has length 34 [2019-12-07 18:46:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:27,336 INFO L462 AbstractCegarLoop]: Abstraction has 91056 states and 359643 transitions. [2019-12-07 18:46:27,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:46:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 91056 states and 359643 transitions. [2019-12-07 18:46:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:46:27,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:27,427 INFO L410 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:27,427 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:27,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:27,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1505027812, now seen corresponding path program 1 times [2019-12-07 18:46:27,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:27,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399408431] [2019-12-07 18:46:27,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:27,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399408431] [2019-12-07 18:46:27,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:27,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:46:27,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396353745] [2019-12-07 18:46:27,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:46:27,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:27,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:46:27,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:46:27,475 INFO L87 Difference]: Start difference. First operand 91056 states and 359643 transitions. Second operand 6 states. [2019-12-07 18:46:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:28,260 INFO L93 Difference]: Finished difference Result 147305 states and 576516 transitions. [2019-12-07 18:46:28,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:46:28,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-07 18:46:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:28,557 INFO L225 Difference]: With dead ends: 147305 [2019-12-07 18:46:28,557 INFO L226 Difference]: Without dead ends: 135405 [2019-12-07 18:46:28,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:46:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135405 states. [2019-12-07 18:46:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135405 to 117080. [2019-12-07 18:46:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117080 states. [2019-12-07 18:46:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117080 states to 117080 states and 464603 transitions. [2019-12-07 18:46:31,327 INFO L78 Accepts]: Start accepts. Automaton has 117080 states and 464603 transitions. Word has length 35 [2019-12-07 18:46:31,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:31,328 INFO L462 AbstractCegarLoop]: Abstraction has 117080 states and 464603 transitions. [2019-12-07 18:46:31,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:46:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 117080 states and 464603 transitions. [2019-12-07 18:46:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:46:31,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:31,445 INFO L410 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:31,446 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:31,446 INFO L82 PathProgramCache]: Analyzing trace with hash -22818902, now seen corresponding path program 2 times [2019-12-07 18:46:31,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:31,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619809372] [2019-12-07 18:46:31,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:31,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619809372] [2019-12-07 18:46:31,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:31,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:46:31,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688598702] [2019-12-07 18:46:31,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:46:31,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:31,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:46:31,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:46:31,509 INFO L87 Difference]: Start difference. First operand 117080 states and 464603 transitions. Second operand 7 states. [2019-12-07 18:46:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:32,590 INFO L93 Difference]: Finished difference Result 193407 states and 754114 transitions. [2019-12-07 18:46:32,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:46:32,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 18:46:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:32,948 INFO L225 Difference]: With dead ends: 193407 [2019-12-07 18:46:32,948 INFO L226 Difference]: Without dead ends: 164151 [2019-12-07 18:46:32,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:46:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164151 states. [2019-12-07 18:46:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164151 to 112516. [2019-12-07 18:46:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112516 states. [2019-12-07 18:46:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112516 states to 112516 states and 441869 transitions. [2019-12-07 18:46:35,865 INFO L78 Accepts]: Start accepts. Automaton has 112516 states and 441869 transitions. Word has length 35 [2019-12-07 18:46:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:35,865 INFO L462 AbstractCegarLoop]: Abstraction has 112516 states and 441869 transitions. [2019-12-07 18:46:35,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:46:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 112516 states and 441869 transitions. [2019-12-07 18:46:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:46:37,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:37,580 INFO L410 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:37,580 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1411267042, now seen corresponding path program 3 times [2019-12-07 18:46:37,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:37,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455154746] [2019-12-07 18:46:37,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:37,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455154746] [2019-12-07 18:46:37,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:37,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:46:37,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730145414] [2019-12-07 18:46:37,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:46:37,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:37,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:46:37,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:46:37,619 INFO L87 Difference]: Start difference. First operand 112516 states and 441869 transitions. Second operand 5 states. [2019-12-07 18:46:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:37,687 INFO L93 Difference]: Finished difference Result 14022 states and 47881 transitions. [2019-12-07 18:46:37,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:46:37,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 18:46:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:37,698 INFO L225 Difference]: With dead ends: 14022 [2019-12-07 18:46:37,698 INFO L226 Difference]: Without dead ends: 7836 [2019-12-07 18:46:37,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:46:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2019-12-07 18:46:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 7836. [2019-12-07 18:46:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7836 states. [2019-12-07 18:46:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7836 states to 7836 states and 22841 transitions. [2019-12-07 18:46:37,781 INFO L78 Accepts]: Start accepts. Automaton has 7836 states and 22841 transitions. Word has length 35 [2019-12-07 18:46:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:37,781 INFO L462 AbstractCegarLoop]: Abstraction has 7836 states and 22841 transitions. [2019-12-07 18:46:37,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:46:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 7836 states and 22841 transitions. [2019-12-07 18:46:37,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:46:37,786 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:37,787 INFO L410 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:37,787 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:37,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:37,787 INFO L82 PathProgramCache]: Analyzing trace with hash -492468280, now seen corresponding path program 1 times [2019-12-07 18:46:37,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:37,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687720108] [2019-12-07 18:46:37,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:37,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687720108] [2019-12-07 18:46:37,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:37,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:46:37,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924972647] [2019-12-07 18:46:37,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:46:37,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:37,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:46:37,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:46:37,840 INFO L87 Difference]: Start difference. First operand 7836 states and 22841 transitions. Second operand 6 states. [2019-12-07 18:46:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:37,893 INFO L93 Difference]: Finished difference Result 6461 states and 19656 transitions. [2019-12-07 18:46:37,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:46:37,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-07 18:46:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:37,900 INFO L225 Difference]: With dead ends: 6461 [2019-12-07 18:46:37,901 INFO L226 Difference]: Without dead ends: 6252 [2019-12-07 18:46:37,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:46:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6252 states. [2019-12-07 18:46:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6252 to 6228. [2019-12-07 18:46:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2019-12-07 18:46:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 19147 transitions. [2019-12-07 18:46:37,970 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 19147 transitions. Word has length 47 [2019-12-07 18:46:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:37,970 INFO L462 AbstractCegarLoop]: Abstraction has 6228 states and 19147 transitions. [2019-12-07 18:46:37,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:46:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 19147 transitions. [2019-12-07 18:46:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:46:37,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:37,975 INFO L410 BasicCegarLoop]: trace 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, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:37,975 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:37,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash -86235555, now seen corresponding path program 1 times [2019-12-07 18:46:37,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:37,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267569686] [2019-12-07 18:46:37,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:38,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267569686] [2019-12-07 18:46:38,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:38,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:46:38,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697886784] [2019-12-07 18:46:38,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:46:38,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:38,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:46:38,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:46:38,172 INFO L87 Difference]: Start difference. First operand 6228 states and 19147 transitions. Second operand 13 states. [2019-12-07 18:46:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:39,063 INFO L93 Difference]: Finished difference Result 14502 states and 44004 transitions. [2019-12-07 18:46:39,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:46:39,063 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-12-07 18:46:39,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:39,076 INFO L225 Difference]: With dead ends: 14502 [2019-12-07 18:46:39,076 INFO L226 Difference]: Without dead ends: 11448 [2019-12-07 18:46:39,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:46:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11448 states. [2019-12-07 18:46:39,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11448 to 7078. [2019-12-07 18:46:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7078 states. [2019-12-07 18:46:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7078 states to 7078 states and 21672 transitions. [2019-12-07 18:46:39,173 INFO L78 Accepts]: Start accepts. Automaton has 7078 states and 21672 transitions. Word has length 62 [2019-12-07 18:46:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:39,173 INFO L462 AbstractCegarLoop]: Abstraction has 7078 states and 21672 transitions. [2019-12-07 18:46:39,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:46:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 7078 states and 21672 transitions. [2019-12-07 18:46:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:46:39,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:39,179 INFO L410 BasicCegarLoop]: trace 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, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:39,179 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:39,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:39,179 INFO L82 PathProgramCache]: Analyzing trace with hash 379563741, now seen corresponding path program 2 times [2019-12-07 18:46:39,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:39,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790269809] [2019-12-07 18:46:39,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:39,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790269809] [2019-12-07 18:46:39,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:39,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:46:39,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461992123] [2019-12-07 18:46:39,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:46:39,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:39,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:46:39,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:46:39,228 INFO L87 Difference]: Start difference. First operand 7078 states and 21672 transitions. Second operand 4 states. [2019-12-07 18:46:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:39,256 INFO L93 Difference]: Finished difference Result 7577 states and 22803 transitions. [2019-12-07 18:46:39,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:46:39,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 18:46:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:39,260 INFO L225 Difference]: With dead ends: 7577 [2019-12-07 18:46:39,260 INFO L226 Difference]: Without dead ends: 4034 [2019-12-07 18:46:39,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:46:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2019-12-07 18:46:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2019-12-07 18:46:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4034 states. [2019-12-07 18:46:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 10685 transitions. [2019-12-07 18:46:39,299 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 10685 transitions. Word has length 62 [2019-12-07 18:46:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:39,299 INFO L462 AbstractCegarLoop]: Abstraction has 4034 states and 10685 transitions. [2019-12-07 18:46:39,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:46:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 10685 transitions. [2019-12-07 18:46:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 18:46:39,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:39,302 INFO L410 BasicCegarLoop]: trace 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, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:39,302 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:39,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:39,302 INFO L82 PathProgramCache]: Analyzing trace with hash -379647347, now seen corresponding path program 3 times [2019-12-07 18:46:39,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:39,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396417946] [2019-12-07 18:46:39,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:39,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396417946] [2019-12-07 18:46:39,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:39,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:46:39,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597650176] [2019-12-07 18:46:39,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:46:39,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:39,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:46:39,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:46:39,365 INFO L87 Difference]: Start difference. First operand 4034 states and 10685 transitions. Second operand 4 states. [2019-12-07 18:46:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:39,398 INFO L93 Difference]: Finished difference Result 4411 states and 11548 transitions. [2019-12-07 18:46:39,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:46:39,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 18:46:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:39,401 INFO L225 Difference]: With dead ends: 4411 [2019-12-07 18:46:39,401 INFO L226 Difference]: Without dead ends: 2935 [2019-12-07 18:46:39,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:46:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2019-12-07 18:46:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2605. [2019-12-07 18:46:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2019-12-07 18:46:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 6856 transitions. [2019-12-07 18:46:39,427 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 6856 transitions. Word has length 62 [2019-12-07 18:46:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:39,427 INFO L462 AbstractCegarLoop]: Abstraction has 2605 states and 6856 transitions. [2019-12-07 18:46:39,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:46:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 6856 transitions. [2019-12-07 18:46:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:46:39,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:39,429 INFO L410 BasicCegarLoop]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:39,429 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash -956676094, now seen corresponding path program 1 times [2019-12-07 18:46:39,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:39,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275134606] [2019-12-07 18:46:39,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:39,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275134606] [2019-12-07 18:46:39,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:39,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:46:39,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082837922] [2019-12-07 18:46:39,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:46:39,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:39,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:46:39,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:46:39,492 INFO L87 Difference]: Start difference. First operand 2605 states and 6856 transitions. Second operand 5 states. [2019-12-07 18:46:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:39,518 INFO L93 Difference]: Finished difference Result 2979 states and 7714 transitions. [2019-12-07 18:46:39,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:46:39,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 18:46:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:39,519 INFO L225 Difference]: With dead ends: 2979 [2019-12-07 18:46:39,519 INFO L226 Difference]: Without dead ends: 437 [2019-12-07 18:46:39,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:46:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-07 18:46:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-12-07 18:46:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-07 18:46:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 955 transitions. [2019-12-07 18:46:39,524 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 955 transitions. Word has length 63 [2019-12-07 18:46:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:39,524 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 955 transitions. [2019-12-07 18:46:39,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:46:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 955 transitions. [2019-12-07 18:46:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:46:39,524 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:39,524 INFO L410 BasicCegarLoop]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:39,524 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:39,525 INFO L82 PathProgramCache]: Analyzing trace with hash -496292372, now seen corresponding path program 2 times [2019-12-07 18:46:39,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:39,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558788075] [2019-12-07 18:46:39,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:39,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558788075] [2019-12-07 18:46:39,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:39,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:46:39,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349062837] [2019-12-07 18:46:39,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:46:39,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:39,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:46:39,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:46:39,601 INFO L87 Difference]: Start difference. First operand 437 states and 955 transitions. Second operand 8 states. [2019-12-07 18:46:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:39,789 INFO L93 Difference]: Finished difference Result 943 states and 2025 transitions. [2019-12-07 18:46:39,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:46:39,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 18:46:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:39,790 INFO L225 Difference]: With dead ends: 943 [2019-12-07 18:46:39,790 INFO L226 Difference]: Without dead ends: 692 [2019-12-07 18:46:39,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:46:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-12-07 18:46:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 528. [2019-12-07 18:46:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-12-07 18:46:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1120 transitions. [2019-12-07 18:46:39,796 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1120 transitions. Word has length 63 [2019-12-07 18:46:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:39,796 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 1120 transitions. [2019-12-07 18:46:39,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:46:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1120 transitions. [2019-12-07 18:46:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:46:39,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:39,796 INFO L410 BasicCegarLoop]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:39,797 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:39,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:39,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2092088660, now seen corresponding path program 3 times [2019-12-07 18:46:39,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:39,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882886122] [2019-12-07 18:46:39,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:46:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:46:39,878 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:46:39,878 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:46:39,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_268) (= v_~y$w_buff1~0_277 0) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t35~0.base_112|)) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t35~0.base_112|) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 v_~y$r_buff1_thd2~0_454) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t35~0.base_112| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t35~0.offset_63|) (= 0 v_~y$w_buff0~0_387) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t35~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t35~0.base_112|) |v_ULTIMATE.start_main_~#t35~0.offset_63| 0)) |v_#memory_int_21|) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= v_~y$r_buff1_thd1~0_236 0) (= |v_#valid_144| (store .cse0 |v_ULTIMATE.start_main_~#t35~0.base_112| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t37~0.base=|v_ULTIMATE.start_main_~#t37~0.base_59|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ULTIMATE.start_main_~#t35~0.offset=|v_ULTIMATE.start_main_~#t35~0.offset_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_~#t35~0.base=|v_ULTIMATE.start_main_~#t35~0.base_112|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t36~0.base=|v_ULTIMATE.start_main_~#t36~0.base_84|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_461, ULTIMATE.start_main_~#t37~0.offset=|v_ULTIMATE.start_main_~#t37~0.offset_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_977, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ULTIMATE.start_main_~#t36~0.offset=|v_ULTIMATE.start_main_~#t36~0.offset_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t37~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t35~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t35~0.base, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t36~0.base, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t37~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t36~0.offset, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:46:39,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t36~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t36~0.base_11|)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t36~0.base_11|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t36~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t36~0.base_11|) |v_ULTIMATE.start_main_~#t36~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t36~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t36~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t36~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t36~0.base=|v_ULTIMATE.start_main_~#t36~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t36~0.offset=|v_ULTIMATE.start_main_~#t36~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t36~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t36~0.offset, #length] because there is no mapped edge [2019-12-07 18:46:39,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t37~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t37~0.base_11|) |v_ULTIMATE.start_main_~#t37~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t37~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t37~0.base_11| 1)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t37~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t37~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t37~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t37~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t37~0.base=|v_ULTIMATE.start_main_~#t37~0.base_11|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t37~0.offset=|v_ULTIMATE.start_main_~#t37~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t37~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t37~0.offset, #length] because there is no mapped edge [2019-12-07 18:46:39,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_197 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_345 256))))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:46:39,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In670557631 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In670557631 256)))) (or (and (= ~y$w_buff1~0_In670557631 |P2Thread1of1ForFork0_#t~ite28_Out670557631|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out670557631| ~y$w_buff0~0_In670557631) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In670557631, ~y$w_buff1~0=~y$w_buff1~0_In670557631, ~y$w_buff0~0=~y$w_buff0~0_In670557631, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In670557631} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out670557631|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In670557631, ~y$w_buff1~0=~y$w_buff1~0_In670557631, ~y$w_buff0~0=~y$w_buff0~0_In670557631, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In670557631} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:46:39,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 18:46:39,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 18:46:39,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-382619712 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-382619712| ~y~0_In-382619712)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-382619712| ~y$mem_tmp~0_In-382619712)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-382619712, ~y$flush_delayed~0=~y$flush_delayed~0_In-382619712, ~y~0=~y~0_In-382619712} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-382619712|, ~y$mem_tmp~0=~y$mem_tmp~0_In-382619712, ~y$flush_delayed~0=~y$flush_delayed~0_In-382619712, ~y~0=~y~0_In-382619712} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 18:46:39,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_8) (= v_P0Thread1of1ForFork1_~arg.offset_8 |v_P0Thread1of1ForFork1_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:46:39,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In382687223 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In382687223 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In382687223 |P2Thread1of1ForFork0_#t~ite51_Out382687223|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out382687223|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In382687223, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In382687223} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In382687223, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In382687223, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out382687223|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 18:46:39,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-751395707 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-751395707 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-751395707 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-751395707 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-751395707| ~y$w_buff1_used~0_In-751395707)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out-751395707| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-751395707, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-751395707, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-751395707, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-751395707} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-751395707, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-751395707, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-751395707, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-751395707|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-751395707} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 18:46:39,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-785478755 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-785478755 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In-785478755 ~y$r_buff0_thd3~0_Out-785478755))) (or (and (= 0 ~y$r_buff0_thd3~0_Out-785478755) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-785478755, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-785478755} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-785478755, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-785478755, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-785478755|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 18:46:39,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-76510026 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-76510026 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-76510026 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-76510026 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out-76510026| 0)) (and (= ~y$r_buff1_thd3~0_In-76510026 |P2Thread1of1ForFork0_#t~ite54_Out-76510026|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-76510026, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-76510026, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-76510026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-76510026} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-76510026, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-76510026, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-76510026|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-76510026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-76510026} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:46:39,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:46:39,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1945554458 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1945554458| ~y$mem_tmp~0_In-1945554458) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-1945554458| ~y~0_In-1945554458)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1945554458, ~y$flush_delayed~0=~y$flush_delayed~0_In-1945554458, ~y~0=~y~0_In-1945554458} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1945554458, ~y$flush_delayed~0=~y$flush_delayed~0_In-1945554458, ~y~0=~y~0_In-1945554458, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1945554458|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:46:39,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= v_~y$flush_delayed~0_261 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:46:39,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:46:39,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite58_Out1749486227| |ULTIMATE.start_main_#t~ite59_Out1749486227|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1749486227 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1749486227 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out1749486227| ~y$w_buff1~0_In1749486227) (not .cse0) .cse1 (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite58_Out1749486227| ~y~0_In1749486227)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1749486227, ~y~0=~y~0_In1749486227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1749486227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1749486227} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1749486227, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1749486227|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1749486227|, ~y~0=~y~0_In1749486227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1749486227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1749486227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:46:39,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-792009912 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-792009912 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out-792009912| ~y$w_buff0_used~0_In-792009912) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-792009912| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-792009912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-792009912} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-792009912|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-792009912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-792009912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 18:46:39,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-205087061 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-205087061 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-205087061 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-205087061 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out-205087061|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-205087061 |ULTIMATE.start_main_#t~ite61_Out-205087061|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-205087061, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-205087061, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-205087061, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-205087061} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-205087061|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-205087061, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-205087061, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-205087061, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-205087061} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:46:39,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In408872856 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In408872856 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out408872856| ~y$r_buff0_thd0~0_In408872856) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out408872856| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In408872856, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In408872856} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out408872856|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In408872856, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In408872856} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:46:39,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In35620892 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In35620892 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In35620892 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In35620892 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out35620892| ~y$r_buff1_thd0~0_In35620892) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite63_Out35620892| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In35620892, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In35620892, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In35620892, ~y$w_buff1_used~0=~y$w_buff1_used~0_In35620892} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out35620892|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In35620892, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In35620892, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In35620892, ~y$w_buff1_used~0=~y$w_buff1_used~0_In35620892} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:46:39,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_29 0) (= 1 v_~__unbuffered_p0_EAX~0_29) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:46:39,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:46:39 BasicIcfg [2019-12-07 18:46:39,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:46:39,975 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:46:39,975 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:46:39,975 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:46:39,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:45:54" (3/4) ... [2019-12-07 18:46:39,977 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:46:39,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_268) (= v_~y$w_buff1~0_277 0) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t35~0.base_112|)) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t35~0.base_112|) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 v_~y$r_buff1_thd2~0_454) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t35~0.base_112| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t35~0.offset_63|) (= 0 v_~y$w_buff0~0_387) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t35~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t35~0.base_112|) |v_ULTIMATE.start_main_~#t35~0.offset_63| 0)) |v_#memory_int_21|) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= v_~y$r_buff1_thd1~0_236 0) (= |v_#valid_144| (store .cse0 |v_ULTIMATE.start_main_~#t35~0.base_112| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t37~0.base=|v_ULTIMATE.start_main_~#t37~0.base_59|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ULTIMATE.start_main_~#t35~0.offset=|v_ULTIMATE.start_main_~#t35~0.offset_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_~#t35~0.base=|v_ULTIMATE.start_main_~#t35~0.base_112|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t36~0.base=|v_ULTIMATE.start_main_~#t36~0.base_84|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_461, ULTIMATE.start_main_~#t37~0.offset=|v_ULTIMATE.start_main_~#t37~0.offset_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_977, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ULTIMATE.start_main_~#t36~0.offset=|v_ULTIMATE.start_main_~#t36~0.offset_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t37~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t35~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t35~0.base, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t36~0.base, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t37~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t36~0.offset, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:46:39,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t36~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t36~0.base_11|)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t36~0.base_11|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t36~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t36~0.base_11|) |v_ULTIMATE.start_main_~#t36~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t36~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t36~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t36~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t36~0.base=|v_ULTIMATE.start_main_~#t36~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t36~0.offset=|v_ULTIMATE.start_main_~#t36~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t36~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t36~0.offset, #length] because there is no mapped edge [2019-12-07 18:46:39,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t37~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t37~0.base_11|) |v_ULTIMATE.start_main_~#t37~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t37~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t37~0.base_11| 1)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t37~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t37~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t37~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t37~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t37~0.base=|v_ULTIMATE.start_main_~#t37~0.base_11|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t37~0.offset=|v_ULTIMATE.start_main_~#t37~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t37~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t37~0.offset, #length] because there is no mapped edge [2019-12-07 18:46:39,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_197 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_345 256))))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:46:39,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In670557631 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In670557631 256)))) (or (and (= ~y$w_buff1~0_In670557631 |P2Thread1of1ForFork0_#t~ite28_Out670557631|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out670557631| ~y$w_buff0~0_In670557631) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In670557631, ~y$w_buff1~0=~y$w_buff1~0_In670557631, ~y$w_buff0~0=~y$w_buff0~0_In670557631, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In670557631} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out670557631|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In670557631, ~y$w_buff1~0=~y$w_buff1~0_In670557631, ~y$w_buff0~0=~y$w_buff0~0_In670557631, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In670557631} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:46:39,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 18:46:39,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 18:46:39,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-382619712 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-382619712| ~y~0_In-382619712)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-382619712| ~y$mem_tmp~0_In-382619712)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-382619712, ~y$flush_delayed~0=~y$flush_delayed~0_In-382619712, ~y~0=~y~0_In-382619712} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-382619712|, ~y$mem_tmp~0=~y$mem_tmp~0_In-382619712, ~y$flush_delayed~0=~y$flush_delayed~0_In-382619712, ~y~0=~y~0_In-382619712} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 18:46:39,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_8) (= v_P0Thread1of1ForFork1_~arg.offset_8 |v_P0Thread1of1ForFork1_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:46:39,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In382687223 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In382687223 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In382687223 |P2Thread1of1ForFork0_#t~ite51_Out382687223|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out382687223|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In382687223, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In382687223} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In382687223, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In382687223, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out382687223|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 18:46:39,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-751395707 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-751395707 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-751395707 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-751395707 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-751395707| ~y$w_buff1_used~0_In-751395707)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out-751395707| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-751395707, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-751395707, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-751395707, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-751395707} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-751395707, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-751395707, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-751395707, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-751395707|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-751395707} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 18:46:39,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-785478755 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-785478755 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In-785478755 ~y$r_buff0_thd3~0_Out-785478755))) (or (and (= 0 ~y$r_buff0_thd3~0_Out-785478755) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-785478755, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-785478755} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-785478755, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-785478755, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-785478755|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 18:46:39,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-76510026 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-76510026 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-76510026 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-76510026 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out-76510026| 0)) (and (= ~y$r_buff1_thd3~0_In-76510026 |P2Thread1of1ForFork0_#t~ite54_Out-76510026|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-76510026, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-76510026, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-76510026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-76510026} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-76510026, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-76510026, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-76510026|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-76510026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-76510026} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:46:39,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:46:39,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1945554458 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1945554458| ~y$mem_tmp~0_In-1945554458) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-1945554458| ~y~0_In-1945554458)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1945554458, ~y$flush_delayed~0=~y$flush_delayed~0_In-1945554458, ~y~0=~y~0_In-1945554458} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1945554458, ~y$flush_delayed~0=~y$flush_delayed~0_In-1945554458, ~y~0=~y~0_In-1945554458, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1945554458|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:46:39,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= v_~y$flush_delayed~0_261 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:46:39,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:46:39,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite58_Out1749486227| |ULTIMATE.start_main_#t~ite59_Out1749486227|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1749486227 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1749486227 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out1749486227| ~y$w_buff1~0_In1749486227) (not .cse0) .cse1 (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite58_Out1749486227| ~y~0_In1749486227)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1749486227, ~y~0=~y~0_In1749486227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1749486227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1749486227} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1749486227, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1749486227|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1749486227|, ~y~0=~y~0_In1749486227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1749486227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1749486227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:46:39,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-792009912 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-792009912 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out-792009912| ~y$w_buff0_used~0_In-792009912) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-792009912| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-792009912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-792009912} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-792009912|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-792009912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-792009912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 18:46:39,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-205087061 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-205087061 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-205087061 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-205087061 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out-205087061|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-205087061 |ULTIMATE.start_main_#t~ite61_Out-205087061|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-205087061, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-205087061, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-205087061, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-205087061} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-205087061|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-205087061, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-205087061, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-205087061, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-205087061} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:46:39,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In408872856 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In408872856 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out408872856| ~y$r_buff0_thd0~0_In408872856) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out408872856| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In408872856, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In408872856} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out408872856|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In408872856, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In408872856} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:46:39,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In35620892 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In35620892 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In35620892 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In35620892 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out35620892| ~y$r_buff1_thd0~0_In35620892) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite63_Out35620892| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In35620892, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In35620892, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In35620892, ~y$w_buff1_used~0=~y$w_buff1_used~0_In35620892} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out35620892|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In35620892, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In35620892, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In35620892, ~y$w_buff1_used~0=~y$w_buff1_used~0_In35620892} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:46:39,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_29 0) (= 1 v_~__unbuffered_p0_EAX~0_29) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:46:40,066 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a04245c3-410f-4b46-ae68-6335ff9666e3/bin/uautomizer/witness.graphml [2019-12-07 18:46:40,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:46:40,068 INFO L168 Benchmark]: Toolchain (without parser) took 46808.02 ms. Allocated memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: 4.9 GB). Free memory was 938.2 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-12-07 18:46:40,068 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:46:40,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -119.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:40,069 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:46:40,069 INFO L168 Benchmark]: Boogie Preprocessor took 28.18 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:40,069 INFO L168 Benchmark]: RCFGBuilder took 443.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 992.9 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:40,070 INFO L168 Benchmark]: TraceAbstraction took 45803.62 ms. Allocated memory was 1.1 GB in the beginning and 6.0 GB in the end (delta: 4.8 GB). Free memory was 992.9 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 18:46:40,070 INFO L168 Benchmark]: Witness Printer took 91.89 ms. Allocated memory is still 6.0 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:40,071 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 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -119.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.18 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 443.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 992.9 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45803.62 ms. Allocated memory was 1.1 GB in the beginning and 6.0 GB in the end (delta: 4.8 GB). Free memory was 992.9 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 91.89 ms. Allocated memory is still 6.0 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9487 VarBasedMoverChecksPositive, 322 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 124432 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t35, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t36, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t37, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L804] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L805] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L853] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 45.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4268 SDtfs, 5870 SDslu, 9120 SDs, 0 SdLazy, 3005 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117080occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 102359 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 754 NumberOfCodeBlocks, 754 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 672 ConstructedInterpolants, 0 QuantifiedInterpolants, 208536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...