./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_pso.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_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ca83ad5e5d2ae3eae2712175e07213bae7d69c7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:49:48,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:49:48,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:49:48,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:49:48,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:49:48,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:49:48,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:49:48,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:49:48,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:49:48,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:49:48,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:49:48,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:49:48,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:49:48,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:49:48,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:49:48,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:49:48,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:49:48,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:49:48,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:49:48,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:49:48,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:49:48,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:49:48,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:49:48,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:49:48,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:49:48,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:49:48,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:49:48,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:49:48,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:49:48,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:49:48,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:49:48,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:49:48,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:49:48,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:49:48,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:49:48,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:49:48,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:49:48,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:49:48,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:49:48,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:49:48,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:49:48,424 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:49:48,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:49:48,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:49:48,437 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:49:48,437 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:49:48,437 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:49:48,438 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:49:48,438 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:49:48,438 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:49:48,438 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:49:48,438 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:49:48,438 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:49:48,438 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:49:48,439 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:49:48,439 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:49:48,439 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:49:48,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:49:48,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:49:48,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:49:48,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:49:48,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:49:48,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:49:48,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:49:48,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:49:48,441 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:49:48,441 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:49:48,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:49:48,441 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:49:48,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:49:48,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:49:48,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:49:48,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:49:48,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:49:48,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:49:48,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:49:48,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:49:48,443 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:49:48,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:49:48,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:49:48,444 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:49:48,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:49:48,444 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan 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 -> Taipan 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 -> 6ca83ad5e5d2ae3eae2712175e07213bae7d69c7 [2019-12-07 16:49:48,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:49:48,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:49:48,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:49:48,560 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:49:48,561 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:49:48,561 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix021_pso.opt.i [2019-12-07 16:49:48,609 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/data/07213e3df/85828e38b3ed4a2f9819e7f911ce39ed/FLAG072ac608e [2019-12-07 16:49:48,983 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:49:48,983 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/sv-benchmarks/c/pthread-wmm/mix021_pso.opt.i [2019-12-07 16:49:48,993 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/data/07213e3df/85828e38b3ed4a2f9819e7f911ce39ed/FLAG072ac608e [2019-12-07 16:49:49,002 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/data/07213e3df/85828e38b3ed4a2f9819e7f911ce39ed [2019-12-07 16:49:49,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:49:49,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:49:49,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:49:49,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:49:49,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:49:49,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:49:49" (1/1) ... [2019-12-07 16:49:49,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1693e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49, skipping insertion in model container [2019-12-07 16:49:49,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:49:49" (1/1) ... [2019-12-07 16:49:49,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:49:49,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:49:49,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:49:49,315 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:49:49,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:49:49,408 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:49:49,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49 WrapperNode [2019-12-07 16:49:49,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:49:49,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:49:49,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:49:49,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:49:49,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49" (1/1) ... [2019-12-07 16:49:49,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49" (1/1) ... [2019-12-07 16:49:49,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:49:49,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:49:49,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:49:49,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:49:49,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49" (1/1) ... [2019-12-07 16:49:49,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49" (1/1) ... [2019-12-07 16:49:49,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49" (1/1) ... [2019-12-07 16:49:49,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49" (1/1) ... [2019-12-07 16:49:49,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49" (1/1) ... [2019-12-07 16:49:49,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49" (1/1) ... [2019-12-07 16:49:49,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49" (1/1) ... [2019-12-07 16:49:49,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:49:49,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:49:49,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:49:49,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:49:49,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/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 16:49:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:49:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:49:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:49:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:49:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:49:49,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:49:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:49:49,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:49:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:49:49,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:49:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 16:49:49,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 16:49:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:49:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:49:49,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:49:49,530 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 16:49:49,925 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:49:49,925 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:49:49,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:49:49 BoogieIcfgContainer [2019-12-07 16:49:49,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:49:49,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:49:49,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:49:49,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:49:49,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:49:49" (1/3) ... [2019-12-07 16:49:49,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dc2348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:49:49, skipping insertion in model container [2019-12-07 16:49:49,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:49:49" (2/3) ... [2019-12-07 16:49:49,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dc2348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:49:49, skipping insertion in model container [2019-12-07 16:49:49,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:49:49" (3/3) ... [2019-12-07 16:49:49,931 INFO L109 eAbstractionObserver]: Analyzing ICFG mix021_pso.opt.i [2019-12-07 16:49:49,937 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:49:49,937 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:49:49,943 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:49:49,943 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:49:49,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,975 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,976 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,976 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,977 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,978 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,978 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,995 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,995 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,996 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,996 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,996 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,999 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,999 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,999 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,999 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,999 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:49,999 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,003 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,004 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,005 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:49:50,026 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 16:49:50,039 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:49:50,039 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:49:50,039 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:49:50,039 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:49:50,039 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:49:50,039 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:49:50,039 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:49:50,039 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:49:50,050 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 253 transitions [2019-12-07 16:49:50,051 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 16:49:50,127 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 16:49:50,127 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:49:50,140 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 16:49:50,163 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 16:49:50,202 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 16:49:50,202 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:49:50,210 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 16:49:50,236 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 16:49:50,237 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:49:53,943 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 16:49:54,191 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 16:49:54,323 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146481 [2019-12-07 16:49:54,323 INFO L214 etLargeBlockEncoding]: Total number of compositions: 131 [2019-12-07 16:49:54,325 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-07 16:50:02,551 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 93550 states. [2019-12-07 16:50:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 93550 states. [2019-12-07 16:50:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:50:02,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:02,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:50:02,558 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:02,562 INFO L82 PathProgramCache]: Analyzing trace with hash 155254263, now seen corresponding path program 1 times [2019-12-07 16:50:02,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:50:02,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252747091] [2019-12-07 16:50:02,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:02,720 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 16:50:02,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252747091] [2019-12-07 16:50:02,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:02,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:50:02,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355253367] [2019-12-07 16:50:02,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:50:02,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:50:02,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:50:02,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:02,735 INFO L87 Difference]: Start difference. First operand 93550 states. Second operand 3 states. [2019-12-07 16:50:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:03,445 INFO L93 Difference]: Finished difference Result 92966 states and 426320 transitions. [2019-12-07 16:50:03,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:50:03,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 16:50:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:03,951 INFO L225 Difference]: With dead ends: 92966 [2019-12-07 16:50:03,951 INFO L226 Difference]: Without dead ends: 86602 [2019-12-07 16:50:03,952 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 16:50:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86602 states. [2019-12-07 16:50:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86602 to 86602. [2019-12-07 16:50:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86602 states. [2019-12-07 16:50:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86602 states to 86602 states and 396876 transitions. [2019-12-07 16:50:07,262 INFO L78 Accepts]: Start accepts. Automaton has 86602 states and 396876 transitions. Word has length 9 [2019-12-07 16:50:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:07,263 INFO L462 AbstractCegarLoop]: Abstraction has 86602 states and 396876 transitions. [2019-12-07 16:50:07,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:50:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 86602 states and 396876 transitions. [2019-12-07 16:50:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:50:07,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:07,269 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:50:07,269 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:07,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:07,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1923219547, now seen corresponding path program 1 times [2019-12-07 16:50:07,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:50:07,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722121212] [2019-12-07 16:50:07,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:07,346 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 16:50:07,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722121212] [2019-12-07 16:50:07,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:07,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:50:07,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656163982] [2019-12-07 16:50:07,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:07,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:50:07,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:07,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:07,348 INFO L87 Difference]: Start difference. First operand 86602 states and 396876 transitions. Second operand 4 states. [2019-12-07 16:50:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:08,213 INFO L93 Difference]: Finished difference Result 138074 states and 610572 transitions. [2019-12-07 16:50:08,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:50:08,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 16:50:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:10,477 INFO L225 Difference]: With dead ends: 138074 [2019-12-07 16:50:10,477 INFO L226 Difference]: Without dead ends: 138002 [2019-12-07 16:50:10,478 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 16:50:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138002 states. [2019-12-07 16:50:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138002 to 133994. [2019-12-07 16:50:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133994 states. [2019-12-07 16:50:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133994 states to 133994 states and 595808 transitions. [2019-12-07 16:50:14,489 INFO L78 Accepts]: Start accepts. Automaton has 133994 states and 595808 transitions. Word has length 15 [2019-12-07 16:50:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:14,490 INFO L462 AbstractCegarLoop]: Abstraction has 133994 states and 595808 transitions. [2019-12-07 16:50:14,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 133994 states and 595808 transitions. [2019-12-07 16:50:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:50:14,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:14,495 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 16:50:14,496 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1961000002, now seen corresponding path program 1 times [2019-12-07 16:50:14,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:50:14,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964423054] [2019-12-07 16:50:14,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:14,550 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 16:50:14,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964423054] [2019-12-07 16:50:14,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:14,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:50:14,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429661969] [2019-12-07 16:50:14,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:14,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:50:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:14,551 INFO L87 Difference]: Start difference. First operand 133994 states and 595808 transitions. Second operand 4 states. [2019-12-07 16:50:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:15,499 INFO L93 Difference]: Finished difference Result 171690 states and 753612 transitions. [2019-12-07 16:50:15,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:50:15,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 16:50:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:16,349 INFO L225 Difference]: With dead ends: 171690 [2019-12-07 16:50:16,349 INFO L226 Difference]: Without dead ends: 171630 [2019-12-07 16:50:16,350 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 16:50:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171630 states. [2019-12-07 16:50:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171630 to 153202. [2019-12-07 16:50:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153202 states. [2019-12-07 16:50:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153202 states to 153202 states and 678068 transitions. [2019-12-07 16:50:22,777 INFO L78 Accepts]: Start accepts. Automaton has 153202 states and 678068 transitions. Word has length 18 [2019-12-07 16:50:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:22,777 INFO L462 AbstractCegarLoop]: Abstraction has 153202 states and 678068 transitions. [2019-12-07 16:50:22,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 153202 states and 678068 transitions. [2019-12-07 16:50:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:50:22,786 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:22,786 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 16:50:22,786 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:22,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:22,786 INFO L82 PathProgramCache]: Analyzing trace with hash 661487434, now seen corresponding path program 1 times [2019-12-07 16:50:22,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:50:22,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536995618] [2019-12-07 16:50:22,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:22,811 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 16:50:22,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536995618] [2019-12-07 16:50:22,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:22,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:50:22,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983423937] [2019-12-07 16:50:22,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:50:22,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:50:22,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:50:22,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:22,812 INFO L87 Difference]: Start difference. First operand 153202 states and 678068 transitions. Second operand 3 states. [2019-12-07 16:50:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:24,095 INFO L93 Difference]: Finished difference Result 255766 states and 1092468 transitions. [2019-12-07 16:50:24,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:50:24,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 16:50:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:25,316 INFO L225 Difference]: With dead ends: 255766 [2019-12-07 16:50:25,316 INFO L226 Difference]: Without dead ends: 255766 [2019-12-07 16:50:25,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 16:50:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255766 states. [2019-12-07 16:50:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255766 to 227670. [2019-12-07 16:50:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227670 states. [2019-12-07 16:50:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227670 states to 227670 states and 984460 transitions. [2019-12-07 16:50:34,240 INFO L78 Accepts]: Start accepts. Automaton has 227670 states and 984460 transitions. Word has length 19 [2019-12-07 16:50:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:34,241 INFO L462 AbstractCegarLoop]: Abstraction has 227670 states and 984460 transitions. [2019-12-07 16:50:34,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:50:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 227670 states and 984460 transitions. [2019-12-07 16:50:34,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:50:34,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:34,253 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] [2019-12-07 16:50:34,253 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:34,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:34,253 INFO L82 PathProgramCache]: Analyzing trace with hash 301900253, now seen corresponding path program 1 times [2019-12-07 16:50:34,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:50:34,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87837627] [2019-12-07 16:50:34,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:34,317 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 16:50:34,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87837627] [2019-12-07 16:50:34,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:34,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:50:34,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024518169] [2019-12-07 16:50:34,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:50:34,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:50:34,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:50:34,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:34,319 INFO L87 Difference]: Start difference. First operand 227670 states and 984460 transitions. Second operand 3 states. [2019-12-07 16:50:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:35,406 INFO L93 Difference]: Finished difference Result 227670 states and 973664 transitions. [2019-12-07 16:50:35,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:50:35,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:50:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:36,061 INFO L225 Difference]: With dead ends: 227670 [2019-12-07 16:50:36,062 INFO L226 Difference]: Without dead ends: 227670 [2019-12-07 16:50:36,062 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 16:50:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227670 states. [2019-12-07 16:50:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227670 to 225646. [2019-12-07 16:50:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225646 states. [2019-12-07 16:50:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225646 states to 225646 states and 965864 transitions. [2019-12-07 16:50:45,389 INFO L78 Accepts]: Start accepts. Automaton has 225646 states and 965864 transitions. Word has length 20 [2019-12-07 16:50:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:45,390 INFO L462 AbstractCegarLoop]: Abstraction has 225646 states and 965864 transitions. [2019-12-07 16:50:45,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:50:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 225646 states and 965864 transitions. [2019-12-07 16:50:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:50:45,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:45,399 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] [2019-12-07 16:50:45,399 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1488828346, now seen corresponding path program 1 times [2019-12-07 16:50:45,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:50:45,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952838138] [2019-12-07 16:50:45,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:45,476 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 16:50:45,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952838138] [2019-12-07 16:50:45,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:45,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:50:45,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452647399] [2019-12-07 16:50:45,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:50:45,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:50:45,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:50:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:45,477 INFO L87 Difference]: Start difference. First operand 225646 states and 965864 transitions. Second operand 3 states. [2019-12-07 16:50:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:47,806 INFO L93 Difference]: Finished difference Result 392289 states and 1609867 transitions. [2019-12-07 16:50:47,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:50:47,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:50:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:48,805 INFO L225 Difference]: With dead ends: 392289 [2019-12-07 16:50:48,805 INFO L226 Difference]: Without dead ends: 390867 [2019-12-07 16:50:48,806 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 16:50:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390867 states. [2019-12-07 16:51:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390867 to 376641. [2019-12-07 16:51:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376641 states. [2019-12-07 16:51:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376641 states to 376641 states and 1560668 transitions. [2019-12-07 16:51:02,266 INFO L78 Accepts]: Start accepts. Automaton has 376641 states and 1560668 transitions. Word has length 20 [2019-12-07 16:51:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:02,266 INFO L462 AbstractCegarLoop]: Abstraction has 376641 states and 1560668 transitions. [2019-12-07 16:51:02,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 376641 states and 1560668 transitions. [2019-12-07 16:51:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:51:02,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:02,286 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] [2019-12-07 16:51:02,286 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:02,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:02,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1251839182, now seen corresponding path program 1 times [2019-12-07 16:51:02,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:02,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606897152] [2019-12-07 16:51:02,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:02,324 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 16:51:02,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606897152] [2019-12-07 16:51:02,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:02,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:02,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236266411] [2019-12-07 16:51:02,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:02,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:02,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:02,326 INFO L87 Difference]: Start difference. First operand 376641 states and 1560668 transitions. Second operand 4 states. [2019-12-07 16:51:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:05,964 INFO L93 Difference]: Finished difference Result 465181 states and 1907392 transitions. [2019-12-07 16:51:05,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:51:05,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 16:51:05,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:07,274 INFO L225 Difference]: With dead ends: 465181 [2019-12-07 16:51:07,274 INFO L226 Difference]: Without dead ends: 465109 [2019-12-07 16:51:07,274 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 16:51:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465109 states. [2019-12-07 16:51:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465109 to 381324. [2019-12-07 16:51:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381324 states. [2019-12-07 16:51:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381324 states to 381324 states and 1579994 transitions. [2019-12-07 16:51:22,611 INFO L78 Accepts]: Start accepts. Automaton has 381324 states and 1579994 transitions. Word has length 21 [2019-12-07 16:51:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:22,611 INFO L462 AbstractCegarLoop]: Abstraction has 381324 states and 1579994 transitions. [2019-12-07 16:51:22,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 381324 states and 1579994 transitions. [2019-12-07 16:51:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:51:22,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:22,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] [2019-12-07 16:51:22,631 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:22,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1027281216, now seen corresponding path program 1 times [2019-12-07 16:51:22,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:22,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064828578] [2019-12-07 16:51:22,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:22,679 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 16:51:22,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064828578] [2019-12-07 16:51:22,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:22,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:51:22,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494511977] [2019-12-07 16:51:22,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:51:22,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:22,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:51:22,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:22,681 INFO L87 Difference]: Start difference. First operand 381324 states and 1579994 transitions. Second operand 4 states. [2019-12-07 16:51:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:24,941 INFO L93 Difference]: Finished difference Result 373174 states and 1536885 transitions. [2019-12-07 16:51:24,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:51:24,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 16:51:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:25,904 INFO L225 Difference]: With dead ends: 373174 [2019-12-07 16:51:25,904 INFO L226 Difference]: Without dead ends: 373174 [2019-12-07 16:51:25,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:51:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373174 states. [2019-12-07 16:51:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373174 to 264196. [2019-12-07 16:51:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264196 states. [2019-12-07 16:51:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264196 states to 264196 states and 1104833 transitions. [2019-12-07 16:51:38,288 INFO L78 Accepts]: Start accepts. Automaton has 264196 states and 1104833 transitions. Word has length 21 [2019-12-07 16:51:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:38,289 INFO L462 AbstractCegarLoop]: Abstraction has 264196 states and 1104833 transitions. [2019-12-07 16:51:38,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:51:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 264196 states and 1104833 transitions. [2019-12-07 16:51:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:51:38,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:38,317 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] [2019-12-07 16:51:38,317 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:38,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:38,317 INFO L82 PathProgramCache]: Analyzing trace with hash -857974352, now seen corresponding path program 1 times [2019-12-07 16:51:38,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:38,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220012300] [2019-12-07 16:51:38,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:38,349 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 16:51:38,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220012300] [2019-12-07 16:51:38,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:38,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:38,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092071266] [2019-12-07 16:51:38,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:51:38,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:38,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:51:38,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:38,350 INFO L87 Difference]: Start difference. First operand 264196 states and 1104833 transitions. Second operand 5 states. [2019-12-07 16:51:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:40,844 INFO L93 Difference]: Finished difference Result 378158 states and 1553224 transitions. [2019-12-07 16:51:40,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:51:40,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 16:51:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:42,381 INFO L225 Difference]: With dead ends: 378158 [2019-12-07 16:51:42,381 INFO L226 Difference]: Without dead ends: 378102 [2019-12-07 16:51:42,382 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 16:51:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378102 states. [2019-12-07 16:51:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378102 to 284416. [2019-12-07 16:51:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284416 states. [2019-12-07 16:51:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284416 states to 284416 states and 1187505 transitions. [2019-12-07 16:51:51,064 INFO L78 Accepts]: Start accepts. Automaton has 284416 states and 1187505 transitions. Word has length 24 [2019-12-07 16:51:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:51,064 INFO L462 AbstractCegarLoop]: Abstraction has 284416 states and 1187505 transitions. [2019-12-07 16:51:51,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:51:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 284416 states and 1187505 transitions. [2019-12-07 16:51:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:51:51,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:51,119 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] [2019-12-07 16:51:51,120 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:51,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:51,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2079576380, now seen corresponding path program 1 times [2019-12-07 16:51:51,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:51:51,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206047098] [2019-12-07 16:51:51,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:51,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206047098] [2019-12-07 16:51:51,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:51,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:51,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763993478] [2019-12-07 16:51:51,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:51:51,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:51:51,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:51:51,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:51,165 INFO L87 Difference]: Start difference. First operand 284416 states and 1187505 transitions. Second operand 5 states. [2019-12-07 16:51:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:55,864 INFO L93 Difference]: Finished difference Result 396516 states and 1627682 transitions. [2019-12-07 16:51:55,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:51:55,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 16:51:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:57,034 INFO L225 Difference]: With dead ends: 396516 [2019-12-07 16:51:57,034 INFO L226 Difference]: Without dead ends: 396400 [2019-12-07 16:51:57,035 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 16:52:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396400 states. [2019-12-07 16:52:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396400 to 268626. [2019-12-07 16:52:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268626 states. [2019-12-07 16:52:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268626 states to 268626 states and 1121640 transitions. [2019-12-07 16:52:05,777 INFO L78 Accepts]: Start accepts. Automaton has 268626 states and 1121640 transitions. Word has length 27 [2019-12-07 16:52:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:05,777 INFO L462 AbstractCegarLoop]: Abstraction has 268626 states and 1121640 transitions. [2019-12-07 16:52:05,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:52:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 268626 states and 1121640 transitions. [2019-12-07 16:52:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 16:52:05,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:05,977 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 16:52:05,977 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1030134007, now seen corresponding path program 1 times [2019-12-07 16:52:05,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:05,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207907960] [2019-12-07 16:52:05,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:52:06,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207907960] [2019-12-07 16:52:06,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:06,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:52:06,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059694699] [2019-12-07 16:52:06,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:06,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:06,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:06,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:06,015 INFO L87 Difference]: Start difference. First operand 268626 states and 1121640 transitions. Second operand 3 states. [2019-12-07 16:52:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:07,785 INFO L93 Difference]: Finished difference Result 267073 states and 1113575 transitions. [2019-12-07 16:52:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:07,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 16:52:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:08,460 INFO L225 Difference]: With dead ends: 267073 [2019-12-07 16:52:08,460 INFO L226 Difference]: Without dead ends: 266599 [2019-12-07 16:52:08,461 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 16:52:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266599 states. [2019-12-07 16:52:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266599 to 266599. [2019-12-07 16:52:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266599 states. [2019-12-07 16:52:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266599 states to 266599 states and 1111802 transitions. [2019-12-07 16:52:15,185 INFO L78 Accepts]: Start accepts. Automaton has 266599 states and 1111802 transitions. Word has length 35 [2019-12-07 16:52:15,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:15,185 INFO L462 AbstractCegarLoop]: Abstraction has 266599 states and 1111802 transitions. [2019-12-07 16:52:15,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 266599 states and 1111802 transitions. [2019-12-07 16:52:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 16:52:15,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:15,783 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] [2019-12-07 16:52:15,783 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash -642040230, now seen corresponding path program 1 times [2019-12-07 16:52:15,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:15,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117655046] [2019-12-07 16:52:15,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:15,854 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 16:52:15,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117655046] [2019-12-07 16:52:15,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:15,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:52:15,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596390804] [2019-12-07 16:52:15,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:52:15,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:15,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:52:15,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:52:15,855 INFO L87 Difference]: Start difference. First operand 266599 states and 1111802 transitions. Second operand 4 states. [2019-12-07 16:52:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:17,387 INFO L93 Difference]: Finished difference Result 304247 states and 1267318 transitions. [2019-12-07 16:52:17,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:52:17,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 16:52:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:21,433 INFO L225 Difference]: With dead ends: 304247 [2019-12-07 16:52:21,433 INFO L226 Difference]: Without dead ends: 304247 [2019-12-07 16:52:21,433 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 16:52:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304247 states. [2019-12-07 16:52:27,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304247 to 289615. [2019-12-07 16:52:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289615 states. [2019-12-07 16:52:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289615 states to 289615 states and 1208734 transitions. [2019-12-07 16:52:28,953 INFO L78 Accepts]: Start accepts. Automaton has 289615 states and 1208734 transitions. Word has length 36 [2019-12-07 16:52:28,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:28,954 INFO L462 AbstractCegarLoop]: Abstraction has 289615 states and 1208734 transitions. [2019-12-07 16:52:28,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:52:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 289615 states and 1208734 transitions. [2019-12-07 16:52:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 16:52:29,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:29,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:52:29,179 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash -2063744740, now seen corresponding path program 2 times [2019-12-07 16:52:29,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:29,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698253270] [2019-12-07 16:52:29,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:29,210 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 16:52:29,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698253270] [2019-12-07 16:52:29,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:29,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:52:29,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278108152] [2019-12-07 16:52:29,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:52:29,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:29,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:52:29,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:52:29,211 INFO L87 Difference]: Start difference. First operand 289615 states and 1208734 transitions. Second operand 4 states. [2019-12-07 16:52:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:29,519 INFO L93 Difference]: Finished difference Result 94221 states and 310608 transitions. [2019-12-07 16:52:29,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:52:29,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 16:52:29,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:29,675 INFO L225 Difference]: With dead ends: 94221 [2019-12-07 16:52:29,676 INFO L226 Difference]: Without dead ends: 94221 [2019-12-07 16:52:29,676 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 16:52:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94221 states. [2019-12-07 16:52:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94221 to 93881. [2019-12-07 16:52:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93881 states. [2019-12-07 16:52:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93881 states to 93881 states and 309500 transitions. [2019-12-07 16:52:31,822 INFO L78 Accepts]: Start accepts. Automaton has 93881 states and 309500 transitions. Word has length 36 [2019-12-07 16:52:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:31,822 INFO L462 AbstractCegarLoop]: Abstraction has 93881 states and 309500 transitions. [2019-12-07 16:52:31,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:52:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 93881 states and 309500 transitions. [2019-12-07 16:52:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 16:52:31,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:31,871 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] [2019-12-07 16:52:31,871 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:31,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:31,871 INFO L82 PathProgramCache]: Analyzing trace with hash 926495146, now seen corresponding path program 1 times [2019-12-07 16:52:31,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:31,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464605119] [2019-12-07 16:52:31,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:31,908 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 16:52:31,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464605119] [2019-12-07 16:52:31,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:31,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:52:31,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260469163] [2019-12-07 16:52:31,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:52:31,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:31,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:52:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:52:31,909 INFO L87 Difference]: Start difference. First operand 93881 states and 309500 transitions. Second operand 5 states. [2019-12-07 16:52:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:31,981 INFO L93 Difference]: Finished difference Result 21609 states and 67376 transitions. [2019-12-07 16:52:31,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:52:31,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 16:52:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:32,006 INFO L225 Difference]: With dead ends: 21609 [2019-12-07 16:52:32,007 INFO L226 Difference]: Without dead ends: 21609 [2019-12-07 16:52:32,007 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 16:52:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21609 states. [2019-12-07 16:52:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21609 to 19623. [2019-12-07 16:52:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19623 states. [2019-12-07 16:52:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19623 states to 19623 states and 61036 transitions. [2019-12-07 16:52:32,272 INFO L78 Accepts]: Start accepts. Automaton has 19623 states and 61036 transitions. Word has length 37 [2019-12-07 16:52:32,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:32,273 INFO L462 AbstractCegarLoop]: Abstraction has 19623 states and 61036 transitions. [2019-12-07 16:52:32,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:52:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 19623 states and 61036 transitions. [2019-12-07 16:52:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 16:52:32,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:32,290 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] [2019-12-07 16:52:32,290 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:32,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1269153020, now seen corresponding path program 1 times [2019-12-07 16:52:32,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:32,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527968234] [2019-12-07 16:52:32,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:32,368 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 16:52:32,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527968234] [2019-12-07 16:52:32,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:32,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:52:32,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994644679] [2019-12-07 16:52:32,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:52:32,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:32,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:52:32,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:52:32,370 INFO L87 Difference]: Start difference. First operand 19623 states and 61036 transitions. Second operand 4 states. [2019-12-07 16:52:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:32,486 INFO L93 Difference]: Finished difference Result 39251 states and 114424 transitions. [2019-12-07 16:52:32,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:52:32,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 16:52:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:32,517 INFO L225 Difference]: With dead ends: 39251 [2019-12-07 16:52:32,517 INFO L226 Difference]: Without dead ends: 27576 [2019-12-07 16:52:32,517 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 16:52:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27576 states. [2019-12-07 16:52:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27576 to 19343. [2019-12-07 16:52:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19343 states. [2019-12-07 16:52:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19343 states to 19343 states and 52834 transitions. [2019-12-07 16:52:32,775 INFO L78 Accepts]: Start accepts. Automaton has 19343 states and 52834 transitions. Word has length 49 [2019-12-07 16:52:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:32,775 INFO L462 AbstractCegarLoop]: Abstraction has 19343 states and 52834 transitions. [2019-12-07 16:52:32,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:52:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 19343 states and 52834 transitions. [2019-12-07 16:52:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 16:52:32,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:32,789 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] [2019-12-07 16:52:32,789 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:32,789 INFO L82 PathProgramCache]: Analyzing trace with hash 302664444, now seen corresponding path program 1 times [2019-12-07 16:52:32,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:32,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800747950] [2019-12-07 16:52:32,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:32,837 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 16:52:32,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800747950] [2019-12-07 16:52:32,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:32,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:52:32,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258602218] [2019-12-07 16:52:32,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:52:32,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:32,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:52:32,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:52:32,839 INFO L87 Difference]: Start difference. First operand 19343 states and 52834 transitions. Second operand 6 states. [2019-12-07 16:52:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:32,905 INFO L93 Difference]: Finished difference Result 16083 states and 45487 transitions. [2019-12-07 16:52:32,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:52:32,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-12-07 16:52:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:32,914 INFO L225 Difference]: With dead ends: 16083 [2019-12-07 16:52:32,914 INFO L226 Difference]: Without dead ends: 8717 [2019-12-07 16:52:32,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:52:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8717 states. [2019-12-07 16:52:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8717 to 7565. [2019-12-07 16:52:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7565 states. [2019-12-07 16:52:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7565 states to 7565 states and 21607 transitions. [2019-12-07 16:52:33,001 INFO L78 Accepts]: Start accepts. Automaton has 7565 states and 21607 transitions. Word has length 50 [2019-12-07 16:52:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:33,002 INFO L462 AbstractCegarLoop]: Abstraction has 7565 states and 21607 transitions. [2019-12-07 16:52:33,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:52:33,002 INFO L276 IsEmpty]: Start isEmpty. Operand 7565 states and 21607 transitions. [2019-12-07 16:52:33,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 16:52:33,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:33,007 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, 1, 1] [2019-12-07 16:52:33,008 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:33,008 INFO L82 PathProgramCache]: Analyzing trace with hash -256453500, now seen corresponding path program 1 times [2019-12-07 16:52:33,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:33,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357731271] [2019-12-07 16:52:33,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:33,076 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 16:52:33,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357731271] [2019-12-07 16:52:33,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:33,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:52:33,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525208703] [2019-12-07 16:52:33,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:52:33,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:33,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:52:33,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:52:33,077 INFO L87 Difference]: Start difference. First operand 7565 states and 21607 transitions. Second operand 4 states. [2019-12-07 16:52:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:33,135 INFO L93 Difference]: Finished difference Result 10861 states and 29471 transitions. [2019-12-07 16:52:33,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:52:33,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 16:52:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:33,144 INFO L225 Difference]: With dead ends: 10861 [2019-12-07 16:52:33,145 INFO L226 Difference]: Without dead ends: 9767 [2019-12-07 16:52:33,145 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 16:52:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2019-12-07 16:52:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 6869. [2019-12-07 16:52:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6869 states. [2019-12-07 16:52:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6869 states to 6869 states and 19455 transitions. [2019-12-07 16:52:33,241 INFO L78 Accepts]: Start accepts. Automaton has 6869 states and 19455 transitions. Word has length 65 [2019-12-07 16:52:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:33,241 INFO L462 AbstractCegarLoop]: Abstraction has 6869 states and 19455 transitions. [2019-12-07 16:52:33,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:52:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6869 states and 19455 transitions. [2019-12-07 16:52:33,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 16:52:33,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:33,247 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, 1, 1] [2019-12-07 16:52:33,247 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:33,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:33,247 INFO L82 PathProgramCache]: Analyzing trace with hash -346208662, now seen corresponding path program 2 times [2019-12-07 16:52:33,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:33,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583640616] [2019-12-07 16:52:33,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:33,323 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 16:52:33,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583640616] [2019-12-07 16:52:33,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:33,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:52:33,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973067806] [2019-12-07 16:52:33,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:52:33,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:33,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:52:33,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:52:33,325 INFO L87 Difference]: Start difference. First operand 6869 states and 19455 transitions. Second operand 7 states. [2019-12-07 16:52:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:33,610 INFO L93 Difference]: Finished difference Result 13940 states and 38688 transitions. [2019-12-07 16:52:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:52:33,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 16:52:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:33,618 INFO L225 Difference]: With dead ends: 13940 [2019-12-07 16:52:33,618 INFO L226 Difference]: Without dead ends: 9915 [2019-12-07 16:52:33,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:52:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9915 states. [2019-12-07 16:52:33,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9915 to 6985. [2019-12-07 16:52:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6985 states. [2019-12-07 16:52:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6985 states to 6985 states and 19729 transitions. [2019-12-07 16:52:33,706 INFO L78 Accepts]: Start accepts. Automaton has 6985 states and 19729 transitions. Word has length 65 [2019-12-07 16:52:33,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:33,706 INFO L462 AbstractCegarLoop]: Abstraction has 6985 states and 19729 transitions. [2019-12-07 16:52:33,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:52:33,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6985 states and 19729 transitions. [2019-12-07 16:52:33,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 16:52:33,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:33,711 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, 1, 1, 1] [2019-12-07 16:52:33,711 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:33,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:33,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1884051960, now seen corresponding path program 1 times [2019-12-07 16:52:33,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:33,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007102519] [2019-12-07 16:52:33,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:33,769 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 16:52:33,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007102519] [2019-12-07 16:52:33,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:33,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:33,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993515411] [2019-12-07 16:52:33,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:33,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:33,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:33,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:33,771 INFO L87 Difference]: Start difference. First operand 6985 states and 19729 transitions. Second operand 3 states. [2019-12-07 16:52:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:33,816 INFO L93 Difference]: Finished difference Result 5801 states and 15685 transitions. [2019-12-07 16:52:33,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:33,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 16:52:33,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:33,823 INFO L225 Difference]: With dead ends: 5801 [2019-12-07 16:52:33,824 INFO L226 Difference]: Without dead ends: 5801 [2019-12-07 16:52:33,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 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 16:52:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5801 states. [2019-12-07 16:52:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5801 to 5765. [2019-12-07 16:52:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-12-07 16:52:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 15595 transitions. [2019-12-07 16:52:33,891 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 15595 transitions. Word has length 66 [2019-12-07 16:52:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:33,891 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 15595 transitions. [2019-12-07 16:52:33,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 15595 transitions. [2019-12-07 16:52:33,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 16:52:33,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:33,895 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, 1, 1, 1] [2019-12-07 16:52:33,895 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:33,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:33,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1338605312, now seen corresponding path program 1 times [2019-12-07 16:52:33,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:33,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152471451] [2019-12-07 16:52:33,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:33,945 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 16:52:33,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152471451] [2019-12-07 16:52:33,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:33,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:52:33,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393407011] [2019-12-07 16:52:33,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:52:33,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:33,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:52:33,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:52:33,946 INFO L87 Difference]: Start difference. First operand 5765 states and 15595 transitions. Second operand 4 states. [2019-12-07 16:52:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:33,969 INFO L93 Difference]: Finished difference Result 6547 states and 17249 transitions. [2019-12-07 16:52:33,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:52:33,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 16:52:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:33,973 INFO L225 Difference]: With dead ends: 6547 [2019-12-07 16:52:33,973 INFO L226 Difference]: Without dead ends: 3641 [2019-12-07 16:52:33,973 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 16:52:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2019-12-07 16:52:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3641. [2019-12-07 16:52:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2019-12-07 16:52:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 8700 transitions. [2019-12-07 16:52:34,010 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 8700 transitions. Word has length 66 [2019-12-07 16:52:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:34,010 INFO L462 AbstractCegarLoop]: Abstraction has 3641 states and 8700 transitions. [2019-12-07 16:52:34,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:52:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 8700 transitions. [2019-12-07 16:52:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 16:52:34,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:34,012 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, 1, 1, 1] [2019-12-07 16:52:34,013 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:34,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:34,013 INFO L82 PathProgramCache]: Analyzing trace with hash 858505902, now seen corresponding path program 2 times [2019-12-07 16:52:34,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:34,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658256653] [2019-12-07 16:52:34,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:34,047 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 16:52:34,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658256653] [2019-12-07 16:52:34,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:34,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:34,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634049259] [2019-12-07 16:52:34,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:34,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:34,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:34,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:34,049 INFO L87 Difference]: Start difference. First operand 3641 states and 8700 transitions. Second operand 3 states. [2019-12-07 16:52:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:34,062 INFO L93 Difference]: Finished difference Result 4084 states and 9647 transitions. [2019-12-07 16:52:34,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:34,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 16:52:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:34,064 INFO L225 Difference]: With dead ends: 4084 [2019-12-07 16:52:34,064 INFO L226 Difference]: Without dead ends: 515 [2019-12-07 16:52:34,064 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 16:52:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-12-07 16:52:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-12-07 16:52:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-12-07 16:52:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1051 transitions. [2019-12-07 16:52:34,070 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1051 transitions. Word has length 66 [2019-12-07 16:52:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:34,070 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 1051 transitions. [2019-12-07 16:52:34,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1051 transitions. [2019-12-07 16:52:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 16:52:34,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:34,071 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, 1, 1, 1] [2019-12-07 16:52:34,071 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:34,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:34,072 INFO L82 PathProgramCache]: Analyzing trace with hash 977277596, now seen corresponding path program 3 times [2019-12-07 16:52:34,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:34,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435661315] [2019-12-07 16:52:34,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:34,141 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 16:52:34,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435661315] [2019-12-07 16:52:34,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:34,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:52:34,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249554564] [2019-12-07 16:52:34,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:52:34,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:52:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:52:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:52:34,143 INFO L87 Difference]: Start difference. First operand 515 states and 1051 transitions. Second operand 8 states. [2019-12-07 16:52:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:34,271 INFO L93 Difference]: Finished difference Result 894 states and 1799 transitions. [2019-12-07 16:52:34,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:52:34,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 16:52:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:34,272 INFO L225 Difference]: With dead ends: 894 [2019-12-07 16:52:34,272 INFO L226 Difference]: Without dead ends: 579 [2019-12-07 16:52:34,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:52:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-12-07 16:52:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 541. [2019-12-07 16:52:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-12-07 16:52:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1075 transitions. [2019-12-07 16:52:34,279 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 1075 transitions. Word has length 66 [2019-12-07 16:52:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:34,279 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 1075 transitions. [2019-12-07 16:52:34,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:52:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1075 transitions. [2019-12-07 16:52:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 16:52:34,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:34,280 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, 1, 1, 1] [2019-12-07 16:52:34,280 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:34,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:34,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1081052920, now seen corresponding path program 4 times [2019-12-07 16:52:34,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:52:34,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341480139] [2019-12-07 16:52:34,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:52:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:52:34,372 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:52:34,373 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:52:34,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= v_~z$r_buff1_thd2~0_303 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t565~0.base_37|) (= 0 v_~weak$$choice0~0_336) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t565~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t565~0.base_37|) |v_ULTIMATE.start_main_~#t565~0.offset_25| 0)) |v_#memory_int_23|) (= v_~__unbuffered_cnt~0_142 0) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t565~0.base_37| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t565~0.base_37| 4) |v_#length_31|) (= v_~a~0_37 0) (= 0 |v_ULTIMATE.start_main_~#t565~0.offset_25|) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t565~0.base_37|)) (= v_~z$w_buff0~0_773 0) (= v_~z$r_buff0_thd0~0_170 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ULTIMATE.start_main_~#t567~0.offset=|v_ULTIMATE.start_main_~#t567~0.offset_18|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t567~0.base=|v_ULTIMATE.start_main_~#t567~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_~#t568~0.base=|v_ULTIMATE.start_main_~#t568~0.base_23|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ULTIMATE.start_main_~#t566~0.offset=|v_ULTIMATE.start_main_~#t566~0.offset_17|, ~x~0=v_~x~0_105, ULTIMATE.start_main_~#t568~0.offset=|v_ULTIMATE.start_main_~#t568~0.offset_18|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t565~0.offset=|v_ULTIMATE.start_main_~#t565~0.offset_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, ULTIMATE.start_main_~#t565~0.base=|v_ULTIMATE.start_main_~#t565~0.base_37|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t566~0.base=|v_ULTIMATE.start_main_~#t566~0.base_30|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t567~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t567~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t568~0.base, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t566~0.offset, ~x~0, ULTIMATE.start_main_~#t568~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t565~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t565~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t566~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:52:34,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t566~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t566~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t566~0.base_12|) |v_ULTIMATE.start_main_~#t566~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t566~0.base_12| 4) |v_#length_21|) (not (= 0 |v_ULTIMATE.start_main_~#t566~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t566~0.base_12| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t566~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t566~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t566~0.base=|v_ULTIMATE.start_main_~#t566~0.base_12|, #length=|v_#length_21|, ULTIMATE.start_main_~#t566~0.offset=|v_ULTIMATE.start_main_~#t566~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t566~0.base, #length, ULTIMATE.start_main_~#t566~0.offset] because there is no mapped edge [2019-12-07 16:52:34,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t567~0.base_12| 1)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t567~0.base_12| 4) |v_#length_19|) (= |v_ULTIMATE.start_main_~#t567~0.offset_11| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t567~0.base_12|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t567~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t567~0.base_12| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t567~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t567~0.base_12|) |v_ULTIMATE.start_main_~#t567~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t567~0.offset=|v_ULTIMATE.start_main_~#t567~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t567~0.base=|v_ULTIMATE.start_main_~#t567~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t567~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t567~0.base] because there is no mapped edge [2019-12-07 16:52:34,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_ULTIMATE.start_main_~#t568~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t568~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t568~0.base_13|) |v_ULTIMATE.start_main_~#t568~0.offset_11| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t568~0.base_13|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t568~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t568~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t568~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t568~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t568~0.offset=|v_ULTIMATE.start_main_~#t568~0.offset_11|, ULTIMATE.start_main_~#t568~0.base=|v_ULTIMATE.start_main_~#t568~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t568~0.offset, ULTIMATE.start_main_~#t568~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 16:52:34,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 16:52:34,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In672306681 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In672306681 256) 0)) (.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out672306681| |P3Thread1of1ForFork2_#t~ite28_Out672306681|))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out672306681| ~z$w_buff1~0_In672306681) (or .cse1 .cse2)) (and (not .cse1) (not .cse2) .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out672306681| ~z$w_buff0~0_In672306681)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In672306681, ~z$w_buff0~0=~z$w_buff0~0_In672306681, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In672306681, ~z$w_buff1~0=~z$w_buff1~0_In672306681} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out672306681|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out672306681|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In672306681, ~z$w_buff0~0=~z$w_buff0~0_In672306681, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In672306681, ~z$w_buff1~0=~z$w_buff1~0_In672306681} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:52:34,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 16:52:34,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In447914411 256)))) (or (and (= ~z~0_In447914411 |P3Thread1of1ForFork2_#t~ite48_Out447914411|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In447914411 |P3Thread1of1ForFork2_#t~ite48_Out447914411|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In447914411, ~z$flush_delayed~0=~z$flush_delayed~0_In447914411, ~z~0=~z~0_In447914411} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In447914411, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out447914411|, ~z$flush_delayed~0=~z$flush_delayed~0_In447914411, ~z~0=~z~0_In447914411} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 16:52:34,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 16:52:34,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 16:52:34,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1876170277 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1876170277 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1876170277| ~z$w_buff0_used~0_In-1876170277)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1876170277| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1876170277, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1876170277} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1876170277|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1876170277, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1876170277} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 16:52:34,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1476001905 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite25_Out-1476001905| ~z$mem_tmp~0_In-1476001905)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out-1476001905| ~z~0_In-1476001905) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1476001905, ~z$flush_delayed~0=~z$flush_delayed~0_In-1476001905, ~z~0=~z~0_In-1476001905} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1476001905, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1476001905|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1476001905, ~z~0=~z~0_In-1476001905} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 16:52:34,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 16:52:34,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In583748232 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In583748232 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In583748232 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In583748232 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite52_Out583748232| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite52_Out583748232| ~z$w_buff1_used~0_In583748232) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In583748232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In583748232, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In583748232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In583748232} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out583748232|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In583748232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In583748232, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In583748232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In583748232} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 16:52:34,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out1266965159 ~z$r_buff0_thd4~0_In1266965159)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1266965159 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1266965159 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out1266965159) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1266965159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1266965159} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1266965159|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1266965159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1266965159} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 16:52:34,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In-216204129 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-216204129 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-216204129 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-216204129 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-216204129| 0)) (and (= |P3Thread1of1ForFork2_#t~ite54_Out-216204129| ~z$r_buff1_thd4~0_In-216204129) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-216204129, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-216204129, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-216204129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-216204129} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-216204129|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-216204129, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-216204129, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-216204129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-216204129} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 16:52:34,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 16:52:34,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:52:34,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1025253771 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1025253771 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite59_Out-1025253771| |ULTIMATE.start_main_#t~ite60_Out-1025253771|))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite59_Out-1025253771| ~z$w_buff1~0_In-1025253771)) (and (or .cse2 .cse0) .cse1 (= ~z~0_In-1025253771 |ULTIMATE.start_main_#t~ite59_Out-1025253771|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1025253771, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025253771, ~z$w_buff1~0=~z$w_buff1~0_In-1025253771, ~z~0=~z~0_In-1025253771} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1025253771|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1025253771, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025253771, ~z$w_buff1~0=~z$w_buff1~0_In-1025253771, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1025253771|, ~z~0=~z~0_In-1025253771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 16:52:34,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1989345284 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1989345284 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-1989345284| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1989345284| ~z$w_buff0_used~0_In-1989345284) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1989345284, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989345284} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1989345284, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1989345284|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989345284} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 16:52:34,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1487709834 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1487709834 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1487709834 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1487709834 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1487709834|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1487709834| ~z$w_buff1_used~0_In1487709834)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1487709834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1487709834, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1487709834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1487709834} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1487709834|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1487709834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1487709834, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1487709834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1487709834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 16:52:34,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-415396389 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-415396389 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out-415396389|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-415396389 |ULTIMATE.start_main_#t~ite63_Out-415396389|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-415396389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-415396389} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-415396389|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-415396389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-415396389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 16:52:34,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In843067127 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In843067127 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In843067127 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In843067127 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In843067127 |ULTIMATE.start_main_#t~ite64_Out843067127|)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out843067127|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In843067127, ~z$w_buff0_used~0=~z$w_buff0_used~0_In843067127, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In843067127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In843067127} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In843067127, ~z$w_buff0_used~0=~z$w_buff0_used~0_In843067127, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In843067127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In843067127, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out843067127|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 16:52:34,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:52:34,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:52:34 BasicIcfg [2019-12-07 16:52:34,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:52:34,473 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:52:34,473 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:52:34,473 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:52:34,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:49:49" (3/4) ... [2019-12-07 16:52:34,475 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:52:34,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= v_~z$r_buff1_thd2~0_303 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t565~0.base_37|) (= 0 v_~weak$$choice0~0_336) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t565~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t565~0.base_37|) |v_ULTIMATE.start_main_~#t565~0.offset_25| 0)) |v_#memory_int_23|) (= v_~__unbuffered_cnt~0_142 0) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t565~0.base_37| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t565~0.base_37| 4) |v_#length_31|) (= v_~a~0_37 0) (= 0 |v_ULTIMATE.start_main_~#t565~0.offset_25|) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t565~0.base_37|)) (= v_~z$w_buff0~0_773 0) (= v_~z$r_buff0_thd0~0_170 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ULTIMATE.start_main_~#t567~0.offset=|v_ULTIMATE.start_main_~#t567~0.offset_18|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t567~0.base=|v_ULTIMATE.start_main_~#t567~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_~#t568~0.base=|v_ULTIMATE.start_main_~#t568~0.base_23|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ULTIMATE.start_main_~#t566~0.offset=|v_ULTIMATE.start_main_~#t566~0.offset_17|, ~x~0=v_~x~0_105, ULTIMATE.start_main_~#t568~0.offset=|v_ULTIMATE.start_main_~#t568~0.offset_18|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t565~0.offset=|v_ULTIMATE.start_main_~#t565~0.offset_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, ULTIMATE.start_main_~#t565~0.base=|v_ULTIMATE.start_main_~#t565~0.base_37|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t566~0.base=|v_ULTIMATE.start_main_~#t566~0.base_30|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t567~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t567~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t568~0.base, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t566~0.offset, ~x~0, ULTIMATE.start_main_~#t568~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t565~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t565~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t566~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:52:34,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t566~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t566~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t566~0.base_12|) |v_ULTIMATE.start_main_~#t566~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t566~0.base_12| 4) |v_#length_21|) (not (= 0 |v_ULTIMATE.start_main_~#t566~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t566~0.base_12| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t566~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t566~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t566~0.base=|v_ULTIMATE.start_main_~#t566~0.base_12|, #length=|v_#length_21|, ULTIMATE.start_main_~#t566~0.offset=|v_ULTIMATE.start_main_~#t566~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t566~0.base, #length, ULTIMATE.start_main_~#t566~0.offset] because there is no mapped edge [2019-12-07 16:52:34,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t567~0.base_12| 1)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t567~0.base_12| 4) |v_#length_19|) (= |v_ULTIMATE.start_main_~#t567~0.offset_11| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t567~0.base_12|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t567~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t567~0.base_12| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t567~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t567~0.base_12|) |v_ULTIMATE.start_main_~#t567~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t567~0.offset=|v_ULTIMATE.start_main_~#t567~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t567~0.base=|v_ULTIMATE.start_main_~#t567~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t567~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t567~0.base] because there is no mapped edge [2019-12-07 16:52:34,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_ULTIMATE.start_main_~#t568~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t568~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t568~0.base_13|) |v_ULTIMATE.start_main_~#t568~0.offset_11| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t568~0.base_13|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t568~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t568~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t568~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t568~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t568~0.offset=|v_ULTIMATE.start_main_~#t568~0.offset_11|, ULTIMATE.start_main_~#t568~0.base=|v_ULTIMATE.start_main_~#t568~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t568~0.offset, ULTIMATE.start_main_~#t568~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 16:52:34,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 16:52:34,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In672306681 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In672306681 256) 0)) (.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out672306681| |P3Thread1of1ForFork2_#t~ite28_Out672306681|))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out672306681| ~z$w_buff1~0_In672306681) (or .cse1 .cse2)) (and (not .cse1) (not .cse2) .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out672306681| ~z$w_buff0~0_In672306681)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In672306681, ~z$w_buff0~0=~z$w_buff0~0_In672306681, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In672306681, ~z$w_buff1~0=~z$w_buff1~0_In672306681} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out672306681|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out672306681|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In672306681, ~z$w_buff0~0=~z$w_buff0~0_In672306681, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In672306681, ~z$w_buff1~0=~z$w_buff1~0_In672306681} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:52:34,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 16:52:34,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In447914411 256)))) (or (and (= ~z~0_In447914411 |P3Thread1of1ForFork2_#t~ite48_Out447914411|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In447914411 |P3Thread1of1ForFork2_#t~ite48_Out447914411|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In447914411, ~z$flush_delayed~0=~z$flush_delayed~0_In447914411, ~z~0=~z~0_In447914411} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In447914411, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out447914411|, ~z$flush_delayed~0=~z$flush_delayed~0_In447914411, ~z~0=~z~0_In447914411} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 16:52:34,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 16:52:34,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 16:52:34,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1876170277 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1876170277 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1876170277| ~z$w_buff0_used~0_In-1876170277)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-1876170277| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1876170277, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1876170277} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1876170277|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1876170277, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1876170277} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 16:52:34,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1476001905 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite25_Out-1476001905| ~z$mem_tmp~0_In-1476001905)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out-1476001905| ~z~0_In-1476001905) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1476001905, ~z$flush_delayed~0=~z$flush_delayed~0_In-1476001905, ~z~0=~z~0_In-1476001905} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1476001905, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1476001905|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1476001905, ~z~0=~z~0_In-1476001905} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 16:52:34,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 16:52:34,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In583748232 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In583748232 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In583748232 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In583748232 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite52_Out583748232| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite52_Out583748232| ~z$w_buff1_used~0_In583748232) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In583748232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In583748232, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In583748232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In583748232} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out583748232|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In583748232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In583748232, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In583748232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In583748232} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 16:52:34,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out1266965159 ~z$r_buff0_thd4~0_In1266965159)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1266965159 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1266965159 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out1266965159) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1266965159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1266965159} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1266965159|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1266965159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1266965159} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 16:52:34,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In-216204129 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-216204129 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-216204129 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-216204129 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-216204129| 0)) (and (= |P3Thread1of1ForFork2_#t~ite54_Out-216204129| ~z$r_buff1_thd4~0_In-216204129) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-216204129, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-216204129, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-216204129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-216204129} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-216204129|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-216204129, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-216204129, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-216204129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-216204129} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 16:52:34,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 16:52:34,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:52:34,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1025253771 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1025253771 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite59_Out-1025253771| |ULTIMATE.start_main_#t~ite60_Out-1025253771|))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite59_Out-1025253771| ~z$w_buff1~0_In-1025253771)) (and (or .cse2 .cse0) .cse1 (= ~z~0_In-1025253771 |ULTIMATE.start_main_#t~ite59_Out-1025253771|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1025253771, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025253771, ~z$w_buff1~0=~z$w_buff1~0_In-1025253771, ~z~0=~z~0_In-1025253771} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1025253771|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1025253771, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1025253771, ~z$w_buff1~0=~z$w_buff1~0_In-1025253771, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1025253771|, ~z~0=~z~0_In-1025253771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 16:52:34,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1989345284 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1989345284 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-1989345284| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1989345284| ~z$w_buff0_used~0_In-1989345284) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1989345284, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989345284} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1989345284, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1989345284|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989345284} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 16:52:34,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1487709834 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1487709834 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1487709834 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1487709834 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1487709834|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1487709834| ~z$w_buff1_used~0_In1487709834)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1487709834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1487709834, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1487709834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1487709834} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1487709834|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1487709834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1487709834, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1487709834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1487709834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 16:52:34,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-415396389 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-415396389 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out-415396389|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-415396389 |ULTIMATE.start_main_#t~ite63_Out-415396389|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-415396389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-415396389} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-415396389|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-415396389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-415396389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 16:52:34,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In843067127 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In843067127 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In843067127 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In843067127 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In843067127 |ULTIMATE.start_main_#t~ite64_Out843067127|)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out843067127|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In843067127, ~z$w_buff0_used~0=~z$w_buff0_used~0_In843067127, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In843067127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In843067127} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In843067127, ~z$w_buff0_used~0=~z$w_buff0_used~0_In843067127, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In843067127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In843067127, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out843067127|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 16:52:34,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:52:34,564 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7cba8dc7-28fa-4380-99d7-604330b73045/bin/utaipan/witness.graphml [2019-12-07 16:52:34,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:52:34,565 INFO L168 Benchmark]: Toolchain (without parser) took 165560.15 ms. Allocated memory was 1.0 GB in the beginning and 9.6 GB in the end (delta: 8.6 GB). Free memory was 938.9 MB in the beginning and 5.8 GB in the end (delta: -4.8 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-12-07 16:52:34,566 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:52:34,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 938.9 MB in the beginning and 1.1 GB in the end (delta: -125.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:52:34,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.09 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 16:52:34,567 INFO L168 Benchmark]: Boogie Preprocessor took 28.64 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 16:52:34,567 INFO L168 Benchmark]: RCFGBuilder took 447.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.0 MB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:52:34,567 INFO L168 Benchmark]: TraceAbstraction took 164546.08 ms. Allocated memory was 1.1 GB in the beginning and 9.6 GB in the end (delta: 8.5 GB). Free memory was 998.0 MB in the beginning and 5.8 GB in the end (delta: -4.8 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-12-07 16:52:34,568 INFO L168 Benchmark]: Witness Printer took 91.09 ms. Allocated memory is still 9.6 GB. Free memory was 5.8 GB in the beginning and 5.8 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:52:34,569 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 938.9 MB in the beginning and 1.1 GB in the end (delta: -125.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.64 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 447.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.0 MB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 164546.08 ms. Allocated memory was 1.1 GB in the beginning and 9.6 GB in the end (delta: 8.5 GB). Free memory was 998.0 MB in the beginning and 5.8 GB in the end (delta: -4.8 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 91.09 ms. Allocated memory is still 9.6 GB. Free memory was 5.8 GB in the beginning and 5.8 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 210 ProgramPointsBefore, 115 ProgramPointsAfterwards, 253 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 50 ConcurrentYvCompositions, 28 ChoiceCompositions, 10258 VarBasedMoverChecksPositive, 419 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 389 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 146481 CheckedPairsTotal, 131 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L849] FCALL, FORK 0 pthread_create(&t565, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t566, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t567, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t568, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L800] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L801] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L802] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L803] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = (_Bool)1 [L807] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 4 z$flush_delayed = weak$$choice2 [L810] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L812] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L813] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L814] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z = z$flush_delayed ? z$mem_tmp : z [L820] 4 z$flush_delayed = (_Bool)0 [L823] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L779] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 198 locations, 2 error locations. Result: UNSAFE, OverallTime: 164.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 41.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4727 SDtfs, 4553 SDslu, 6874 SDs, 0 SdLazy, 2010 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381324occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 107.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 513250 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 897 NumberOfCodeBlocks, 897 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 185104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...