./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_pso.oepc.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_ee2b42ec-5404-4283-8afa-95c12e051484/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/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 984fe7a408c4b4bfd8e7c1f04541266588449597 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:14:23,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:14:23,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:14:23,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:14:23,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:14:23,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:14:23,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:14:23,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:14:23,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:14:23,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:14:23,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:14:23,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:14:23,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:14:23,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:14:23,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:14:23,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:14:23,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:14:23,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:14:23,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:14:23,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:14:23,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:14:23,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:14:23,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:14:23,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:14:23,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:14:23,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:14:23,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:14:23,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:14:23,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:14:23,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:14:23,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:14:23,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:14:23,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:14:23,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:14:23,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:14:23,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:14:23,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:14:23,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:14:23,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:14:23,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:14:23,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:14:23,484 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:14:23,497 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:14:23,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:14:23,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:14:23,498 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:14:23,498 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:14:23,498 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:14:23,498 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:14:23,499 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:14:23,499 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:14:23,499 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:14:23,499 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:14:23,499 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:14:23,500 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:14:23,500 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:14:23,500 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:14:23,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:14:23,501 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:14:23,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:14:23,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:14:23,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:14:23,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:14:23,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:14:23,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:14:23,502 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:14:23,502 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:14:23,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:14:23,502 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:14:23,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:14:23,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:14:23,503 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:14:23,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:14:23,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:14:23,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:14:23,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:14:23,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:14:23,504 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:14:23,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:14:23,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:14:23,504 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:14:23,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:14:23,505 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_ee2b42ec-5404-4283-8afa-95c12e051484/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 -> 984fe7a408c4b4bfd8e7c1f04541266588449597 [2019-12-07 16:14:23,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:14:23,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:14:23,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:14:23,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:14:23,625 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:14:23,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe034_pso.oepc.i [2019-12-07 16:14:23,671 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/bin/utaipan/data/5725f4900/3ccede6bdf144c049b48bf4920db2fe6/FLAG0c5416d64 [2019-12-07 16:14:24,045 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:14:24,046 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/sv-benchmarks/c/pthread-wmm/safe034_pso.oepc.i [2019-12-07 16:14:24,056 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/bin/utaipan/data/5725f4900/3ccede6bdf144c049b48bf4920db2fe6/FLAG0c5416d64 [2019-12-07 16:14:24,064 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/bin/utaipan/data/5725f4900/3ccede6bdf144c049b48bf4920db2fe6 [2019-12-07 16:14:24,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:14:24,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:14:24,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:14:24,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:14:24,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:14:24,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:14:24" (1/1) ... [2019-12-07 16:14:24,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24, skipping insertion in model container [2019-12-07 16:14:24,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:14:24" (1/1) ... [2019-12-07 16:14:24,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:14:24,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:14:24,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:14:24,392 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:14:24,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:14:24,476 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:14:24,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24 WrapperNode [2019-12-07 16:14:24,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:14:24,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:14:24,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:14:24,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:14:24,483 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:14:24" (1/1) ... [2019-12-07 16:14:24,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24" (1/1) ... [2019-12-07 16:14:24,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:14:24,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:14:24,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:14:24,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:14:24,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24" (1/1) ... [2019-12-07 16:14:24,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24" (1/1) ... [2019-12-07 16:14:24,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24" (1/1) ... [2019-12-07 16:14:24,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24" (1/1) ... [2019-12-07 16:14:24,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24" (1/1) ... [2019-12-07 16:14:24,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24" (1/1) ... [2019-12-07 16:14:24,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24" (1/1) ... [2019-12-07 16:14:24,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:14:24,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:14:24,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:14:24,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:14:24,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/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:14:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:14:24,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:14:24,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:14:24,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:14:24,580 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:14:24,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:14:24,580 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:14:24,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:14:24,581 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:14:24,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:14:24,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:14:24,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:14:24,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:14:24,582 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:14:24,903 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:14:24,903 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:14:24,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:14:24 BoogieIcfgContainer [2019-12-07 16:14:24,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:14:24,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:14:24,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:14:24,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:14:24,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:14:24" (1/3) ... [2019-12-07 16:14:24,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c8a7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:14:24, skipping insertion in model container [2019-12-07 16:14:24,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:14:24" (2/3) ... [2019-12-07 16:14:24,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c8a7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:14:24, skipping insertion in model container [2019-12-07 16:14:24,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:14:24" (3/3) ... [2019-12-07 16:14:24,909 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_pso.oepc.i [2019-12-07 16:14:24,915 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:14:24,915 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:14:24,919 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:14:24,920 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:14:24,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,944 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,955 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,955 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,955 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,955 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,955 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:14:24,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 16:14:24,981 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:14:24,982 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:14:24,982 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:14:24,982 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:14:24,982 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:14:24,982 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:14:24,982 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:14:24,982 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:14:24,992 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-07 16:14:24,993 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 16:14:25,040 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 16:14:25,040 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:14:25,048 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 16:14:25,059 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 16:14:25,082 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 16:14:25,082 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:14:25,085 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 16:14:25,095 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 16:14:25,096 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:14:27,617 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 16:14:27,820 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-12-07 16:14:27,820 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 16:14:27,822 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-12-07 16:14:28,459 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-12-07 16:14:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-12-07 16:14:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 16:14:28,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:28,465 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:14:28,465 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-12-07 16:14:28,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:28,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76364230] [2019-12-07 16:14:28,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:28,620 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:14:28,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76364230] [2019-12-07 16:14:28,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:28,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:14:28,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481411865] [2019-12-07 16:14:28,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:28,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:28,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:28,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:28,635 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-12-07 16:14:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:28,846 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-12-07 16:14:28,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:28,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 16:14:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:28,949 INFO L225 Difference]: With dead ends: 13722 [2019-12-07 16:14:28,949 INFO L226 Difference]: Without dead ends: 12214 [2019-12-07 16:14:28,950 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:14:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-12-07 16:14:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-12-07 16:14:29,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-12-07 16:14:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-12-07 16:14:29,423 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-12-07 16:14:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:29,424 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-12-07 16:14:29,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-12-07 16:14:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:14:29,428 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:29,428 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:14:29,428 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-12-07 16:14:29,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:29,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239747122] [2019-12-07 16:14:29,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:29,493 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:14:29,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239747122] [2019-12-07 16:14:29,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:29,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:14:29,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155363655] [2019-12-07 16:14:29,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:14:29,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:29,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:14:29,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:14:29,495 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-12-07 16:14:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:29,702 INFO L93 Difference]: Finished difference Result 18446 states and 67942 transitions. [2019-12-07 16:14:29,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:14:29,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 16:14:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:29,773 INFO L225 Difference]: With dead ends: 18446 [2019-12-07 16:14:29,773 INFO L226 Difference]: Without dead ends: 18390 [2019-12-07 16:14:29,773 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:14:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2019-12-07 16:14:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 16710. [2019-12-07 16:14:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-07 16:14:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 62402 transitions. [2019-12-07 16:14:30,215 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 62402 transitions. Word has length 13 [2019-12-07 16:14:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:30,215 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 62402 transitions. [2019-12-07 16:14:30,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:14:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 62402 transitions. [2019-12-07 16:14:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:14:30,220 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:30,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:14:30,221 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:30,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:30,221 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-12-07 16:14:30,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:30,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298224494] [2019-12-07 16:14:30,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:30,293 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:14:30,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298224494] [2019-12-07 16:14:30,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:30,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:30,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328075057] [2019-12-07 16:14:30,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:14:30,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:30,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:14:30,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:14:30,294 INFO L87 Difference]: Start difference. First operand 16710 states and 62402 transitions. Second operand 5 states. [2019-12-07 16:14:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:30,575 INFO L93 Difference]: Finished difference Result 24000 states and 87901 transitions. [2019-12-07 16:14:30,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:14:30,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 16:14:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:30,649 INFO L225 Difference]: With dead ends: 24000 [2019-12-07 16:14:30,649 INFO L226 Difference]: Without dead ends: 23924 [2019-12-07 16:14:30,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:14:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-12-07 16:14:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20292. [2019-12-07 16:14:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20292 states. [2019-12-07 16:14:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 75385 transitions. [2019-12-07 16:14:31,069 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 75385 transitions. Word has length 16 [2019-12-07 16:14:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:31,069 INFO L462 AbstractCegarLoop]: Abstraction has 20292 states and 75385 transitions. [2019-12-07 16:14:31,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:14:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 75385 transitions. [2019-12-07 16:14:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:14:31,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:31,074 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:14:31,074 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:31,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-12-07 16:14:31,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:31,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258045398] [2019-12-07 16:14:31,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:31,122 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:14:31,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258045398] [2019-12-07 16:14:31,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:31,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:31,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433952336] [2019-12-07 16:14:31,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:14:31,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:31,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:14:31,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:14:31,123 INFO L87 Difference]: Start difference. First operand 20292 states and 75385 transitions. Second operand 4 states. [2019-12-07 16:14:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:31,179 INFO L93 Difference]: Finished difference Result 12898 states and 41735 transitions. [2019-12-07 16:14:31,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:14:31,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 16:14:31,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:31,195 INFO L225 Difference]: With dead ends: 12898 [2019-12-07 16:14:31,195 INFO L226 Difference]: Without dead ends: 11700 [2019-12-07 16:14:31,195 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:14:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11700 states. [2019-12-07 16:14:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11700 to 11700. [2019-12-07 16:14:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11700 states. [2019-12-07 16:14:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11700 states to 11700 states and 37917 transitions. [2019-12-07 16:14:31,367 INFO L78 Accepts]: Start accepts. Automaton has 11700 states and 37917 transitions. Word has length 18 [2019-12-07 16:14:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:31,368 INFO L462 AbstractCegarLoop]: Abstraction has 11700 states and 37917 transitions. [2019-12-07 16:14:31,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:14:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 11700 states and 37917 transitions. [2019-12-07 16:14:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:14:31,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:31,370 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:14:31,370 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash -292292173, now seen corresponding path program 1 times [2019-12-07 16:14:31,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:31,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891945506] [2019-12-07 16:14:31,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:31,410 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:14:31,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891945506] [2019-12-07 16:14:31,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:31,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:14:31,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078638830] [2019-12-07 16:14:31,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:31,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:31,411 INFO L87 Difference]: Start difference. First operand 11700 states and 37917 transitions. Second operand 3 states. [2019-12-07 16:14:31,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:31,455 INFO L93 Difference]: Finished difference Result 11132 states and 35581 transitions. [2019-12-07 16:14:31,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:31,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 16:14:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:31,469 INFO L225 Difference]: With dead ends: 11132 [2019-12-07 16:14:31,469 INFO L226 Difference]: Without dead ends: 11132 [2019-12-07 16:14:31,469 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:14:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11132 states. [2019-12-07 16:14:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11132 to 10908. [2019-12-07 16:14:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10908 states. [2019-12-07 16:14:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10908 states to 10908 states and 34891 transitions. [2019-12-07 16:14:31,677 INFO L78 Accepts]: Start accepts. Automaton has 10908 states and 34891 transitions. Word has length 19 [2019-12-07 16:14:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:31,677 INFO L462 AbstractCegarLoop]: Abstraction has 10908 states and 34891 transitions. [2019-12-07 16:14:31,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10908 states and 34891 transitions. [2019-12-07 16:14:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:14:31,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:31,679 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:14:31,679 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:31,680 INFO L82 PathProgramCache]: Analyzing trace with hash 44045431, now seen corresponding path program 1 times [2019-12-07 16:14:31,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:31,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596051303] [2019-12-07 16:14:31,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:31,728 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:14:31,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596051303] [2019-12-07 16:14:31,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:31,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:14:31,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725360170] [2019-12-07 16:14:31,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:14:31,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:31,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:14:31,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:14:31,730 INFO L87 Difference]: Start difference. First operand 10908 states and 34891 transitions. Second operand 5 states. [2019-12-07 16:14:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:31,772 INFO L93 Difference]: Finished difference Result 2615 states and 7252 transitions. [2019-12-07 16:14:31,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:14:31,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 16:14:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:31,774 INFO L225 Difference]: With dead ends: 2615 [2019-12-07 16:14:31,774 INFO L226 Difference]: Without dead ends: 2014 [2019-12-07 16:14:31,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:14:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2019-12-07 16:14:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2014. [2019-12-07 16:14:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-07 16:14:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 5324 transitions. [2019-12-07 16:14:31,795 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 5324 transitions. Word has length 19 [2019-12-07 16:14:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:31,795 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 5324 transitions. [2019-12-07 16:14:31,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:14:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 5324 transitions. [2019-12-07 16:14:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:14:31,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:31,797 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] [2019-12-07 16:14:31,797 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:31,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-12-07 16:14:31,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:31,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280430046] [2019-12-07 16:14:31,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:31,822 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:14:31,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280430046] [2019-12-07 16:14:31,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:31,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:31,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263073800] [2019-12-07 16:14:31,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:31,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:31,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:31,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:31,823 INFO L87 Difference]: Start difference. First operand 2014 states and 5324 transitions. Second operand 3 states. [2019-12-07 16:14:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:31,852 INFO L93 Difference]: Finished difference Result 2850 states and 7274 transitions. [2019-12-07 16:14:31,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:31,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 16:14:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:31,855 INFO L225 Difference]: With dead ends: 2850 [2019-12-07 16:14:31,855 INFO L226 Difference]: Without dead ends: 2850 [2019-12-07 16:14:31,855 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:14:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2019-12-07 16:14:31,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2110. [2019-12-07 16:14:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-12-07 16:14:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 5466 transitions. [2019-12-07 16:14:31,876 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 5466 transitions. Word has length 29 [2019-12-07 16:14:31,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:31,876 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 5466 transitions. [2019-12-07 16:14:31,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 5466 transitions. [2019-12-07 16:14:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:14:31,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:31,878 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] [2019-12-07 16:14:31,879 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-12-07 16:14:31,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:31,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608275529] [2019-12-07 16:14:31,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:31,925 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:14:31,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608275529] [2019-12-07 16:14:31,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:31,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:14:31,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542384765] [2019-12-07 16:14:31,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:14:31,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:31,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:14:31,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:14:31,926 INFO L87 Difference]: Start difference. First operand 2110 states and 5466 transitions. Second operand 6 states. [2019-12-07 16:14:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:32,111 INFO L93 Difference]: Finished difference Result 3354 states and 8440 transitions. [2019-12-07 16:14:32,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:14:32,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 16:14:32,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:32,114 INFO L225 Difference]: With dead ends: 3354 [2019-12-07 16:14:32,114 INFO L226 Difference]: Without dead ends: 3346 [2019-12-07 16:14:32,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:14:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-12-07 16:14:32,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2160. [2019-12-07 16:14:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2019-12-07 16:14:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 5592 transitions. [2019-12-07 16:14:32,136 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 5592 transitions. Word has length 29 [2019-12-07 16:14:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:32,136 INFO L462 AbstractCegarLoop]: Abstraction has 2160 states and 5592 transitions. [2019-12-07 16:14:32,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:14:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 5592 transitions. [2019-12-07 16:14:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 16:14:32,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:32,138 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] [2019-12-07 16:14:32,138 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:32,139 INFO L82 PathProgramCache]: Analyzing trace with hash 804701306, now seen corresponding path program 1 times [2019-12-07 16:14:32,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:32,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137148889] [2019-12-07 16:14:32,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:32,189 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:14:32,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137148889] [2019-12-07 16:14:32,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:32,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:14:32,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380696591] [2019-12-07 16:14:32,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:14:32,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:32,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:14:32,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:14:32,190 INFO L87 Difference]: Start difference. First operand 2160 states and 5592 transitions. Second operand 6 states. [2019-12-07 16:14:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:32,239 INFO L93 Difference]: Finished difference Result 1348 states and 3614 transitions. [2019-12-07 16:14:32,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:14:32,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 16:14:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:32,242 INFO L225 Difference]: With dead ends: 1348 [2019-12-07 16:14:32,242 INFO L226 Difference]: Without dead ends: 1276 [2019-12-07 16:14:32,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:14:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-12-07 16:14:32,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2019-12-07 16:14:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-12-07 16:14:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3443 transitions. [2019-12-07 16:14:32,257 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3443 transitions. Word has length 30 [2019-12-07 16:14:32,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:32,257 INFO L462 AbstractCegarLoop]: Abstraction has 1276 states and 3443 transitions. [2019-12-07 16:14:32,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:14:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3443 transitions. [2019-12-07 16:14:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:14:32,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:32,259 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] [2019-12-07 16:14:32,259 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:32,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:32,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1812124980, now seen corresponding path program 1 times [2019-12-07 16:14:32,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:32,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413536802] [2019-12-07 16:14:32,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:32,289 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:14:32,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413536802] [2019-12-07 16:14:32,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:32,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:32,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527461659] [2019-12-07 16:14:32,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:32,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:32,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:32,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:32,291 INFO L87 Difference]: Start difference. First operand 1276 states and 3443 transitions. Second operand 3 states. [2019-12-07 16:14:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:32,327 INFO L93 Difference]: Finished difference Result 1496 states and 3891 transitions. [2019-12-07 16:14:32,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:32,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-07 16:14:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:32,329 INFO L225 Difference]: With dead ends: 1496 [2019-12-07 16:14:32,329 INFO L226 Difference]: Without dead ends: 1496 [2019-12-07 16:14:32,329 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:14:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-12-07 16:14:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1328. [2019-12-07 16:14:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-12-07 16:14:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3495 transitions. [2019-12-07 16:14:32,342 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3495 transitions. Word has length 45 [2019-12-07 16:14:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:32,342 INFO L462 AbstractCegarLoop]: Abstraction has 1328 states and 3495 transitions. [2019-12-07 16:14:32,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3495 transitions. [2019-12-07 16:14:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:14:32,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:32,345 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] [2019-12-07 16:14:32,345 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:32,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:32,345 INFO L82 PathProgramCache]: Analyzing trace with hash -24959066, now seen corresponding path program 1 times [2019-12-07 16:14:32,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:32,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592304708] [2019-12-07 16:14:32,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:32,631 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:14:32,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592304708] [2019-12-07 16:14:32,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:32,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 16:14:32,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693819461] [2019-12-07 16:14:32,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:14:32,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:32,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:14:32,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:14:32,633 INFO L87 Difference]: Start difference. First operand 1328 states and 3495 transitions. Second operand 12 states. [2019-12-07 16:14:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:35,026 INFO L93 Difference]: Finished difference Result 4826 states and 11852 transitions. [2019-12-07 16:14:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 16:14:35,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-12-07 16:14:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:35,030 INFO L225 Difference]: With dead ends: 4826 [2019-12-07 16:14:35,030 INFO L226 Difference]: Without dead ends: 4556 [2019-12-07 16:14:35,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=794, Unknown=0, NotChecked=0, Total=992 [2019-12-07 16:14:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2019-12-07 16:14:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 2033. [2019-12-07 16:14:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-12-07 16:14:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 5347 transitions. [2019-12-07 16:14:35,057 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 5347 transitions. Word has length 45 [2019-12-07 16:14:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:35,058 INFO L462 AbstractCegarLoop]: Abstraction has 2033 states and 5347 transitions. [2019-12-07 16:14:35,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:14:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 5347 transitions. [2019-12-07 16:14:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:14:35,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:35,060 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] [2019-12-07 16:14:35,060 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:35,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1408267876, now seen corresponding path program 2 times [2019-12-07 16:14:35,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:35,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396766879] [2019-12-07 16:14:35,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:35,297 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:14:35,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396766879] [2019-12-07 16:14:35,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:35,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 16:14:35,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138341297] [2019-12-07 16:14:35,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:14:35,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:35,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:14:35,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:14:35,298 INFO L87 Difference]: Start difference. First operand 2033 states and 5347 transitions. Second operand 12 states. [2019-12-07 16:14:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:37,037 INFO L93 Difference]: Finished difference Result 5255 states and 12754 transitions. [2019-12-07 16:14:37,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 16:14:37,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-12-07 16:14:37,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:37,040 INFO L225 Difference]: With dead ends: 5255 [2019-12-07 16:14:37,040 INFO L226 Difference]: Without dead ends: 4735 [2019-12-07 16:14:37,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 16:14:37,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2019-12-07 16:14:37,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 2086. [2019-12-07 16:14:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states. [2019-12-07 16:14:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 5422 transitions. [2019-12-07 16:14:37,067 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 5422 transitions. Word has length 45 [2019-12-07 16:14:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:37,067 INFO L462 AbstractCegarLoop]: Abstraction has 2086 states and 5422 transitions. [2019-12-07 16:14:37,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:14:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 5422 transitions. [2019-12-07 16:14:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:14:37,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:37,069 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] [2019-12-07 16:14:37,069 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:37,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:37,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1317309266, now seen corresponding path program 3 times [2019-12-07 16:14:37,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:37,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78360590] [2019-12-07 16:14:37,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:37,121 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:14:37,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78360590] [2019-12-07 16:14:37,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:37,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:37,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769784258] [2019-12-07 16:14:37,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:14:37,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:37,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:14:37,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:14:37,123 INFO L87 Difference]: Start difference. First operand 2086 states and 5422 transitions. Second operand 4 states. [2019-12-07 16:14:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:37,139 INFO L93 Difference]: Finished difference Result 2698 states and 6716 transitions. [2019-12-07 16:14:37,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:14:37,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 16:14:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:37,141 INFO L225 Difference]: With dead ends: 2698 [2019-12-07 16:14:37,141 INFO L226 Difference]: Without dead ends: 1798 [2019-12-07 16:14:37,141 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:14:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-12-07 16:14:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1798. [2019-12-07 16:14:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2019-12-07 16:14:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 4672 transitions. [2019-12-07 16:14:37,157 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 4672 transitions. Word has length 45 [2019-12-07 16:14:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:37,157 INFO L462 AbstractCegarLoop]: Abstraction has 1798 states and 4672 transitions. [2019-12-07 16:14:37,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:14:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 4672 transitions. [2019-12-07 16:14:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:14:37,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:37,159 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] [2019-12-07 16:14:37,160 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:37,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:37,160 INFO L82 PathProgramCache]: Analyzing trace with hash 414189712, now seen corresponding path program 4 times [2019-12-07 16:14:37,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:37,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749106587] [2019-12-07 16:14:37,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:37,207 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:14:37,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749106587] [2019-12-07 16:14:37,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:37,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:14:37,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779014550] [2019-12-07 16:14:37,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:14:37,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:14:37,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:14:37,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:14:37,208 INFO L87 Difference]: Start difference. First operand 1798 states and 4672 transitions. Second operand 7 states. [2019-12-07 16:14:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:37,339 INFO L93 Difference]: Finished difference Result 3862 states and 9816 transitions. [2019-12-07 16:14:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:14:37,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-07 16:14:37,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:37,341 INFO L225 Difference]: With dead ends: 3862 [2019-12-07 16:14:37,341 INFO L226 Difference]: Without dead ends: 2297 [2019-12-07 16:14:37,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:14:37,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2019-12-07 16:14:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1495. [2019-12-07 16:14:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2019-12-07 16:14:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 3910 transitions. [2019-12-07 16:14:37,357 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 3910 transitions. Word has length 45 [2019-12-07 16:14:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:37,357 INFO L462 AbstractCegarLoop]: Abstraction has 1495 states and 3910 transitions. [2019-12-07 16:14:37,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:14:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 3910 transitions. [2019-12-07 16:14:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:14:37,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:37,359 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] [2019-12-07 16:14:37,359 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:37,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:37,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 5 times [2019-12-07 16:14:37,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:14:37,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691958586] [2019-12-07 16:14:37,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:14:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:14:37,420 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:14:37,420 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:14:37,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2583~0.base_31|) (= |v_#NULL.offset_6| 0) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= (select .cse0 |v_ULTIMATE.start_main_~#t2583~0.base_31|) 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t2583~0.base_31| 1)) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2583~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2583~0.base_31|) |v_ULTIMATE.start_main_~#t2583~0.offset_22| 0)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t2583~0.offset_22| 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2583~0.base_31| 4)) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_~#t2585~0.offset=|v_ULTIMATE.start_main_~#t2585~0.offset_15|, ULTIMATE.start_main_~#t2583~0.base=|v_ULTIMATE.start_main_~#t2583~0.base_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_~#t2584~0.base=|v_ULTIMATE.start_main_~#t2584~0.base_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_~#t2584~0.offset=|v_ULTIMATE.start_main_~#t2584~0.offset_22|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ULTIMATE.start_main_~#t2583~0.offset=|v_ULTIMATE.start_main_~#t2583~0.offset_22|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t2585~0.base=|v_ULTIMATE.start_main_~#t2585~0.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2585~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2585~0.offset, ULTIMATE.start_main_~#t2583~0.base, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t2584~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2584~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2583~0.offset, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 16:14:37,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2584~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2584~0.base_10|) |v_ULTIMATE.start_main_~#t2584~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2584~0.base_10| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2584~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t2584~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2584~0.base_10|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2584~0.base_10|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2584~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t2584~0.base=|v_ULTIMATE.start_main_~#t2584~0.base_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2584~0.offset=|v_ULTIMATE.start_main_~#t2584~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2584~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2584~0.offset, #length] because there is no mapped edge [2019-12-07 16:14:37,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2585~0.base_11| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2585~0.base_11| 1) |v_#valid_36|) (= 0 |v_ULTIMATE.start_main_~#t2585~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2585~0.base_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2585~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2585~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2585~0.base_11|) |v_ULTIMATE.start_main_~#t2585~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2585~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2585~0.offset=|v_ULTIMATE.start_main_~#t2585~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2585~0.base=|v_ULTIMATE.start_main_~#t2585~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t2585~0.offset, #length, ULTIMATE.start_main_~#t2585~0.base] because there is no mapped edge [2019-12-07 16:14:37,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 16:14:37,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 16:14:37,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-748835653 256) 0))) (or (and (= ~y$w_buff0~0_In-748835653 |P1Thread1of1ForFork1_#t~ite8_Out-748835653|) (= |P1Thread1of1ForFork1_#t~ite9_Out-748835653| |P1Thread1of1ForFork1_#t~ite8_Out-748835653|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-748835653 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-748835653 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-748835653 256) 0)) (= (mod ~y$w_buff0_used~0_In-748835653 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-748835653| ~y$w_buff0~0_In-748835653) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-748835653| |P1Thread1of1ForFork1_#t~ite8_Out-748835653|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-748835653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-748835653, ~y$w_buff0~0=~y$w_buff0~0_In-748835653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-748835653, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-748835653|, ~weak$$choice2~0=~weak$$choice2~0_In-748835653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-748835653} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-748835653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-748835653, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-748835653|, ~y$w_buff0~0=~y$w_buff0~0_In-748835653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-748835653, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-748835653|, ~weak$$choice2~0=~weak$$choice2~0_In-748835653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-748835653} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:14:37,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1875636712 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In1875636712| |P1Thread1of1ForFork1_#t~ite14_Out1875636712|) (not .cse0) (= ~y$w_buff0_used~0_In1875636712 |P1Thread1of1ForFork1_#t~ite15_Out1875636712|)) (and (= ~y$w_buff0_used~0_In1875636712 |P1Thread1of1ForFork1_#t~ite14_Out1875636712|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1875636712 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1875636712 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1875636712 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1875636712 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite14_Out1875636712| |P1Thread1of1ForFork1_#t~ite15_Out1875636712|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875636712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1875636712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875636712, ~weak$$choice2~0=~weak$$choice2~0_In1875636712, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1875636712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875636712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875636712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1875636712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875636712, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1875636712|, ~weak$$choice2~0=~weak$$choice2~0_In1875636712, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1875636712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875636712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 16:14:37,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 16:14:37,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-301817500 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-301817500 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-301817500| ~y$w_buff0_used~0_In-301817500)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out-301817500| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-301817500, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-301817500} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-301817500, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-301817500, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-301817500|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:14:37,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 16:14:37,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-202116723 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-202116723 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-202116723 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-202116723 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out-202116723| ~y$w_buff1_used~0_In-202116723)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out-202116723| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-202116723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-202116723, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-202116723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-202116723} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-202116723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-202116723, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-202116723, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-202116723|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-202116723} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 16:14:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1174606588 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1174606588 256))) (.cse1 (= ~y$r_buff0_thd3~0_In1174606588 ~y$r_buff0_thd3~0_Out1174606588))) (or (and .cse0 .cse1) (and (not .cse2) (= 0 ~y$r_buff0_thd3~0_Out1174606588) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1174606588, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1174606588} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1174606588, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1174606588|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1174606588} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 16:14:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-64512011 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-64512011 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-64512011 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-64512011 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In-64512011 |P2Thread1of1ForFork2_#t~ite31_Out-64512011|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-64512011|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-64512011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-64512011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-64512011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64512011} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-64512011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-64512011, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-64512011|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-64512011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64512011} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:14:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 16:14:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 16:14:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1580829772 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1580829772 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1580829772| ~y$w_buff1~0_In1580829772)) (and (= |ULTIMATE.start_main_#t~ite35_Out1580829772| ~y~0_In1580829772) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1580829772, ~y~0=~y~0_In1580829772, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580829772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580829772} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1580829772, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1580829772|, ~y~0=~y~0_In1580829772, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580829772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580829772} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 16:14:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 16:14:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1550127172 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1550127172 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-1550127172| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-1550127172| ~y$w_buff0_used~0_In-1550127172)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550127172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1550127172} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550127172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1550127172, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1550127172|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 16:14:37,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-962350810 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-962350810 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-962350810 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-962350810 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-962350810| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-962350810| ~y$w_buff1_used~0_In-962350810) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-962350810, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-962350810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-962350810} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-962350810, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-962350810|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-962350810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-962350810} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:14:37,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2120199300 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2120199300 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-2120199300| ~y$r_buff0_thd0~0_In-2120199300)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-2120199300| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120199300, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2120199300} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120199300, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2120199300|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2120199300} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:14:37,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1781320640 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1781320640 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1781320640 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1781320640 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1781320640| ~y$r_buff1_thd0~0_In1781320640) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out1781320640|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1781320640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1781320640, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1781320640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1781320640} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1781320640|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1781320640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1781320640, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1781320640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1781320640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 16:14:37,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:14:37,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:14:37 BasicIcfg [2019-12-07 16:14:37,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:14:37,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:14:37,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:14:37,475 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:14:37,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:14:24" (3/4) ... [2019-12-07 16:14:37,477 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:14:37,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2583~0.base_31|) (= |v_#NULL.offset_6| 0) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= (select .cse0 |v_ULTIMATE.start_main_~#t2583~0.base_31|) 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t2583~0.base_31| 1)) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2583~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2583~0.base_31|) |v_ULTIMATE.start_main_~#t2583~0.offset_22| 0)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t2583~0.offset_22| 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2583~0.base_31| 4)) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_~#t2585~0.offset=|v_ULTIMATE.start_main_~#t2585~0.offset_15|, ULTIMATE.start_main_~#t2583~0.base=|v_ULTIMATE.start_main_~#t2583~0.base_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_~#t2584~0.base=|v_ULTIMATE.start_main_~#t2584~0.base_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_~#t2584~0.offset=|v_ULTIMATE.start_main_~#t2584~0.offset_22|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ULTIMATE.start_main_~#t2583~0.offset=|v_ULTIMATE.start_main_~#t2583~0.offset_22|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_~#t2585~0.base=|v_ULTIMATE.start_main_~#t2585~0.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2585~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2585~0.offset, ULTIMATE.start_main_~#t2583~0.base, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t2584~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2584~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2583~0.offset, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 16:14:37,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2584~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2584~0.base_10|) |v_ULTIMATE.start_main_~#t2584~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2584~0.base_10| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2584~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t2584~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2584~0.base_10|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2584~0.base_10|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2584~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t2584~0.base=|v_ULTIMATE.start_main_~#t2584~0.base_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2584~0.offset=|v_ULTIMATE.start_main_~#t2584~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2584~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2584~0.offset, #length] because there is no mapped edge [2019-12-07 16:14:37,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2585~0.base_11| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2585~0.base_11| 1) |v_#valid_36|) (= 0 |v_ULTIMATE.start_main_~#t2585~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2585~0.base_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2585~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2585~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2585~0.base_11|) |v_ULTIMATE.start_main_~#t2585~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2585~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2585~0.offset=|v_ULTIMATE.start_main_~#t2585~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2585~0.base=|v_ULTIMATE.start_main_~#t2585~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t2585~0.offset, #length, ULTIMATE.start_main_~#t2585~0.base] because there is no mapped edge [2019-12-07 16:14:37,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 16:14:37,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 16:14:37,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-748835653 256) 0))) (or (and (= ~y$w_buff0~0_In-748835653 |P1Thread1of1ForFork1_#t~ite8_Out-748835653|) (= |P1Thread1of1ForFork1_#t~ite9_Out-748835653| |P1Thread1of1ForFork1_#t~ite8_Out-748835653|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-748835653 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-748835653 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-748835653 256) 0)) (= (mod ~y$w_buff0_used~0_In-748835653 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-748835653| ~y$w_buff0~0_In-748835653) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-748835653| |P1Thread1of1ForFork1_#t~ite8_Out-748835653|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-748835653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-748835653, ~y$w_buff0~0=~y$w_buff0~0_In-748835653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-748835653, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-748835653|, ~weak$$choice2~0=~weak$$choice2~0_In-748835653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-748835653} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-748835653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-748835653, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-748835653|, ~y$w_buff0~0=~y$w_buff0~0_In-748835653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-748835653, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-748835653|, ~weak$$choice2~0=~weak$$choice2~0_In-748835653, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-748835653} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:14:37,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1875636712 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In1875636712| |P1Thread1of1ForFork1_#t~ite14_Out1875636712|) (not .cse0) (= ~y$w_buff0_used~0_In1875636712 |P1Thread1of1ForFork1_#t~ite15_Out1875636712|)) (and (= ~y$w_buff0_used~0_In1875636712 |P1Thread1of1ForFork1_#t~ite14_Out1875636712|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1875636712 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1875636712 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1875636712 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1875636712 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite14_Out1875636712| |P1Thread1of1ForFork1_#t~ite15_Out1875636712|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875636712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1875636712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875636712, ~weak$$choice2~0=~weak$$choice2~0_In1875636712, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1875636712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875636712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1875636712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1875636712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1875636712, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1875636712|, ~weak$$choice2~0=~weak$$choice2~0_In1875636712, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1875636712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1875636712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 16:14:37,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 16:14:37,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-301817500 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-301817500 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-301817500| ~y$w_buff0_used~0_In-301817500)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out-301817500| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-301817500, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-301817500} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-301817500, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-301817500, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-301817500|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:14:37,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 16:14:37,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-202116723 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-202116723 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-202116723 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-202116723 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out-202116723| ~y$w_buff1_used~0_In-202116723)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out-202116723| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-202116723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-202116723, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-202116723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-202116723} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-202116723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-202116723, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-202116723, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-202116723|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-202116723} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 16:14:37,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1174606588 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1174606588 256))) (.cse1 (= ~y$r_buff0_thd3~0_In1174606588 ~y$r_buff0_thd3~0_Out1174606588))) (or (and .cse0 .cse1) (and (not .cse2) (= 0 ~y$r_buff0_thd3~0_Out1174606588) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1174606588, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1174606588} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1174606588, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1174606588|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1174606588} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 16:14:37,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-64512011 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-64512011 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-64512011 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-64512011 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In-64512011 |P2Thread1of1ForFork2_#t~ite31_Out-64512011|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-64512011|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-64512011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-64512011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-64512011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64512011} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-64512011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-64512011, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-64512011|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-64512011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64512011} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:14:37,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 16:14:37,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 16:14:37,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1580829772 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1580829772 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1580829772| ~y$w_buff1~0_In1580829772)) (and (= |ULTIMATE.start_main_#t~ite35_Out1580829772| ~y~0_In1580829772) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1580829772, ~y~0=~y~0_In1580829772, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580829772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580829772} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1580829772, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1580829772|, ~y~0=~y~0_In1580829772, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580829772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580829772} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 16:14:37,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 16:14:37,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1550127172 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1550127172 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-1550127172| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-1550127172| ~y$w_buff0_used~0_In-1550127172)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550127172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1550127172} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1550127172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1550127172, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1550127172|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 16:14:37,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-962350810 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-962350810 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-962350810 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-962350810 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-962350810| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-962350810| ~y$w_buff1_used~0_In-962350810) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-962350810, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-962350810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-962350810} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-962350810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-962350810, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-962350810|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-962350810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-962350810} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:14:37,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2120199300 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2120199300 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-2120199300| ~y$r_buff0_thd0~0_In-2120199300)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-2120199300| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120199300, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2120199300} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120199300, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2120199300|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2120199300} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:14:37,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1781320640 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1781320640 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1781320640 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1781320640 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1781320640| ~y$r_buff1_thd0~0_In1781320640) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out1781320640|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1781320640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1781320640, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1781320640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1781320640} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1781320640|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1781320640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1781320640, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1781320640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1781320640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 16:14:37,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:14:37,533 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ee2b42ec-5404-4283-8afa-95c12e051484/bin/utaipan/witness.graphml [2019-12-07 16:14:37,533 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:14:37,534 INFO L168 Benchmark]: Toolchain (without parser) took 13466.93 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 572.0 MB). Free memory was 934.4 MB in the beginning and 1.2 GB in the end (delta: -254.7 MB). Peak memory consumption was 317.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:14:37,534 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:14:37,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:14:37,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.68 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:14:37,535 INFO L168 Benchmark]: Boogie Preprocessor took 23.11 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:14:37,535 INFO L168 Benchmark]: RCFGBuilder took 367.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:14:37,536 INFO L168 Benchmark]: TraceAbstraction took 12570.45 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 467.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -202.1 MB). Peak memory consumption was 265.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:14:37,536 INFO L168 Benchmark]: Witness Printer took 57.65 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:14:37,537 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 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.68 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. * Boogie Preprocessor took 23.11 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. * RCFGBuilder took 367.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12570.45 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 467.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -202.1 MB). Peak memory consumption was 265.5 MB. Max. memory is 11.5 GB. * Witness Printer took 57.65 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.8s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2583, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2584, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2585, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1952 SDtfs, 2940 SDslu, 6114 SDs, 0 SdLazy, 4603 SolverSat, 238 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20292occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 13604 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 391 ConstructedInterpolants, 0 QuantifiedInterpolants, 79075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...