./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019_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_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/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 f64871eb027452eb067a3cfa1a21829d7416dfa7 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:38:25,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:38:25,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:38:25,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:38:25,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:38:25,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:38:25,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:38:25,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:38:25,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:38:25,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:38:25,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:38:25,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:38:25,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:38:25,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:38:25,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:38:25,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:38:25,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:38:25,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:38:25,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:38:25,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:38:25,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:38:25,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:38:25,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:38:25,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:38:25,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:38:25,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:38:25,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:38:25,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:38:25,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:38:25,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:38:25,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:38:25,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:38:25,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:38:25,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:38:25,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:38:25,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:38:25,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:38:25,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:38:25,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:38:25,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:38:25,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:38:25,423 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:38:25,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:38:25,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:38:25,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:38:25,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:38:25,436 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:38:25,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:38:25,437 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:38:25,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:38:25,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:38:25,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:38:25,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:38:25,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:38:25,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:38:25,438 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:38:25,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:38:25,438 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:38:25,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:38:25,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:38:25,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:38:25,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:38:25,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:38:25,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:38:25,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:38:25,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:38:25,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:38:25,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:38:25,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:38:25,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:38:25,440 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:38:25,440 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_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/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 -> f64871eb027452eb067a3cfa1a21829d7416dfa7 [2019-12-07 11:38:25,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:38:25,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:38:25,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:38:25,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:38:25,565 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:38:25,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix019_tso.opt.i [2019-12-07 11:38:25,609 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/bin/uautomizer/data/67d55cbbb/5111765072ee4049bc30fd592a4e15ef/FLAGebf493fde [2019-12-07 11:38:26,054 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:38:26,054 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/sv-benchmarks/c/pthread-wmm/mix019_tso.opt.i [2019-12-07 11:38:26,064 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/bin/uautomizer/data/67d55cbbb/5111765072ee4049bc30fd592a4e15ef/FLAGebf493fde [2019-12-07 11:38:26,073 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/bin/uautomizer/data/67d55cbbb/5111765072ee4049bc30fd592a4e15ef [2019-12-07 11:38:26,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:38:26,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:38:26,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:38:26,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:38:26,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:38:26,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:38:26" (1/1) ... [2019-12-07 11:38:26,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26, skipping insertion in model container [2019-12-07 11:38:26,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:38:26" (1/1) ... [2019-12-07 11:38:26,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:38:26,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:38:26,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:38:26,387 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:38:26,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:38:26,475 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:38:26,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26 WrapperNode [2019-12-07 11:38:26,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:38:26,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:38:26,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:38:26,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:38:26,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26" (1/1) ... [2019-12-07 11:38:26,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26" (1/1) ... [2019-12-07 11:38:26,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:38:26,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:38:26,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:38:26,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:38:26,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26" (1/1) ... [2019-12-07 11:38:26,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26" (1/1) ... [2019-12-07 11:38:26,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26" (1/1) ... [2019-12-07 11:38:26,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26" (1/1) ... [2019-12-07 11:38:26,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26" (1/1) ... [2019-12-07 11:38:26,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26" (1/1) ... [2019-12-07 11:38:26,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26" (1/1) ... [2019-12-07 11:38:26,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:38:26,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:38:26,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:38:26,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:38:26,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/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 11:38:26,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:38:26,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:38:26,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:38:26,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:38:26,584 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:38:26,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:38:26,584 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:38:26,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:38:26,584 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:38:26,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:38:26,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:38:26,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:38:26,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:38:26,585 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 11:38:26,964 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:38:26,964 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:38:26,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:38:26 BoogieIcfgContainer [2019-12-07 11:38:26,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:38:26,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:38:26,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:38:26,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:38:26,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:38:26" (1/3) ... [2019-12-07 11:38:26,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fe7b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:38:26, skipping insertion in model container [2019-12-07 11:38:26,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:26" (2/3) ... [2019-12-07 11:38:26,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fe7b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:38:26, skipping insertion in model container [2019-12-07 11:38:26,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:38:26" (3/3) ... [2019-12-07 11:38:26,970 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_tso.opt.i [2019-12-07 11:38:26,977 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:38:26,977 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:38:26,982 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:38:26,982 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:38:27,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,011 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,011 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,012 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,012 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,023 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,023 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,023 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,023 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,023 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:27,046 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:38:27,058 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:38:27,058 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:38:27,058 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:38:27,058 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:38:27,058 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:38:27,059 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:38:27,059 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:38:27,059 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:38:27,070 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 240 transitions [2019-12-07 11:38:27,071 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 194 places, 240 transitions [2019-12-07 11:38:27,132 INFO L134 PetriNetUnfolder]: 56/237 cut-off events. [2019-12-07 11:38:27,132 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:38:27,148 INFO L76 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 237 events. 56/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 915 event pairs. 9/188 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 11:38:27,168 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 194 places, 240 transitions [2019-12-07 11:38:27,206 INFO L134 PetriNetUnfolder]: 56/237 cut-off events. [2019-12-07 11:38:27,206 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:38:27,214 INFO L76 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 237 events. 56/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 915 event pairs. 9/188 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 11:38:27,238 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 11:38:27,238 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:38:30,496 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 11:38:30,650 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128329 [2019-12-07 11:38:30,650 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-07 11:38:30,652 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 131 transitions [2019-12-07 11:38:33,858 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 48994 states. [2019-12-07 11:38:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 48994 states. [2019-12-07 11:38:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:38:33,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:33,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:33,864 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 11:38:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:33,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1376992094, now seen corresponding path program 1 times [2019-12-07 11:38:33,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:33,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347929355] [2019-12-07 11:38:33,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:34,017 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 11:38:34,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347929355] [2019-12-07 11:38:34,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:34,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:38:34,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179148270] [2019-12-07 11:38:34,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:34,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:34,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:34,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:34,032 INFO L87 Difference]: Start difference. First operand 48994 states. Second operand 3 states. [2019-12-07 11:38:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:34,461 INFO L93 Difference]: Finished difference Result 48562 states and 198786 transitions. [2019-12-07 11:38:34,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:34,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:38:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:34,736 INFO L225 Difference]: With dead ends: 48562 [2019-12-07 11:38:34,736 INFO L226 Difference]: Without dead ends: 45454 [2019-12-07 11:38:34,737 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 11:38:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45454 states. [2019-12-07 11:38:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45454 to 45454. [2019-12-07 11:38:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45454 states. [2019-12-07 11:38:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45454 states to 45454 states and 185938 transitions. [2019-12-07 11:38:36,502 INFO L78 Accepts]: Start accepts. Automaton has 45454 states and 185938 transitions. Word has length 7 [2019-12-07 11:38:36,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:36,503 INFO L462 AbstractCegarLoop]: Abstraction has 45454 states and 185938 transitions. [2019-12-07 11:38:36,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 45454 states and 185938 transitions. [2019-12-07 11:38:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:38:36,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:36,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:36,507 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 11:38:36,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:36,508 INFO L82 PathProgramCache]: Analyzing trace with hash -694250741, now seen corresponding path program 1 times [2019-12-07 11:38:36,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:36,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364573043] [2019-12-07 11:38:36,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:36,570 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 11:38:36,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364573043] [2019-12-07 11:38:36,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:36,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:36,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084340268] [2019-12-07 11:38:36,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:36,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:36,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:36,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:36,572 INFO L87 Difference]: Start difference. First operand 45454 states and 185938 transitions. Second operand 4 states. [2019-12-07 11:38:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:37,019 INFO L93 Difference]: Finished difference Result 70498 states and 277512 transitions. [2019-12-07 11:38:37,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:38:37,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:38:37,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:37,316 INFO L225 Difference]: With dead ends: 70498 [2019-12-07 11:38:37,316 INFO L226 Difference]: Without dead ends: 70464 [2019-12-07 11:38:37,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 11:38:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70464 states. [2019-12-07 11:38:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70464 to 68586. [2019-12-07 11:38:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68586 states. [2019-12-07 11:38:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68586 states to 68586 states and 271564 transitions. [2019-12-07 11:38:39,324 INFO L78 Accepts]: Start accepts. Automaton has 68586 states and 271564 transitions. Word has length 13 [2019-12-07 11:38:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:39,324 INFO L462 AbstractCegarLoop]: Abstraction has 68586 states and 271564 transitions. [2019-12-07 11:38:39,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 68586 states and 271564 transitions. [2019-12-07 11:38:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:38:39,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:39,330 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:39,330 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 11:38:39,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:39,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1574256306, now seen corresponding path program 1 times [2019-12-07 11:38:39,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:39,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077292347] [2019-12-07 11:38:39,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:39,380 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 11:38:39,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077292347] [2019-12-07 11:38:39,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:39,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:39,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056002360] [2019-12-07 11:38:39,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:39,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:39,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:39,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:39,382 INFO L87 Difference]: Start difference. First operand 68586 states and 271564 transitions. Second operand 4 states. [2019-12-07 11:38:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:39,837 INFO L93 Difference]: Finished difference Result 86148 states and 336751 transitions. [2019-12-07 11:38:39,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:38:39,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:38:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:40,021 INFO L225 Difference]: With dead ends: 86148 [2019-12-07 11:38:40,021 INFO L226 Difference]: Without dead ends: 86120 [2019-12-07 11:38:40,021 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 11:38:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86120 states. [2019-12-07 11:38:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86120 to 77624. [2019-12-07 11:38:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77624 states. [2019-12-07 11:38:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77624 states to 77624 states and 306129 transitions. [2019-12-07 11:38:43,459 INFO L78 Accepts]: Start accepts. Automaton has 77624 states and 306129 transitions. Word has length 16 [2019-12-07 11:38:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:43,459 INFO L462 AbstractCegarLoop]: Abstraction has 77624 states and 306129 transitions. [2019-12-07 11:38:43,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 77624 states and 306129 transitions. [2019-12-07 11:38:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:38:43,466 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:43,466 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 11:38:43,466 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 11:38:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1845190065, now seen corresponding path program 1 times [2019-12-07 11:38:43,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:43,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674012] [2019-12-07 11:38:43,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:43,529 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 11:38:43,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674012] [2019-12-07 11:38:43,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:43,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:38:43,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095254583] [2019-12-07 11:38:43,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:43,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:43,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:43,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:43,531 INFO L87 Difference]: Start difference. First operand 77624 states and 306129 transitions. Second operand 3 states. [2019-12-07 11:38:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:43,940 INFO L93 Difference]: Finished difference Result 115733 states and 434320 transitions. [2019-12-07 11:38:43,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:43,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:38:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:44,194 INFO L225 Difference]: With dead ends: 115733 [2019-12-07 11:38:44,194 INFO L226 Difference]: Without dead ends: 115154 [2019-12-07 11:38:44,194 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 11:38:45,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115154 states. [2019-12-07 11:38:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115154 to 111996. [2019-12-07 11:38:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111996 states. [2019-12-07 11:38:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111996 states to 111996 states and 424493 transitions. [2019-12-07 11:38:47,071 INFO L78 Accepts]: Start accepts. Automaton has 111996 states and 424493 transitions. Word has length 18 [2019-12-07 11:38:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:47,071 INFO L462 AbstractCegarLoop]: Abstraction has 111996 states and 424493 transitions. [2019-12-07 11:38:47,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:47,071 INFO L276 IsEmpty]: Start isEmpty. Operand 111996 states and 424493 transitions. [2019-12-07 11:38:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:38:47,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:47,081 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 11:38:47,081 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 11:38:47,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:47,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1245259920, now seen corresponding path program 1 times [2019-12-07 11:38:47,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:47,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525422338] [2019-12-07 11:38:47,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:47,113 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 11:38:47,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525422338] [2019-12-07 11:38:47,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:47,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:47,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992116413] [2019-12-07 11:38:47,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:47,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:47,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:47,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:47,115 INFO L87 Difference]: Start difference. First operand 111996 states and 424493 transitions. Second operand 3 states. [2019-12-07 11:38:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:47,507 INFO L93 Difference]: Finished difference Result 105832 states and 395857 transitions. [2019-12-07 11:38:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:47,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:38:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:47,996 INFO L225 Difference]: With dead ends: 105832 [2019-12-07 11:38:47,997 INFO L226 Difference]: Without dead ends: 105832 [2019-12-07 11:38:47,997 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 11:38:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105832 states. [2019-12-07 11:38:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105832 to 105508. [2019-12-07 11:38:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105508 states. [2019-12-07 11:38:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105508 states to 105508 states and 394901 transitions. [2019-12-07 11:38:50,275 INFO L78 Accepts]: Start accepts. Automaton has 105508 states and 394901 transitions. Word has length 19 [2019-12-07 11:38:50,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:50,275 INFO L462 AbstractCegarLoop]: Abstraction has 105508 states and 394901 transitions. [2019-12-07 11:38:50,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 105508 states and 394901 transitions. [2019-12-07 11:38:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:38:50,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:50,283 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 11:38:50,283 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 11:38:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:50,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1181742338, now seen corresponding path program 1 times [2019-12-07 11:38:50,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:50,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143444154] [2019-12-07 11:38:50,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:50,326 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 11:38:50,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143444154] [2019-12-07 11:38:50,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:50,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:38:50,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131940109] [2019-12-07 11:38:50,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:50,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:50,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:50,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:50,328 INFO L87 Difference]: Start difference. First operand 105508 states and 394901 transitions. Second operand 3 states. [2019-12-07 11:38:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:50,902 INFO L93 Difference]: Finished difference Result 101284 states and 377799 transitions. [2019-12-07 11:38:50,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:50,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:38:50,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:51,117 INFO L225 Difference]: With dead ends: 101284 [2019-12-07 11:38:51,117 INFO L226 Difference]: Without dead ends: 101284 [2019-12-07 11:38:51,117 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 11:38:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101284 states. [2019-12-07 11:38:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101284 to 78669. [2019-12-07 11:38:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78669 states. [2019-12-07 11:38:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78669 states to 78669 states and 298662 transitions. [2019-12-07 11:38:53,176 INFO L78 Accepts]: Start accepts. Automaton has 78669 states and 298662 transitions. Word has length 19 [2019-12-07 11:38:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:53,176 INFO L462 AbstractCegarLoop]: Abstraction has 78669 states and 298662 transitions. [2019-12-07 11:38:53,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 78669 states and 298662 transitions. [2019-12-07 11:38:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:38:53,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:53,186 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 11:38:53,187 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 11:38:53,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1737177277, now seen corresponding path program 1 times [2019-12-07 11:38:53,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:53,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670658963] [2019-12-07 11:38:53,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:53,230 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 11:38:53,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670658963] [2019-12-07 11:38:53,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:53,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:38:53,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794896442] [2019-12-07 11:38:53,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:38:53,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:53,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:38:53,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:38:53,232 INFO L87 Difference]: Start difference. First operand 78669 states and 298662 transitions. Second operand 5 states. [2019-12-07 11:38:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:54,021 INFO L93 Difference]: Finished difference Result 94639 states and 354301 transitions. [2019-12-07 11:38:54,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:38:54,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 11:38:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:54,213 INFO L225 Difference]: With dead ends: 94639 [2019-12-07 11:38:54,213 INFO L226 Difference]: Without dead ends: 94587 [2019-12-07 11:38:54,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 11:38:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94587 states. [2019-12-07 11:38:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94587 to 78229. [2019-12-07 11:38:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78229 states. [2019-12-07 11:38:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78229 states to 78229 states and 297082 transitions. [2019-12-07 11:38:56,237 INFO L78 Accepts]: Start accepts. Automaton has 78229 states and 297082 transitions. Word has length 22 [2019-12-07 11:38:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:56,237 INFO L462 AbstractCegarLoop]: Abstraction has 78229 states and 297082 transitions. [2019-12-07 11:38:56,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:38:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 78229 states and 297082 transitions. [2019-12-07 11:38:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:38:56,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:56,301 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 11:38:56,301 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 11:38:56,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:56,301 INFO L82 PathProgramCache]: Analyzing trace with hash 96247345, now seen corresponding path program 1 times [2019-12-07 11:38:56,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:56,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449924206] [2019-12-07 11:38:56,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:56,334 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 11:38:56,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449924206] [2019-12-07 11:38:56,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:56,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:56,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470778873] [2019-12-07 11:38:56,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:56,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:56,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:56,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:56,336 INFO L87 Difference]: Start difference. First operand 78229 states and 297082 transitions. Second operand 3 states. [2019-12-07 11:38:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:56,481 INFO L93 Difference]: Finished difference Result 45514 states and 153165 transitions. [2019-12-07 11:38:56,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:56,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 11:38:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:56,549 INFO L225 Difference]: With dead ends: 45514 [2019-12-07 11:38:56,550 INFO L226 Difference]: Without dead ends: 45514 [2019-12-07 11:38:56,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:38:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45514 states. [2019-12-07 11:38:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45514 to 45514. [2019-12-07 11:38:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45514 states. [2019-12-07 11:38:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45514 states to 45514 states and 153165 transitions. [2019-12-07 11:38:57,605 INFO L78 Accepts]: Start accepts. Automaton has 45514 states and 153165 transitions. Word has length 33 [2019-12-07 11:38:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:57,605 INFO L462 AbstractCegarLoop]: Abstraction has 45514 states and 153165 transitions. [2019-12-07 11:38:57,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 45514 states and 153165 transitions. [2019-12-07 11:38:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:38:57,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:57,631 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 11:38:57,631 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 11:38:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2068440986, now seen corresponding path program 1 times [2019-12-07 11:38:57,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:57,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146775176] [2019-12-07 11:38:57,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:57,689 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 11:38:57,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146775176] [2019-12-07 11:38:57,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:57,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:38:57,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937089085] [2019-12-07 11:38:57,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:57,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:57,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:57,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:57,691 INFO L87 Difference]: Start difference. First operand 45514 states and 153165 transitions. Second operand 4 states. [2019-12-07 11:38:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:57,924 INFO L93 Difference]: Finished difference Result 77995 states and 263526 transitions. [2019-12-07 11:38:57,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:38:57,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 11:38:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:57,982 INFO L225 Difference]: With dead ends: 77995 [2019-12-07 11:38:57,982 INFO L226 Difference]: Without dead ends: 37982 [2019-12-07 11:38:57,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 11:38:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37982 states. [2019-12-07 11:38:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37982 to 37753. [2019-12-07 11:38:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37753 states. [2019-12-07 11:38:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37753 states to 37753 states and 124698 transitions. [2019-12-07 11:38:58,808 INFO L78 Accepts]: Start accepts. Automaton has 37753 states and 124698 transitions. Word has length 34 [2019-12-07 11:38:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:58,809 INFO L462 AbstractCegarLoop]: Abstraction has 37753 states and 124698 transitions. [2019-12-07 11:38:58,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 37753 states and 124698 transitions. [2019-12-07 11:38:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 11:38:58,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:58,831 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 11:38:58,831 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 11:38:58,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:58,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1654505029, now seen corresponding path program 1 times [2019-12-07 11:38:58,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:58,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211434002] [2019-12-07 11:38:58,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:58,865 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 11:38:58,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211434002] [2019-12-07 11:38:58,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:58,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:38:58,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303027806] [2019-12-07 11:38:58,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:58,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:58,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:58,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:58,867 INFO L87 Difference]: Start difference. First operand 37753 states and 124698 transitions. Second operand 4 states. [2019-12-07 11:38:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:58,893 INFO L93 Difference]: Finished difference Result 5743 states and 14204 transitions. [2019-12-07 11:38:58,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:38:58,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 11:38:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:58,899 INFO L225 Difference]: With dead ends: 5743 [2019-12-07 11:38:58,899 INFO L226 Difference]: Without dead ends: 5743 [2019-12-07 11:38:58,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 11:38:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5743 states. [2019-12-07 11:38:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5743 to 5733. [2019-12-07 11:38:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5733 states. [2019-12-07 11:38:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5733 states to 5733 states and 14186 transitions. [2019-12-07 11:38:58,957 INFO L78 Accepts]: Start accepts. Automaton has 5733 states and 14186 transitions. Word has length 35 [2019-12-07 11:38:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:58,957 INFO L462 AbstractCegarLoop]: Abstraction has 5733 states and 14186 transitions. [2019-12-07 11:38:58,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 5733 states and 14186 transitions. [2019-12-07 11:38:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 11:38:58,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:58,961 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] [2019-12-07 11:38:58,962 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 11:38:58,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:58,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1666574598, now seen corresponding path program 1 times [2019-12-07 11:38:58,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:58,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654494152] [2019-12-07 11:38:58,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:59,020 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 11:38:59,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654494152] [2019-12-07 11:38:59,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:59,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:38:59,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837487875] [2019-12-07 11:38:59,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:59,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:59,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:59,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:59,021 INFO L87 Difference]: Start difference. First operand 5733 states and 14186 transitions. Second operand 4 states. [2019-12-07 11:38:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:59,169 INFO L93 Difference]: Finished difference Result 6545 states and 15953 transitions. [2019-12-07 11:38:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:38:59,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-07 11:38:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:59,174 INFO L225 Difference]: With dead ends: 6545 [2019-12-07 11:38:59,175 INFO L226 Difference]: Without dead ends: 6545 [2019-12-07 11:38:59,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 11:38:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6545 states. [2019-12-07 11:38:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6545 to 6453. [2019-12-07 11:38:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6453 states. [2019-12-07 11:38:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6453 states to 6453 states and 15749 transitions. [2019-12-07 11:38:59,238 INFO L78 Accepts]: Start accepts. Automaton has 6453 states and 15749 transitions. Word has length 46 [2019-12-07 11:38:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:59,239 INFO L462 AbstractCegarLoop]: Abstraction has 6453 states and 15749 transitions. [2019-12-07 11:38:59,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 6453 states and 15749 transitions. [2019-12-07 11:38:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 11:38:59,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:59,243 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 11:38:59,243 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 11:38:59,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:59,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1651929709, now seen corresponding path program 1 times [2019-12-07 11:38:59,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:59,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243805069] [2019-12-07 11:38:59,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:59,285 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 11:38:59,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243805069] [2019-12-07 11:38:59,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:59,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:38:59,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487512674] [2019-12-07 11:38:59,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:38:59,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:59,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:38:59,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:38:59,286 INFO L87 Difference]: Start difference. First operand 6453 states and 15749 transitions. Second operand 5 states. [2019-12-07 11:38:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:59,309 INFO L93 Difference]: Finished difference Result 4882 states and 12169 transitions. [2019-12-07 11:38:59,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:38:59,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 11:38:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:59,311 INFO L225 Difference]: With dead ends: 4882 [2019-12-07 11:38:59,311 INFO L226 Difference]: Without dead ends: 2500 [2019-12-07 11:38:59,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:38:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2019-12-07 11:38:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2490. [2019-12-07 11:38:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2490 states. [2019-12-07 11:38:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 6161 transitions. [2019-12-07 11:38:59,334 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 6161 transitions. Word has length 47 [2019-12-07 11:38:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:59,334 INFO L462 AbstractCegarLoop]: Abstraction has 2490 states and 6161 transitions. [2019-12-07 11:38:59,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:38:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 6161 transitions. [2019-12-07 11:38:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:38:59,336 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:59,336 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 11:38:59,336 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 11:38:59,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash 157005811, now seen corresponding path program 1 times [2019-12-07 11:38:59,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:59,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479823919] [2019-12-07 11:38:59,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:59,391 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 11:38:59,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479823919] [2019-12-07 11:38:59,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:59,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:38:59,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986235579] [2019-12-07 11:38:59,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:38:59,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:38:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:38:59,392 INFO L87 Difference]: Start difference. First operand 2490 states and 6161 transitions. Second operand 6 states. [2019-12-07 11:38:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:59,490 INFO L93 Difference]: Finished difference Result 4470 states and 11140 transitions. [2019-12-07 11:38:59,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:38:59,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 11:38:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:59,493 INFO L225 Difference]: With dead ends: 4470 [2019-12-07 11:38:59,493 INFO L226 Difference]: Without dead ends: 3974 [2019-12-07 11:38:59,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:38:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2019-12-07 11:38:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3464. [2019-12-07 11:38:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2019-12-07 11:38:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 8783 transitions. [2019-12-07 11:38:59,533 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 8783 transitions. Word has length 62 [2019-12-07 11:38:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:59,533 INFO L462 AbstractCegarLoop]: Abstraction has 3464 states and 8783 transitions. [2019-12-07 11:38:59,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:38:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 8783 transitions. [2019-12-07 11:38:59,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:38:59,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:59,537 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 11:38:59,537 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 11:38:59,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:59,537 INFO L82 PathProgramCache]: Analyzing trace with hash -793933157, now seen corresponding path program 2 times [2019-12-07 11:38:59,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:59,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560343489] [2019-12-07 11:38:59,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:59,597 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 11:38:59,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560343489] [2019-12-07 11:38:59,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:59,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:38:59,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232185983] [2019-12-07 11:38:59,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:59,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:59,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:59,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:59,598 INFO L87 Difference]: Start difference. First operand 3464 states and 8783 transitions. Second operand 4 states. [2019-12-07 11:38:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:59,634 INFO L93 Difference]: Finished difference Result 3912 states and 9811 transitions. [2019-12-07 11:38:59,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:38:59,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 11:38:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:59,637 INFO L225 Difference]: With dead ends: 3912 [2019-12-07 11:38:59,637 INFO L226 Difference]: Without dead ends: 2719 [2019-12-07 11:38:59,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:38:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2019-12-07 11:38:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2321. [2019-12-07 11:38:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-12-07 11:38:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 5635 transitions. [2019-12-07 11:38:59,661 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 5635 transitions. Word has length 62 [2019-12-07 11:38:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:59,661 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 5635 transitions. [2019-12-07 11:38:59,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 5635 transitions. [2019-12-07 11:38:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:38:59,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:59,663 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 11:38:59,663 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 11:38:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1971015750, now seen corresponding path program 1 times [2019-12-07 11:38:59,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:38:59,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845360592] [2019-12-07 11:38:59,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:59,809 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 11:38:59,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845360592] [2019-12-07 11:38:59,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:59,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:38:59,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51168909] [2019-12-07 11:38:59,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:38:59,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:38:59,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:38:59,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:38:59,811 INFO L87 Difference]: Start difference. First operand 2321 states and 5635 transitions. Second operand 11 states. [2019-12-07 11:39:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:00,328 INFO L93 Difference]: Finished difference Result 5466 states and 13154 transitions. [2019-12-07 11:39:00,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:39:00,329 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-12-07 11:39:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:00,333 INFO L225 Difference]: With dead ends: 5466 [2019-12-07 11:39:00,333 INFO L226 Difference]: Without dead ends: 4195 [2019-12-07 11:39:00,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:39:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-12-07 11:39:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 3157. [2019-12-07 11:39:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3157 states. [2019-12-07 11:39:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 7753 transitions. [2019-12-07 11:39:00,365 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 7753 transitions. Word has length 63 [2019-12-07 11:39:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:00,365 INFO L462 AbstractCegarLoop]: Abstraction has 3157 states and 7753 transitions. [2019-12-07 11:39:00,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:39:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 7753 transitions. [2019-12-07 11:39:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:39:00,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:00,367 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 11:39:00,367 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 11:39:00,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:00,367 INFO L82 PathProgramCache]: Analyzing trace with hash 78017404, now seen corresponding path program 2 times [2019-12-07 11:39:00,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:39:00,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605705941] [2019-12-07 11:39:00,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:00,520 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 11:39:00,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605705941] [2019-12-07 11:39:00,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:00,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:39:00,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721888150] [2019-12-07 11:39:00,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:39:00,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:39:00,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:39:00,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:39:00,521 INFO L87 Difference]: Start difference. First operand 3157 states and 7753 transitions. Second operand 12 states. [2019-12-07 11:39:02,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:02,472 INFO L93 Difference]: Finished difference Result 5820 states and 14156 transitions. [2019-12-07 11:39:02,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 11:39:02,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-07 11:39:02,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:02,476 INFO L225 Difference]: With dead ends: 5820 [2019-12-07 11:39:02,476 INFO L226 Difference]: Without dead ends: 5318 [2019-12-07 11:39:02,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:39:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2019-12-07 11:39:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 4563. [2019-12-07 11:39:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4563 states. [2019-12-07 11:39:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 11376 transitions. [2019-12-07 11:39:02,524 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 11376 transitions. Word has length 63 [2019-12-07 11:39:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:02,525 INFO L462 AbstractCegarLoop]: Abstraction has 4563 states and 11376 transitions. [2019-12-07 11:39:02,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:39:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 11376 transitions. [2019-12-07 11:39:02,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:39:02,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:02,528 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 11:39:02,528 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 11:39:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:02,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1479252612, now seen corresponding path program 3 times [2019-12-07 11:39:02,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:39:02,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897552515] [2019-12-07 11:39:02,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:39:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:39:02,630 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:39:02,631 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:39:02,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~y$r_buff1_thd2~0_356) (= (select .cse0 |v_ULTIMATE.start_main_~#t518~0.base_24|) 0) (= v_~y$r_buff0_thd0~0_194 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t518~0.base_24|) (= v_~y$r_buff1_thd1~0_192 0) (= v_~y$w_buff1_used~0_559 0) (= v_~y$r_buff0_thd1~0_121 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_350) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t518~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t518~0.base_24|) |v_ULTIMATE.start_main_~#t518~0.offset_17| 0)) |v_#memory_int_15|) (= v_~y~0_367 0) (= v_~main$tmp_guard1~0_26 0) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$w_buff1~0_262 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_244 0) (= 0 v_~__unbuffered_p1_EAX~0_43) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t518~0.base_24| 4)) (= v_~y$mem_tmp~0_237 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~__unbuffered_p2_EAX~0_29) (= 0 v_~y$r_buff0_thd2~0_368) (= v_~y$w_buff0_used~0_898 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~weak$$choice0~0_225) (= v_~y$flush_delayed~0_303 0) (= v_~z~0_25 0) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t518~0.offset_17| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~x~0_65 0) (= v_~weak$$choice2~0_304 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t518~0.base_24| 1)) (= v_~__unbuffered_cnt~0_157 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$r_buff0_thd3~0_578))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_19|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t518~0.base=|v_ULTIMATE.start_main_~#t518~0.base_24|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_237, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_350, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_121, ~y$flush_delayed~0=v_~y$flush_delayed~0_303, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ULTIMATE.start_main_~#t519~0.offset=|v_ULTIMATE.start_main_~#t519~0.offset_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_91|, ULTIMATE.start_main_~#t520~0.offset=|v_ULTIMATE.start_main_~#t520~0.offset_17|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~weak$$choice0~0=v_~weak$$choice0~0_225, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_203|, ~y$w_buff1~0=v_~y$w_buff1~0_262, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_368, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_244, ~x~0=v_~x~0_65, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_898, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t518~0.offset=|v_ULTIMATE.start_main_~#t518~0.offset_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_~#t520~0.base=|v_ULTIMATE.start_main_~#t520~0.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_192, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_578, ~y~0=v_~y~0_367, ULTIMATE.start_main_~#t519~0.base=|v_ULTIMATE.start_main_~#t519~0.base_23|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_151|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_356, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_209|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_194, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_304, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t518~0.base, ~y$read_delayed~0, ~y$mem_tmp~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_~#t519~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t520~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__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_~#t518~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t520~0.base, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t519~0.base, 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 11:39:02,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L828-1-->L830: Formula: (and (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t519~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t519~0.base_12|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t519~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t519~0.base_12|) |v_ULTIMATE.start_main_~#t519~0.offset_10| 1)) |v_#memory_int_7|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t519~0.base_12| 1) |v_#valid_34|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t519~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t519~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t519~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t519~0.base=|v_ULTIMATE.start_main_~#t519~0.base_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t519~0.offset=|v_ULTIMATE.start_main_~#t519~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t519~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t519~0.offset] because there is no mapped edge [2019-12-07 11:39:02,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L830-1-->L832: Formula: (and (not (= |v_ULTIMATE.start_main_~#t520~0.base_13| 0)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t520~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t520~0.base_13|) (= |v_ULTIMATE.start_main_~#t520~0.offset_11| 0) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t520~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t520~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t520~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t520~0.base_13|) |v_ULTIMATE.start_main_~#t520~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t520~0.offset=|v_ULTIMATE.start_main_~#t520~0.offset_11|, ULTIMATE.start_main_~#t520~0.base=|v_ULTIMATE.start_main_~#t520~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t520~0.offset, ULTIMATE.start_main_~#t520~0.base] because there is no mapped edge [2019-12-07 11:39:02,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork2_#in~arg.base_15| v_P2Thread1of1ForFork2_~arg.base_13) (= 1 v_~y$w_buff0~0_40) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_110 1) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_63 256) 0)) (not (= (mod v_~y$w_buff0_used~0_110 256) 0)))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15)) (= v_P2Thread1of1ForFork2_~arg.offset_13 |v_P2Thread1of1ForFork2_#in~arg.offset_15|) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_111)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_29, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_13, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_13, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:39:02,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L790-2-->L790-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1801844297 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1801844297 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite29_Out1801844297| |P2Thread1of1ForFork2_#t~ite28_Out1801844297|))) (or (and (or .cse0 .cse1) (= ~y$w_buff1~0_In1801844297 |P2Thread1of1ForFork2_#t~ite28_Out1801844297|) .cse2) (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In1801844297 |P2Thread1of1ForFork2_#t~ite28_Out1801844297|) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1801844297, ~y$w_buff1~0=~y$w_buff1~0_In1801844297, ~y$w_buff0~0=~y$w_buff0~0_In1801844297, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1801844297} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1801844297, ~y$w_buff1~0=~y$w_buff1~0_In1801844297, ~y$w_buff0~0=~y$w_buff0~0_In1801844297, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1801844297, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1801844297|, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1801844297|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 11:39:02,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L795-->L796: Formula: (and (= v_~y$r_buff0_thd3~0_209 v_~y$r_buff0_thd3~0_210) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_210, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork2_#t~ite42=|v_P2Thread1of1ForFork2_#t~ite42_6|, P2Thread1of1ForFork2_#t~ite44=|v_P2Thread1of1ForFork2_#t~ite44_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_209, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42, P2Thread1of1ForFork2_#t~ite44, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 11:39:02,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-714182437 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite48_Out-714182437| ~y$mem_tmp~0_In-714182437)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite48_Out-714182437| ~y~0_In-714182437)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-714182437, ~y$flush_delayed~0=~y$flush_delayed~0_In-714182437, ~y~0=~y~0_In-714182437} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-714182437, P2Thread1of1ForFork2_#t~ite48=|P2Thread1of1ForFork2_#t~ite48_Out-714182437|, ~y$flush_delayed~0=~y$flush_delayed~0_In-714182437, ~y~0=~y~0_In-714182437} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 11:39:02,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_7|) (= v_P0Thread1of1ForFork0_~arg.offset_9 |v_P0Thread1of1ForFork0_#in~arg.offset_11|) (= v_~z~0_17 1) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_138 (+ v_~__unbuffered_cnt~0_139 1)) (= v_P0Thread1of1ForFork0_~arg.base_9 |v_P0Thread1of1ForFork0_#in~arg.base_11|) (= v_~x~0_49 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ~z~0=v_~z~0_17, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_9, ~x~0=v_~x~0_49, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:39:02,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1636892665 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1636892665 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite51_Out-1636892665|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite51_Out-1636892665| ~y$w_buff0_used~0_In-1636892665)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1636892665, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1636892665} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1636892665, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1636892665, P2Thread1of1ForFork2_#t~ite51=|P2Thread1of1ForFork2_#t~ite51_Out-1636892665|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 11:39:02,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In1775606410 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1775606410 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1775606410 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1775606410 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite52_Out1775606410| 0)) (and (= |P2Thread1of1ForFork2_#t~ite52_Out1775606410| ~y$w_buff1_used~0_In1775606410) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1775606410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1775606410, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1775606410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1775606410} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1775606410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1775606410, P2Thread1of1ForFork2_#t~ite52=|P2Thread1of1ForFork2_#t~ite52_Out1775606410|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1775606410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1775606410} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 11:39:02,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L808-->L809: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In678373766 ~y$r_buff0_thd3~0_Out678373766)) (.cse2 (= (mod ~y$w_buff0_used~0_In678373766 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In678373766 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (= 0 ~y$r_buff0_thd3~0_Out678373766) (not .cse2) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In678373766, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In678373766} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In678373766, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out678373766, P2Thread1of1ForFork2_#t~ite53=|P2Thread1of1ForFork2_#t~ite53_Out678373766|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite53] because there is no mapped edge [2019-12-07 11:39:02,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In277244196 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In277244196 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In277244196 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In277244196 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In277244196 |P2Thread1of1ForFork2_#t~ite54_Out277244196|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite54_Out277244196|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In277244196, ~y$w_buff0_used~0=~y$w_buff0_used~0_In277244196, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In277244196, ~y$w_buff1_used~0=~y$w_buff1_used~0_In277244196} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In277244196, P2Thread1of1ForFork2_#t~ite54=|P2Thread1of1ForFork2_#t~ite54_Out277244196|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In277244196, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In277244196, ~y$w_buff1_used~0=~y$w_buff1_used~0_In277244196} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 11:39:02,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L809-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_124 (+ v_~__unbuffered_cnt~0_125 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite54_32| v_~y$r_buff1_thd3~0_249)) InVars {P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_249, P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite54, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:39:02,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1622539081 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite25_Out1622539081| ~y$mem_tmp~0_In1622539081) (not .cse0)) (and (= ~y~0_In1622539081 |P1Thread1of1ForFork1_#t~ite25_Out1622539081|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1622539081, ~y$flush_delayed~0=~y$flush_delayed~0_In1622539081, ~y~0=~y~0_In1622539081} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1622539081, ~y$flush_delayed~0=~y$flush_delayed~0_In1622539081, ~y~0=~y~0_In1622539081, P1Thread1of1ForFork1_#t~ite25=|P1Thread1of1ForFork1_#t~ite25_Out1622539081|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:39:02,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L761-2-->P1EXIT: Formula: (and (= v_~y~0_274 |v_P1Thread1of1ForFork1_#t~ite25_116|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$flush_delayed~0_269 0) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_148 (+ v_~__unbuffered_cnt~0_149 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_116|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~y~0=v_~y~0_274, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_115|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:39:02,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L832-1-->L838: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_11 256))) (= v_~main$tmp_guard0~0_11 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_70) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:39:02,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L838-2-->L838-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1254504010 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1254504010 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1254504010 |ULTIMATE.start_main_#t~ite58_Out1254504010|)) (and (or .cse1 .cse0) (= ~y~0_In1254504010 |ULTIMATE.start_main_#t~ite58_Out1254504010|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1254504010, ~y~0=~y~0_In1254504010, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1254504010, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1254504010} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1254504010, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1254504010|, ~y~0=~y~0_In1254504010, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1254504010, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1254504010} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58] because there is no mapped edge [2019-12-07 11:39:02,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L838-4-->L839: Formula: (= v_~y~0_42 |v_ULTIMATE.start_main_#t~ite58_10|) InVars {ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_9|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_15|, ~y~0=v_~y~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59, ~y~0] because there is no mapped edge [2019-12-07 11:39:02,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1200690529 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1200690529 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1200690529 |ULTIMATE.start_main_#t~ite60_Out-1200690529|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out-1200690529| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1200690529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1200690529} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1200690529|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1200690529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1200690529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 11:39:02,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L840-->L840-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-97358068 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-97358068 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-97358068 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-97358068 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-97358068|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-97358068 |ULTIMATE.start_main_#t~ite61_Out-97358068|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-97358068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-97358068, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-97358068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97358068} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-97358068|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97358068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-97358068, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-97358068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97358068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:39:02,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1441085409 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1441085409 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1441085409|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-1441085409 |ULTIMATE.start_main_#t~ite62_Out-1441085409|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1441085409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1441085409} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1441085409|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1441085409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1441085409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:39:02,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In911609522 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In911609522 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In911609522 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In911609522 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out911609522|)) (and (= ~y$r_buff1_thd0~0_In911609522 |ULTIMATE.start_main_#t~ite63_Out911609522|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In911609522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In911609522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In911609522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In911609522} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out911609522|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In911609522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In911609522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In911609522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In911609522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:39:02,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_59 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~y$r_buff1_thd0~0_234 |v_ULTIMATE.start_main_#t~ite63_45|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_44|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_234, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 11:39:02,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:39:02 BasicIcfg [2019-12-07 11:39:02,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:39:02,718 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:39:02,718 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:39:02,718 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:39:02,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:38:26" (3/4) ... [2019-12-07 11:39:02,720 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:39:02,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~y$r_buff1_thd2~0_356) (= (select .cse0 |v_ULTIMATE.start_main_~#t518~0.base_24|) 0) (= v_~y$r_buff0_thd0~0_194 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t518~0.base_24|) (= v_~y$r_buff1_thd1~0_192 0) (= v_~y$w_buff1_used~0_559 0) (= v_~y$r_buff0_thd1~0_121 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_350) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t518~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t518~0.base_24|) |v_ULTIMATE.start_main_~#t518~0.offset_17| 0)) |v_#memory_int_15|) (= v_~y~0_367 0) (= v_~main$tmp_guard1~0_26 0) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$w_buff1~0_262 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_244 0) (= 0 v_~__unbuffered_p1_EAX~0_43) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t518~0.base_24| 4)) (= v_~y$mem_tmp~0_237 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~__unbuffered_p2_EAX~0_29) (= 0 v_~y$r_buff0_thd2~0_368) (= v_~y$w_buff0_used~0_898 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~weak$$choice0~0_225) (= v_~y$flush_delayed~0_303 0) (= v_~z~0_25 0) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t518~0.offset_17| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~x~0_65 0) (= v_~weak$$choice2~0_304 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t518~0.base_24| 1)) (= v_~__unbuffered_cnt~0_157 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$r_buff0_thd3~0_578))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_19|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t518~0.base=|v_ULTIMATE.start_main_~#t518~0.base_24|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_237, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_350, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_121, ~y$flush_delayed~0=v_~y$flush_delayed~0_303, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ULTIMATE.start_main_~#t519~0.offset=|v_ULTIMATE.start_main_~#t519~0.offset_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_91|, ULTIMATE.start_main_~#t520~0.offset=|v_ULTIMATE.start_main_~#t520~0.offset_17|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~weak$$choice0~0=v_~weak$$choice0~0_225, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_203|, ~y$w_buff1~0=v_~y$w_buff1~0_262, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_368, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_244, ~x~0=v_~x~0_65, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_898, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t518~0.offset=|v_ULTIMATE.start_main_~#t518~0.offset_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_~#t520~0.base=|v_ULTIMATE.start_main_~#t520~0.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_192, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_578, ~y~0=v_~y~0_367, ULTIMATE.start_main_~#t519~0.base=|v_ULTIMATE.start_main_~#t519~0.base_23|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_151|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_356, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_209|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_194, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_304, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t518~0.base, ~y$read_delayed~0, ~y$mem_tmp~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_~#t519~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t520~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__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_~#t518~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t520~0.base, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t519~0.base, 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 11:39:02,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L828-1-->L830: Formula: (and (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t519~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t519~0.base_12|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t519~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t519~0.base_12|) |v_ULTIMATE.start_main_~#t519~0.offset_10| 1)) |v_#memory_int_7|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t519~0.base_12| 1) |v_#valid_34|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t519~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t519~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t519~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t519~0.base=|v_ULTIMATE.start_main_~#t519~0.base_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t519~0.offset=|v_ULTIMATE.start_main_~#t519~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t519~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t519~0.offset] because there is no mapped edge [2019-12-07 11:39:02,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L830-1-->L832: Formula: (and (not (= |v_ULTIMATE.start_main_~#t520~0.base_13| 0)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t520~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t520~0.base_13|) (= |v_ULTIMATE.start_main_~#t520~0.offset_11| 0) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t520~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t520~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t520~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t520~0.base_13|) |v_ULTIMATE.start_main_~#t520~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t520~0.offset=|v_ULTIMATE.start_main_~#t520~0.offset_11|, ULTIMATE.start_main_~#t520~0.base=|v_ULTIMATE.start_main_~#t520~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t520~0.offset, ULTIMATE.start_main_~#t520~0.base] because there is no mapped edge [2019-12-07 11:39:02,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork2_#in~arg.base_15| v_P2Thread1of1ForFork2_~arg.base_13) (= 1 v_~y$w_buff0~0_40) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_110 1) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_63 256) 0)) (not (= (mod v_~y$w_buff0_used~0_110 256) 0)))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15)) (= v_P2Thread1of1ForFork2_~arg.offset_13 |v_P2Thread1of1ForFork2_#in~arg.offset_15|) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_111)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_29, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_13, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_13, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:39:02,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L790-2-->L790-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1801844297 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1801844297 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite29_Out1801844297| |P2Thread1of1ForFork2_#t~ite28_Out1801844297|))) (or (and (or .cse0 .cse1) (= ~y$w_buff1~0_In1801844297 |P2Thread1of1ForFork2_#t~ite28_Out1801844297|) .cse2) (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In1801844297 |P2Thread1of1ForFork2_#t~ite28_Out1801844297|) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1801844297, ~y$w_buff1~0=~y$w_buff1~0_In1801844297, ~y$w_buff0~0=~y$w_buff0~0_In1801844297, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1801844297} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1801844297, ~y$w_buff1~0=~y$w_buff1~0_In1801844297, ~y$w_buff0~0=~y$w_buff0~0_In1801844297, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1801844297, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1801844297|, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1801844297|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 11:39:02,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L795-->L796: Formula: (and (= v_~y$r_buff0_thd3~0_209 v_~y$r_buff0_thd3~0_210) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_210, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork2_#t~ite42=|v_P2Thread1of1ForFork2_#t~ite42_6|, P2Thread1of1ForFork2_#t~ite44=|v_P2Thread1of1ForFork2_#t~ite44_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_209, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42, P2Thread1of1ForFork2_#t~ite44, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 11:39:02,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-714182437 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite48_Out-714182437| ~y$mem_tmp~0_In-714182437)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite48_Out-714182437| ~y~0_In-714182437)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-714182437, ~y$flush_delayed~0=~y$flush_delayed~0_In-714182437, ~y~0=~y~0_In-714182437} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-714182437, P2Thread1of1ForFork2_#t~ite48=|P2Thread1of1ForFork2_#t~ite48_Out-714182437|, ~y$flush_delayed~0=~y$flush_delayed~0_In-714182437, ~y~0=~y~0_In-714182437} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 11:39:02,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_7|) (= v_P0Thread1of1ForFork0_~arg.offset_9 |v_P0Thread1of1ForFork0_#in~arg.offset_11|) (= v_~z~0_17 1) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_138 (+ v_~__unbuffered_cnt~0_139 1)) (= v_P0Thread1of1ForFork0_~arg.base_9 |v_P0Thread1of1ForFork0_#in~arg.base_11|) (= v_~x~0_49 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ~z~0=v_~z~0_17, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_9, ~x~0=v_~x~0_49, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:39:02,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1636892665 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1636892665 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite51_Out-1636892665|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite51_Out-1636892665| ~y$w_buff0_used~0_In-1636892665)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1636892665, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1636892665} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1636892665, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1636892665, P2Thread1of1ForFork2_#t~ite51=|P2Thread1of1ForFork2_#t~ite51_Out-1636892665|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 11:39:02,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In1775606410 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1775606410 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1775606410 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1775606410 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite52_Out1775606410| 0)) (and (= |P2Thread1of1ForFork2_#t~ite52_Out1775606410| ~y$w_buff1_used~0_In1775606410) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1775606410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1775606410, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1775606410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1775606410} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1775606410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1775606410, P2Thread1of1ForFork2_#t~ite52=|P2Thread1of1ForFork2_#t~ite52_Out1775606410|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1775606410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1775606410} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 11:39:02,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L808-->L809: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In678373766 ~y$r_buff0_thd3~0_Out678373766)) (.cse2 (= (mod ~y$w_buff0_used~0_In678373766 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In678373766 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (= 0 ~y$r_buff0_thd3~0_Out678373766) (not .cse2) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In678373766, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In678373766} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In678373766, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out678373766, P2Thread1of1ForFork2_#t~ite53=|P2Thread1of1ForFork2_#t~ite53_Out678373766|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite53] because there is no mapped edge [2019-12-07 11:39:02,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In277244196 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In277244196 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In277244196 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In277244196 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In277244196 |P2Thread1of1ForFork2_#t~ite54_Out277244196|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite54_Out277244196|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In277244196, ~y$w_buff0_used~0=~y$w_buff0_used~0_In277244196, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In277244196, ~y$w_buff1_used~0=~y$w_buff1_used~0_In277244196} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In277244196, P2Thread1of1ForFork2_#t~ite54=|P2Thread1of1ForFork2_#t~ite54_Out277244196|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In277244196, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In277244196, ~y$w_buff1_used~0=~y$w_buff1_used~0_In277244196} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 11:39:02,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L809-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_124 (+ v_~__unbuffered_cnt~0_125 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite54_32| v_~y$r_buff1_thd3~0_249)) InVars {P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_249, P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite54, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:39:02,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1622539081 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite25_Out1622539081| ~y$mem_tmp~0_In1622539081) (not .cse0)) (and (= ~y~0_In1622539081 |P1Thread1of1ForFork1_#t~ite25_Out1622539081|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1622539081, ~y$flush_delayed~0=~y$flush_delayed~0_In1622539081, ~y~0=~y~0_In1622539081} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1622539081, ~y$flush_delayed~0=~y$flush_delayed~0_In1622539081, ~y~0=~y~0_In1622539081, P1Thread1of1ForFork1_#t~ite25=|P1Thread1of1ForFork1_#t~ite25_Out1622539081|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:39:02,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L761-2-->P1EXIT: Formula: (and (= v_~y~0_274 |v_P1Thread1of1ForFork1_#t~ite25_116|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$flush_delayed~0_269 0) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_148 (+ v_~__unbuffered_cnt~0_149 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_116|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~y~0=v_~y~0_274, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_115|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:39:02,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L832-1-->L838: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_11 256))) (= v_~main$tmp_guard0~0_11 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_70) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:39:02,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L838-2-->L838-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1254504010 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1254504010 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1254504010 |ULTIMATE.start_main_#t~ite58_Out1254504010|)) (and (or .cse1 .cse0) (= ~y~0_In1254504010 |ULTIMATE.start_main_#t~ite58_Out1254504010|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1254504010, ~y~0=~y~0_In1254504010, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1254504010, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1254504010} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1254504010, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1254504010|, ~y~0=~y~0_In1254504010, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1254504010, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1254504010} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58] because there is no mapped edge [2019-12-07 11:39:02,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L838-4-->L839: Formula: (= v_~y~0_42 |v_ULTIMATE.start_main_#t~ite58_10|) InVars {ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_9|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_15|, ~y~0=v_~y~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59, ~y~0] because there is no mapped edge [2019-12-07 11:39:02,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1200690529 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1200690529 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1200690529 |ULTIMATE.start_main_#t~ite60_Out-1200690529|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out-1200690529| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1200690529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1200690529} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1200690529|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1200690529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1200690529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 11:39:02,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L840-->L840-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-97358068 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-97358068 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-97358068 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-97358068 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-97358068|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-97358068 |ULTIMATE.start_main_#t~ite61_Out-97358068|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-97358068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-97358068, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-97358068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97358068} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-97358068|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97358068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-97358068, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-97358068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97358068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:39:02,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1441085409 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1441085409 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1441085409|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-1441085409 |ULTIMATE.start_main_#t~ite62_Out-1441085409|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1441085409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1441085409} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1441085409|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1441085409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1441085409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:39:02,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In911609522 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In911609522 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In911609522 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In911609522 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out911609522|)) (and (= ~y$r_buff1_thd0~0_In911609522 |ULTIMATE.start_main_#t~ite63_Out911609522|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In911609522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In911609522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In911609522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In911609522} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out911609522|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In911609522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In911609522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In911609522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In911609522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:39:02,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_59 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~y$r_buff1_thd0~0_234 |v_ULTIMATE.start_main_#t~ite63_45|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_44|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_234, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 11:39:02,797 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e4f1e22b-76aa-4746-8efb-0f94444c3ba8/bin/uautomizer/witness.graphml [2019-12-07 11:39:02,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:39:02,798 INFO L168 Benchmark]: Toolchain (without parser) took 36721.90 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-12-07 11:39:02,798 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:39:02,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -125.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:02,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.20 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 11:39:02,799 INFO L168 Benchmark]: Boogie Preprocessor took 26.42 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 11:39:02,799 INFO L168 Benchmark]: RCFGBuilder took 423.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:02,800 INFO L168 Benchmark]: TraceAbstraction took 35751.50 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 992.2 MB in the beginning and 1.1 GB in the end (delta: -140.9 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-12-07 11:39:02,800 INFO L168 Benchmark]: Witness Printer took 79.08 ms. Allocated memory is still 4.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:02,801 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 399.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -125.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.20 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 26.42 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 423.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35751.50 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 992.2 MB in the beginning and 1.1 GB in the end (delta: -140.9 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 79.08 ms. Allocated memory is still 4.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 194 ProgramPointsBefore, 109 ProgramPointsAfterwards, 240 TransitionsBefore, 131 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 28 ChoiceCompositions, 9412 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 312 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 128329 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t518, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L830] FCALL, FORK 0 pthread_create(&t519, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L832] FCALL, FORK 0 pthread_create(&t520, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 y$flush_delayed = weak$$choice2 [L789] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, 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] [L790] EXPR 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_p1_EAX=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=2, 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] [L790] 3 y = !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) [L791] 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_p1_EAX=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=2, 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] [L791] 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)) [L792] 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_p1_EAX=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=2, 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] [L792] 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)) [L793] 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_p1_EAX=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=2, 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] [L793] 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)) [L794] 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_p1_EAX=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=2, 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] [L794] 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)) [L796] 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_p1_EAX=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=2, 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] [L796] 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)) [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, 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] [L798] 3 y = y$flush_delayed ? y$mem_tmp : y [L799] 3 y$flush_delayed = (_Bool)0 [L802] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, 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] [L805] 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_p1_EAX=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=2, 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] [L746] 2 x = 2 [L749] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 2 y$flush_delayed = weak$$choice2 [L752] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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=3, weak$$choice2=1, x=2, 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] [L753] 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_p1_EAX=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=3, weak$$choice2=1, x=2, 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] [L753] 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) [L754] 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=1, __unbuffered_p1_EAX=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=3, 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=2, 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] [L754] 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)) [L755] 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=1, __unbuffered_p1_EAX=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=3, 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=2, 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] [L755] 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)) [L756] 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=1, __unbuffered_p1_EAX=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=3, 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))=1, x=2, 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] [L756] 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)) [L757] 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=1, __unbuffered_p1_EAX=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=3, 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=2, 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] [L757] 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)) [L758] 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=1, __unbuffered_p1_EAX=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=3, 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=2, 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] [L758] 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)) [L759] 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=1, __unbuffered_p1_EAX=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=3, 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=2, 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] [L759] 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)) [L760] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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=3, weak$$choice2=1, x=2, 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] [L805] 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) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L838] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=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=3, weak$$choice2=1, x=2, 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] [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 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 [L841] 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, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 35.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3391 SDtfs, 3819 SDslu, 7023 SDs, 0 SdLazy, 3526 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111996occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 55871 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 622 NumberOfCodeBlocks, 622 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 543 ConstructedInterpolants, 0 QuantifiedInterpolants, 130816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...