./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix014_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d73680f4fc3e29976a25af4ba9580ed58ef98287 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:41:16,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:41:16,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:41:16,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:41:16,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:41:16,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:41:16,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:41:16,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:41:16,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:41:16,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:41:16,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:41:16,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:41:16,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:41:16,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:41:16,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:41:16,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:41:16,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:41:16,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:41:16,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:41:16,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:41:16,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:41:16,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:41:16,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:41:16,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:41:16,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:41:16,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:41:16,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:41:16,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:41:16,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:41:16,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:41:16,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:41:16,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:41:16,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:41:16,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:41:16,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:41:16,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:41:16,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:41:16,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:41:16,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:41:16,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:41:16,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:41:16,510 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:41:16,519 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:41:16,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:41:16,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:41:16,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:41:16,521 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:41:16,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:41:16,521 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:41:16,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:41:16,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:41:16,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:41:16,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:41:16,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:41:16,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:41:16,522 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:41:16,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:41:16,522 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:41:16,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:41:16,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:41:16,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:41:16,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:41:16,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:41:16,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:41:16,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:41:16,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:41:16,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:41:16,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:41:16,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:41:16,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:41:16,524 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:41:16,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d73680f4fc3e29976a25af4ba9580ed58ef98287 [2019-12-07 17:41:16,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:41:16,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:41:16,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:41:16,633 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:41:16,633 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:41:16,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix014_rmo.opt.i [2019-12-07 17:41:16,669 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/data/371eedbae/23864fcd13694ee9ac0ed6d8d9c65e59/FLAG978dc49ff [2019-12-07 17:41:17,121 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:41:17,121 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/sv-benchmarks/c/pthread-wmm/mix014_rmo.opt.i [2019-12-07 17:41:17,132 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/data/371eedbae/23864fcd13694ee9ac0ed6d8d9c65e59/FLAG978dc49ff [2019-12-07 17:41:17,141 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/data/371eedbae/23864fcd13694ee9ac0ed6d8d9c65e59 [2019-12-07 17:41:17,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:41:17,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:41:17,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:41:17,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:41:17,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:41:17,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:41:17" (1/1) ... [2019-12-07 17:41:17,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17, skipping insertion in model container [2019-12-07 17:41:17,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:41:17" (1/1) ... [2019-12-07 17:41:17,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:41:17,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:41:17,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:41:17,465 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:41:17,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:41:17,575 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:41:17,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17 WrapperNode [2019-12-07 17:41:17,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:41:17,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:41:17,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:41:17,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:41:17,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17" (1/1) ... [2019-12-07 17:41:17,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17" (1/1) ... [2019-12-07 17:41:17,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:41:17,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:41:17,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:41:17,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:41:17,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17" (1/1) ... [2019-12-07 17:41:17,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17" (1/1) ... [2019-12-07 17:41:17,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17" (1/1) ... [2019-12-07 17:41:17,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17" (1/1) ... [2019-12-07 17:41:17,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17" (1/1) ... [2019-12-07 17:41:17,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17" (1/1) ... [2019-12-07 17:41:17,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17" (1/1) ... [2019-12-07 17:41:17,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:41:17,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:41:17,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:41:17,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:41:17,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:41:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:41:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:41:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:41:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:41:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:41:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:41:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:41:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:41:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:41:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:41:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 17:41:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 17:41:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:41:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:41:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:41:17,689 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:41:18,096 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:41:18,096 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:41:18,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:18 BoogieIcfgContainer [2019-12-07 17:41:18,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:41:18,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:41:18,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:41:18,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:41:18,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:41:17" (1/3) ... [2019-12-07 17:41:18,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed0fbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:41:18, skipping insertion in model container [2019-12-07 17:41:18,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:41:17" (2/3) ... [2019-12-07 17:41:18,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed0fbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:41:18, skipping insertion in model container [2019-12-07 17:41:18,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:18" (3/3) ... [2019-12-07 17:41:18,102 INFO L109 eAbstractionObserver]: Analyzing ICFG mix014_rmo.opt.i [2019-12-07 17:41:18,108 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:41:18,108 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:41:18,113 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:41:18,114 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:41:18,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,140 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,140 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,142 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,142 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,160 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,160 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,161 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,161 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,161 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,161 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,161 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,161 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,161 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:41:18,194 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 17:41:18,206 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:41:18,206 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:41:18,206 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:41:18,206 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:41:18,206 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:41:18,206 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:41:18,206 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:41:18,206 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:41:18,217 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-07 17:41:18,219 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 17:41:18,304 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 17:41:18,304 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:41:18,316 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:41:18,338 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 17:41:18,386 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 17:41:18,387 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:41:18,396 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:41:18,421 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 17:41:18,422 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:41:21,942 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 17:41:22,158 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 17:41:22,277 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147467 [2019-12-07 17:41:22,277 INFO L214 etLargeBlockEncoding]: Total number of compositions: 131 [2019-12-07 17:41:22,280 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 134 transitions [2019-12-07 17:41:30,833 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 94794 states. [2019-12-07 17:41:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 94794 states. [2019-12-07 17:41:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:41:30,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:30,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:30,840 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:30,843 INFO L82 PathProgramCache]: Analyzing trace with hash -284739831, now seen corresponding path program 1 times [2019-12-07 17:41:30,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:30,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573430313] [2019-12-07 17:41:30,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:31,000 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 17:41:31,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573430313] [2019-12-07 17:41:31,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:31,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:41:31,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126494709] [2019-12-07 17:41:31,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:41:31,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:31,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:41:31,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:41:31,015 INFO L87 Difference]: Start difference. First operand 94794 states. Second operand 3 states. [2019-12-07 17:41:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:31,805 INFO L93 Difference]: Finished difference Result 94058 states and 432536 transitions. [2019-12-07 17:41:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:41:31,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 17:41:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:32,288 INFO L225 Difference]: With dead ends: 94058 [2019-12-07 17:41:32,288 INFO L226 Difference]: Without dead ends: 88038 [2019-12-07 17:41:32,289 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 17:41:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88038 states. [2019-12-07 17:41:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88038 to 88038. [2019-12-07 17:41:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88038 states. [2019-12-07 17:41:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88038 states to 88038 states and 404604 transitions. [2019-12-07 17:41:35,419 INFO L78 Accepts]: Start accepts. Automaton has 88038 states and 404604 transitions. Word has length 9 [2019-12-07 17:41:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:35,420 INFO L462 AbstractCegarLoop]: Abstraction has 88038 states and 404604 transitions. [2019-12-07 17:41:35,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:41:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 88038 states and 404604 transitions. [2019-12-07 17:41:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:41:35,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:35,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:35,428 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:35,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:35,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1938763797, now seen corresponding path program 1 times [2019-12-07 17:41:35,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:35,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687180735] [2019-12-07 17:41:35,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:35,503 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 17:41:35,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687180735] [2019-12-07 17:41:35,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:35,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:41:35,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341644345] [2019-12-07 17:41:35,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:41:35,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:35,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:41:35,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:41:35,505 INFO L87 Difference]: Start difference. First operand 88038 states and 404604 transitions. Second operand 4 states. [2019-12-07 17:41:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:37,636 INFO L93 Difference]: Finished difference Result 136614 states and 606732 transitions. [2019-12-07 17:41:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:41:37,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:41:37,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:37,995 INFO L225 Difference]: With dead ends: 136614 [2019-12-07 17:41:37,995 INFO L226 Difference]: Without dead ends: 136550 [2019-12-07 17:41:37,996 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 17:41:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136550 states. [2019-12-07 17:41:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136550 to 133014. [2019-12-07 17:41:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133014 states. [2019-12-07 17:41:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133014 states to 133014 states and 593752 transitions. [2019-12-07 17:41:41,814 INFO L78 Accepts]: Start accepts. Automaton has 133014 states and 593752 transitions. Word has length 15 [2019-12-07 17:41:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:41,814 INFO L462 AbstractCegarLoop]: Abstraction has 133014 states and 593752 transitions. [2019-12-07 17:41:41,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:41:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 133014 states and 593752 transitions. [2019-12-07 17:41:41,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:41:41,820 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:41,820 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 17:41:41,820 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:41,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:41,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1496935772, now seen corresponding path program 1 times [2019-12-07 17:41:41,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:41,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715305191] [2019-12-07 17:41:41,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:41:41,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715305191] [2019-12-07 17:41:41,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:41,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:41:41,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840624711] [2019-12-07 17:41:41,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:41:41,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:41,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:41:41,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:41:41,867 INFO L87 Difference]: Start difference. First operand 133014 states and 593752 transitions. Second operand 4 states. [2019-12-07 17:41:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:43,085 INFO L93 Difference]: Finished difference Result 173334 states and 762780 transitions. [2019-12-07 17:41:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:41:43,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 17:41:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:43,598 INFO L225 Difference]: With dead ends: 173334 [2019-12-07 17:41:43,598 INFO L226 Difference]: Without dead ends: 173274 [2019-12-07 17:41:43,598 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 17:41:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173274 states. [2019-12-07 17:41:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173274 to 154858. [2019-12-07 17:41:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154858 states. [2019-12-07 17:41:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154858 states to 154858 states and 687340 transitions. [2019-12-07 17:41:50,111 INFO L78 Accepts]: Start accepts. Automaton has 154858 states and 687340 transitions. Word has length 18 [2019-12-07 17:41:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:50,111 INFO L462 AbstractCegarLoop]: Abstraction has 154858 states and 687340 transitions. [2019-12-07 17:41:50,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:41:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 154858 states and 687340 transitions. [2019-12-07 17:41:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:41:50,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:50,120 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 17:41:50,120 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:50,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:50,120 INFO L82 PathProgramCache]: Analyzing trace with hash -839601205, now seen corresponding path program 1 times [2019-12-07 17:41:50,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:50,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866930411] [2019-12-07 17:41:50,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:50,149 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 17:41:50,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866930411] [2019-12-07 17:41:50,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:50,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:41:50,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755026705] [2019-12-07 17:41:50,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:41:50,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:50,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:41:50,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:41:50,150 INFO L87 Difference]: Start difference. First operand 154858 states and 687340 transitions. Second operand 3 states. [2019-12-07 17:41:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:51,389 INFO L93 Difference]: Finished difference Result 260150 states and 1112960 transitions. [2019-12-07 17:41:51,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:41:51,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:41:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:52,121 INFO L225 Difference]: With dead ends: 260150 [2019-12-07 17:41:52,122 INFO L226 Difference]: Without dead ends: 260150 [2019-12-07 17:41:52,122 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 17:41:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260150 states. [2019-12-07 17:42:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260150 to 230750. [2019-12-07 17:42:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230750 states. [2019-12-07 17:42:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230750 states to 230750 states and 999636 transitions. [2019-12-07 17:42:01,328 INFO L78 Accepts]: Start accepts. Automaton has 230750 states and 999636 transitions. Word has length 19 [2019-12-07 17:42:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:01,329 INFO L462 AbstractCegarLoop]: Abstraction has 230750 states and 999636 transitions. [2019-12-07 17:42:01,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 230750 states and 999636 transitions. [2019-12-07 17:42:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:42:01,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:01,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:01,340 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:01,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:01,341 INFO L82 PathProgramCache]: Analyzing trace with hash -879634023, now seen corresponding path program 1 times [2019-12-07 17:42:01,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:01,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139689188] [2019-12-07 17:42:01,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:01,383 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 17:42:01,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139689188] [2019-12-07 17:42:01,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:01,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:01,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298973617] [2019-12-07 17:42:01,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:01,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:01,384 INFO L87 Difference]: Start difference. First operand 230750 states and 999636 transitions. Second operand 3 states. [2019-12-07 17:42:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:02,745 INFO L93 Difference]: Finished difference Result 217954 states and 932948 transitions. [2019-12-07 17:42:02,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:02,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:42:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:03,344 INFO L225 Difference]: With dead ends: 217954 [2019-12-07 17:42:03,344 INFO L226 Difference]: Without dead ends: 217954 [2019-12-07 17:42:03,345 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 17:42:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217954 states. [2019-12-07 17:42:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217954 to 215922. [2019-12-07 17:42:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215922 states. [2019-12-07 17:42:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215922 states to 215922 states and 925108 transitions. [2019-12-07 17:42:12,298 INFO L78 Accepts]: Start accepts. Automaton has 215922 states and 925108 transitions. Word has length 20 [2019-12-07 17:42:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,298 INFO L462 AbstractCegarLoop]: Abstraction has 215922 states and 925108 transitions. [2019-12-07 17:42:12,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 215922 states and 925108 transitions. [2019-12-07 17:42:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:42:12,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,307 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,307 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1900570736, now seen corresponding path program 1 times [2019-12-07 17:42:12,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145751136] [2019-12-07 17:42:12,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,343 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 17:42:12,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145751136] [2019-12-07 17:42:12,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:12,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922279366] [2019-12-07 17:42:12,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,344 INFO L87 Difference]: Start difference. First operand 215922 states and 925108 transitions. Second operand 3 states. [2019-12-07 17:42:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:13,013 INFO L93 Difference]: Finished difference Result 167157 states and 662558 transitions. [2019-12-07 17:42:13,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:13,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:42:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:13,409 INFO L225 Difference]: With dead ends: 167157 [2019-12-07 17:42:13,409 INFO L226 Difference]: Without dead ends: 167157 [2019-12-07 17:42:13,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167157 states. [2019-12-07 17:42:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167157 to 167157. [2019-12-07 17:42:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167157 states. [2019-12-07 17:42:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167157 states to 167157 states and 662558 transitions. [2019-12-07 17:42:17,853 INFO L78 Accepts]: Start accepts. Automaton has 167157 states and 662558 transitions. Word has length 20 [2019-12-07 17:42:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:17,853 INFO L462 AbstractCegarLoop]: Abstraction has 167157 states and 662558 transitions. [2019-12-07 17:42:17,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 167157 states and 662558 transitions. [2019-12-07 17:42:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:42:17,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:17,860 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:17,860 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:17,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1273919603, now seen corresponding path program 1 times [2019-12-07 17:42:17,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:17,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158267350] [2019-12-07 17:42:17,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:17,943 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 17:42:17,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158267350] [2019-12-07 17:42:17,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:17,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:17,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715924142] [2019-12-07 17:42:17,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:17,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:17,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:17,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:17,944 INFO L87 Difference]: Start difference. First operand 167157 states and 662558 transitions. Second operand 4 states. [2019-12-07 17:42:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:18,697 INFO L93 Difference]: Finished difference Result 187678 states and 729443 transitions. [2019-12-07 17:42:18,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:42:18,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 17:42:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:19,124 INFO L225 Difference]: With dead ends: 187678 [2019-12-07 17:42:19,124 INFO L226 Difference]: Without dead ends: 187204 [2019-12-07 17:42:19,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187204 states. [2019-12-07 17:42:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187204 to 185673. [2019-12-07 17:42:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185673 states. [2019-12-07 17:42:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185673 states to 185673 states and 724385 transitions. [2019-12-07 17:42:25,633 INFO L78 Accepts]: Start accepts. Automaton has 185673 states and 724385 transitions. Word has length 21 [2019-12-07 17:42:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:25,633 INFO L462 AbstractCegarLoop]: Abstraction has 185673 states and 724385 transitions. [2019-12-07 17:42:25,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 185673 states and 724385 transitions. [2019-12-07 17:42:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:42:25,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:25,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:25,642 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash 49865209, now seen corresponding path program 1 times [2019-12-07 17:42:25,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:25,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519502173] [2019-12-07 17:42:25,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:25,671 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 17:42:25,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519502173] [2019-12-07 17:42:25,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:25,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:42:25,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047273479] [2019-12-07 17:42:25,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:25,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:25,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:25,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:25,673 INFO L87 Difference]: Start difference. First operand 185673 states and 724385 transitions. Second operand 4 states. [2019-12-07 17:42:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:27,036 INFO L93 Difference]: Finished difference Result 231413 states and 893605 transitions. [2019-12-07 17:42:27,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:42:27,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 17:42:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:27,598 INFO L225 Difference]: With dead ends: 231413 [2019-12-07 17:42:27,598 INFO L226 Difference]: Without dead ends: 231362 [2019-12-07 17:42:27,598 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 17:42:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231362 states. [2019-12-07 17:42:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231362 to 188313. [2019-12-07 17:42:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188313 states. [2019-12-07 17:42:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188313 states to 188313 states and 734485 transitions. [2019-12-07 17:42:32,769 INFO L78 Accepts]: Start accepts. Automaton has 188313 states and 734485 transitions. Word has length 21 [2019-12-07 17:42:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:32,769 INFO L462 AbstractCegarLoop]: Abstraction has 188313 states and 734485 transitions. [2019-12-07 17:42:32,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 188313 states and 734485 transitions. [2019-12-07 17:42:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:42:32,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:32,791 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] [2019-12-07 17:42:32,791 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:32,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2135195515, now seen corresponding path program 1 times [2019-12-07 17:42:32,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:32,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059426890] [2019-12-07 17:42:32,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:32,833 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 17:42:32,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059426890] [2019-12-07 17:42:32,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:32,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:32,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34797479] [2019-12-07 17:42:32,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:32,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:32,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:32,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:32,834 INFO L87 Difference]: Start difference. First operand 188313 states and 734485 transitions. Second operand 5 states. [2019-12-07 17:42:34,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:34,666 INFO L93 Difference]: Finished difference Result 268870 states and 1029115 transitions. [2019-12-07 17:42:34,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:42:34,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 17:42:34,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:35,299 INFO L225 Difference]: With dead ends: 268870 [2019-12-07 17:42:35,299 INFO L226 Difference]: Without dead ends: 268827 [2019-12-07 17:42:35,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:42:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268827 states. [2019-12-07 17:42:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268827 to 205101. [2019-12-07 17:42:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205101 states. [2019-12-07 17:42:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205101 states to 205101 states and 798599 transitions. [2019-12-07 17:42:43,313 INFO L78 Accepts]: Start accepts. Automaton has 205101 states and 798599 transitions. Word has length 25 [2019-12-07 17:42:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:43,313 INFO L462 AbstractCegarLoop]: Abstraction has 205101 states and 798599 transitions. [2019-12-07 17:42:43,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:42:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 205101 states and 798599 transitions. [2019-12-07 17:42:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:42:43,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:43,363 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] [2019-12-07 17:42:43,363 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:43,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:43,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1370458192, now seen corresponding path program 1 times [2019-12-07 17:42:43,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:43,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986594530] [2019-12-07 17:42:43,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:43,389 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 17:42:43,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986594530] [2019-12-07 17:42:43,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:43,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:43,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141173504] [2019-12-07 17:42:43,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:43,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:43,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:43,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:43,390 INFO L87 Difference]: Start difference. First operand 205101 states and 798599 transitions. Second operand 4 states. [2019-12-07 17:42:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:43,673 INFO L93 Difference]: Finished difference Result 89057 states and 294437 transitions. [2019-12-07 17:42:43,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:42:43,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 17:42:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:43,819 INFO L225 Difference]: With dead ends: 89057 [2019-12-07 17:42:43,819 INFO L226 Difference]: Without dead ends: 89057 [2019-12-07 17:42:43,819 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 17:42:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89057 states. [2019-12-07 17:42:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89057 to 88857. [2019-12-07 17:42:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88857 states. [2019-12-07 17:42:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88857 states to 88857 states and 293791 transitions. [2019-12-07 17:42:45,694 INFO L78 Accepts]: Start accepts. Automaton has 88857 states and 293791 transitions. Word has length 28 [2019-12-07 17:42:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:45,694 INFO L462 AbstractCegarLoop]: Abstraction has 88857 states and 293791 transitions. [2019-12-07 17:42:45,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 88857 states and 293791 transitions. [2019-12-07 17:42:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:42:45,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:45,710 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 17:42:45,710 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1918625833, now seen corresponding path program 1 times [2019-12-07 17:42:45,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:45,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256713780] [2019-12-07 17:42:45,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:45,741 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 17:42:45,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256713780] [2019-12-07 17:42:45,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:45,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:42:45,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595400336] [2019-12-07 17:42:45,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:45,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:45,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:45,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:45,742 INFO L87 Difference]: Start difference. First operand 88857 states and 293791 transitions. Second operand 5 states. [2019-12-07 17:42:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:45,827 INFO L93 Difference]: Finished difference Result 22025 states and 68715 transitions. [2019-12-07 17:42:45,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:42:45,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 17:42:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:45,853 INFO L225 Difference]: With dead ends: 22025 [2019-12-07 17:42:45,853 INFO L226 Difference]: Without dead ends: 22025 [2019-12-07 17:42:45,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22025 states. [2019-12-07 17:42:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22025 to 20618. [2019-12-07 17:42:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20618 states. [2019-12-07 17:42:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20618 states to 20618 states and 64365 transitions. [2019-12-07 17:42:46,110 INFO L78 Accepts]: Start accepts. Automaton has 20618 states and 64365 transitions. Word has length 29 [2019-12-07 17:42:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:46,110 INFO L462 AbstractCegarLoop]: Abstraction has 20618 states and 64365 transitions. [2019-12-07 17:42:46,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:42:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 20618 states and 64365 transitions. [2019-12-07 17:42:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:42:46,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:46,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:46,121 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:46,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:46,121 INFO L82 PathProgramCache]: Analyzing trace with hash -289187602, now seen corresponding path program 1 times [2019-12-07 17:42:46,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:46,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643427679] [2019-12-07 17:42:46,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:46,145 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 17:42:46,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643427679] [2019-12-07 17:42:46,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:46,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:46,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485891468] [2019-12-07 17:42:46,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:46,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:46,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:46,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:46,146 INFO L87 Difference]: Start difference. First operand 20618 states and 64365 transitions. Second operand 3 states. [2019-12-07 17:42:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:46,461 INFO L93 Difference]: Finished difference Result 21890 states and 64641 transitions. [2019-12-07 17:42:46,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:46,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 17:42:46,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:46,484 INFO L225 Difference]: With dead ends: 21890 [2019-12-07 17:42:46,484 INFO L226 Difference]: Without dead ends: 21890 [2019-12-07 17:42:46,484 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 17:42:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21890 states. [2019-12-07 17:42:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21890 to 20699. [2019-12-07 17:42:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20699 states. [2019-12-07 17:42:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20699 states to 20699 states and 61668 transitions. [2019-12-07 17:42:46,734 INFO L78 Accepts]: Start accepts. Automaton has 20699 states and 61668 transitions. Word has length 37 [2019-12-07 17:42:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:46,735 INFO L462 AbstractCegarLoop]: Abstraction has 20699 states and 61668 transitions. [2019-12-07 17:42:46,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 20699 states and 61668 transitions. [2019-12-07 17:42:46,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:42:46,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:46,748 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] [2019-12-07 17:42:46,748 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1741884328, now seen corresponding path program 1 times [2019-12-07 17:42:46,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:46,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489525159] [2019-12-07 17:42:46,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:46,785 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 17:42:46,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489525159] [2019-12-07 17:42:46,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:46,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:42:46,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043611170] [2019-12-07 17:42:46,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:42:46,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:46,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:42:46,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:42:46,787 INFO L87 Difference]: Start difference. First operand 20699 states and 61668 transitions. Second operand 6 states. [2019-12-07 17:42:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:46,859 INFO L93 Difference]: Finished difference Result 17313 states and 54345 transitions. [2019-12-07 17:42:46,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:42:46,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 17:42:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:46,881 INFO L225 Difference]: With dead ends: 17313 [2019-12-07 17:42:46,882 INFO L226 Difference]: Without dead ends: 17274 [2019-12-07 17:42:46,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:42:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17274 states. [2019-12-07 17:42:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17274 to 14007. [2019-12-07 17:42:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14007 states. [2019-12-07 17:42:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14007 states to 14007 states and 45422 transitions. [2019-12-07 17:42:47,078 INFO L78 Accepts]: Start accepts. Automaton has 14007 states and 45422 transitions. Word has length 40 [2019-12-07 17:42:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:47,079 INFO L462 AbstractCegarLoop]: Abstraction has 14007 states and 45422 transitions. [2019-12-07 17:42:47,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:42:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 14007 states and 45422 transitions. [2019-12-07 17:42:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:42:47,096 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:47,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:47,097 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:47,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash 845814509, now seen corresponding path program 1 times [2019-12-07 17:42:47,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:47,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525278526] [2019-12-07 17:42:47,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:47,176 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 17:42:47,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525278526] [2019-12-07 17:42:47,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:47,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:47,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428796361] [2019-12-07 17:42:47,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:47,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:47,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:47,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:47,177 INFO L87 Difference]: Start difference. First operand 14007 states and 45422 transitions. Second operand 4 states. [2019-12-07 17:42:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:47,251 INFO L93 Difference]: Finished difference Result 18022 states and 54774 transitions. [2019-12-07 17:42:47,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:42:47,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 17:42:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:47,271 INFO L225 Difference]: With dead ends: 18022 [2019-12-07 17:42:47,271 INFO L226 Difference]: Without dead ends: 17090 [2019-12-07 17:42:47,272 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 17:42:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17090 states. [2019-12-07 17:42:47,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17090 to 13419. [2019-12-07 17:42:47,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13419 states. [2019-12-07 17:42:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13419 states to 13419 states and 43186 transitions. [2019-12-07 17:42:47,465 INFO L78 Accepts]: Start accepts. Automaton has 13419 states and 43186 transitions. Word has length 65 [2019-12-07 17:42:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:47,465 INFO L462 AbstractCegarLoop]: Abstraction has 13419 states and 43186 transitions. [2019-12-07 17:42:47,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 13419 states and 43186 transitions. [2019-12-07 17:42:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:42:47,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:47,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:47,479 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:47,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:47,480 INFO L82 PathProgramCache]: Analyzing trace with hash 936797461, now seen corresponding path program 2 times [2019-12-07 17:42:47,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:47,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048839362] [2019-12-07 17:42:47,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:47,526 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 17:42:47,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048839362] [2019-12-07 17:42:47,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:47,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:47,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30827373] [2019-12-07 17:42:47,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:47,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:47,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:47,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:47,527 INFO L87 Difference]: Start difference. First operand 13419 states and 43186 transitions. Second operand 4 states. [2019-12-07 17:42:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:47,579 INFO L93 Difference]: Finished difference Result 15300 states and 48146 transitions. [2019-12-07 17:42:47,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:42:47,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 17:42:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:47,591 INFO L225 Difference]: With dead ends: 15300 [2019-12-07 17:42:47,591 INFO L226 Difference]: Without dead ends: 8567 [2019-12-07 17:42:47,591 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 17:42:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8567 states. [2019-12-07 17:42:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8567 to 8567. [2019-12-07 17:42:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8567 states. [2019-12-07 17:42:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8567 states to 8567 states and 24974 transitions. [2019-12-07 17:42:47,691 INFO L78 Accepts]: Start accepts. Automaton has 8567 states and 24974 transitions. Word has length 65 [2019-12-07 17:42:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:47,691 INFO L462 AbstractCegarLoop]: Abstraction has 8567 states and 24974 transitions. [2019-12-07 17:42:47,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 8567 states and 24974 transitions. [2019-12-07 17:42:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:42:47,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:47,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:47,698 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:47,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash -503977731, now seen corresponding path program 3 times [2019-12-07 17:42:47,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:47,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532000993] [2019-12-07 17:42:47,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:47,792 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 17:42:47,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532000993] [2019-12-07 17:42:47,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:47,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:42:47,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416106634] [2019-12-07 17:42:47,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:42:47,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:47,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:42:47,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:42:47,793 INFO L87 Difference]: Start difference. First operand 8567 states and 24974 transitions. Second operand 7 states. [2019-12-07 17:42:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:47,987 INFO L93 Difference]: Finished difference Result 22434 states and 65185 transitions. [2019-12-07 17:42:47,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:42:47,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 17:42:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:48,002 INFO L225 Difference]: With dead ends: 22434 [2019-12-07 17:42:48,003 INFO L226 Difference]: Without dead ends: 14558 [2019-12-07 17:42:48,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:42:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14558 states. [2019-12-07 17:42:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14558 to 10925. [2019-12-07 17:42:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10925 states. [2019-12-07 17:42:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 30574 transitions. [2019-12-07 17:42:48,145 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 30574 transitions. Word has length 65 [2019-12-07 17:42:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:48,145 INFO L462 AbstractCegarLoop]: Abstraction has 10925 states and 30574 transitions. [2019-12-07 17:42:48,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:42:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 30574 transitions. [2019-12-07 17:42:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:42:48,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:48,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:48,154 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:48,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:48,154 INFO L82 PathProgramCache]: Analyzing trace with hash 85165569, now seen corresponding path program 4 times [2019-12-07 17:42:48,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:48,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983640629] [2019-12-07 17:42:48,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:48,213 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 17:42:48,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983640629] [2019-12-07 17:42:48,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:48,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:48,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362106380] [2019-12-07 17:42:48,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:48,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:48,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:48,215 INFO L87 Difference]: Start difference. First operand 10925 states and 30574 transitions. Second operand 4 states. [2019-12-07 17:42:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:48,271 INFO L93 Difference]: Finished difference Result 14798 states and 40063 transitions. [2019-12-07 17:42:48,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:42:48,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 17:42:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:48,285 INFO L225 Difference]: With dead ends: 14798 [2019-12-07 17:42:48,285 INFO L226 Difference]: Without dead ends: 12487 [2019-12-07 17:42:48,285 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 17:42:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12487 states. [2019-12-07 17:42:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12487 to 8703. [2019-12-07 17:42:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8703 states. [2019-12-07 17:42:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8703 states to 8703 states and 25336 transitions. [2019-12-07 17:42:48,406 INFO L78 Accepts]: Start accepts. Automaton has 8703 states and 25336 transitions. Word has length 65 [2019-12-07 17:42:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:48,406 INFO L462 AbstractCegarLoop]: Abstraction has 8703 states and 25336 transitions. [2019-12-07 17:42:48,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 8703 states and 25336 transitions. [2019-12-07 17:42:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:42:48,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:48,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:48,413 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:48,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:48,413 INFO L82 PathProgramCache]: Analyzing trace with hash -471122572, now seen corresponding path program 1 times [2019-12-07 17:42:48,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:48,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010347840] [2019-12-07 17:42:48,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:48,472 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 17:42:48,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010347840] [2019-12-07 17:42:48,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:48,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:48,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986327306] [2019-12-07 17:42:48,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:42:48,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:42:48,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:42:48,473 INFO L87 Difference]: Start difference. First operand 8703 states and 25336 transitions. Second operand 4 states. [2019-12-07 17:42:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:48,523 INFO L93 Difference]: Finished difference Result 9649 states and 27354 transitions. [2019-12-07 17:42:48,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:42:48,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 17:42:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:48,528 INFO L225 Difference]: With dead ends: 9649 [2019-12-07 17:42:48,528 INFO L226 Difference]: Without dead ends: 5275 [2019-12-07 17:42:48,528 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 17:42:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5275 states. [2019-12-07 17:42:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5275 to 5275. [2019-12-07 17:42:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5275 states. [2019-12-07 17:42:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 13372 transitions. [2019-12-07 17:42:48,579 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 13372 transitions. Word has length 66 [2019-12-07 17:42:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:48,579 INFO L462 AbstractCegarLoop]: Abstraction has 5275 states and 13372 transitions. [2019-12-07 17:42:48,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:42:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 13372 transitions. [2019-12-07 17:42:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:42:48,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:48,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:48,583 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:48,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2114275120, now seen corresponding path program 2 times [2019-12-07 17:42:48,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:48,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945836523] [2019-12-07 17:42:48,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:48,647 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 17:42:48,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945836523] [2019-12-07 17:42:48,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:48,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:42:48,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447842088] [2019-12-07 17:42:48,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:48,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:48,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:48,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:48,649 INFO L87 Difference]: Start difference. First operand 5275 states and 13372 transitions. Second operand 5 states. [2019-12-07 17:42:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:48,698 INFO L93 Difference]: Finished difference Result 5754 states and 14391 transitions. [2019-12-07 17:42:48,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:42:48,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 17:42:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:48,699 INFO L225 Difference]: With dead ends: 5754 [2019-12-07 17:42:48,699 INFO L226 Difference]: Without dead ends: 563 [2019-12-07 17:42:48,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:42:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-12-07 17:42:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-12-07 17:42:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-12-07 17:42:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1146 transitions. [2019-12-07 17:42:48,706 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1146 transitions. Word has length 66 [2019-12-07 17:42:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:48,706 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 1146 transitions. [2019-12-07 17:42:48,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:42:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1146 transitions. [2019-12-07 17:42:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:42:48,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:48,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:48,707 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:48,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:48,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1180004840, now seen corresponding path program 3 times [2019-12-07 17:42:48,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:48,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732963081] [2019-12-07 17:42:48,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:48,790 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 17:42:48,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732963081] [2019-12-07 17:42:48,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:48,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:42:48,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480086833] [2019-12-07 17:42:48,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:42:48,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:48,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:42:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:42:48,791 INFO L87 Difference]: Start difference. First operand 563 states and 1146 transitions. Second operand 7 states. [2019-12-07 17:42:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:48,978 INFO L93 Difference]: Finished difference Result 1103 states and 2244 transitions. [2019-12-07 17:42:48,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:42:48,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 17:42:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:48,979 INFO L225 Difference]: With dead ends: 1103 [2019-12-07 17:42:48,979 INFO L226 Difference]: Without dead ends: 804 [2019-12-07 17:42:48,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:42:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-12-07 17:42:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 616. [2019-12-07 17:42:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-12-07 17:42:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1237 transitions. [2019-12-07 17:42:48,984 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1237 transitions. Word has length 66 [2019-12-07 17:42:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:48,984 INFO L462 AbstractCegarLoop]: Abstraction has 616 states and 1237 transitions. [2019-12-07 17:42:48,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:42:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1237 transitions. [2019-12-07 17:42:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:42:48,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:48,985 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:48,985 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1474232984, now seen corresponding path program 4 times [2019-12-07 17:42:48,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:48,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826117864] [2019-12-07 17:42:48,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:42:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:42:49,064 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:42:49,064 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:42:49,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= v_~weak$$choice2~0_289 0) (= v_~z$r_buff0_thd0~0_178 0) (= 0 v_~z$r_buff1_thd3~0_386) (= v_~z~0_311 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_71) (= v_~__unbuffered_cnt~0_176 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t373~0.base_44| 4)) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t373~0.base_44| 1)) (= v_~main$tmp_guard0~0_25 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff0_thd2~0_95 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t373~0.base_44|)) (= v_~__unbuffered_p1_EBX~0_70 0) (= 0 v_~z$mem_tmp~0_209) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~z$r_buff1_thd1~0_163 0) (= v_~z$w_buff0~0_362 0) (= 0 v_~z$r_buff0_thd4~0_531) (= v_~z$r_buff0_thd1~0_95 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_196) (= 0 v_~z$flush_delayed~0_243) (= 0 v_~__unbuffered_p3_EBX~0_64) (= v_~z$w_buff0_used~0_937 0) (= 0 v_~__unbuffered_p2_EAX~0_86) (= v_~z$r_buff1_thd2~0_163 0) (= v_~z$w_buff1~0_247 0) (= 0 v_~z$r_buff0_thd3~0_403) (= v_~a~0_42 0) (= v_~z$w_buff1_used~0_682 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t373~0.base_44|) (= v_~y~0_58 0) (= 0 |v_ULTIMATE.start_main_~#t373~0.offset_28|) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t373~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t373~0.base_44|) |v_ULTIMATE.start_main_~#t373~0.offset_28| 0)) |v_#memory_int_29|) (= v_~z$r_buff1_thd0~0_268 0) (= v_~main$tmp_guard1~0_55 0) (= 0 v_~z$r_buff1_thd4~0_339) (= v_~x~0_88 0) (= 0 v_~__unbuffered_p3_EAX~0_71))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t374~0.base=|v_ULTIMATE.start_main_~#t374~0.base_36|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_~#t374~0.offset=|v_ULTIMATE.start_main_~#t374~0.offset_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_163, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_114|, ~a~0=v_~a~0_42, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_178, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_71, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_531, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_71, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ULTIMATE.start_main_~#t376~0.offset=|v_ULTIMATE.start_main_~#t376~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_209, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_682, ~z$flush_delayed~0=v_~z$flush_delayed~0_243, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_196, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_~#t375~0.offset=|v_ULTIMATE.start_main_~#t375~0.offset_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_202|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, ULTIMATE.start_main_~#t373~0.base=|v_ULTIMATE.start_main_~#t373~0.base_44|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_403, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_176, ~x~0=v_~x~0_88, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_339, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_247, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_55, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_~#t375~0.base=|v_ULTIMATE.start_main_~#t375~0.base_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_268, ULTIMATE.start_main_~#t373~0.offset=|v_ULTIMATE.start_main_~#t373~0.offset_28|, ~y~0=v_~y~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_937, ~z$w_buff0~0=v_~z$w_buff0~0_362, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_386, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_64, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_84|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_106|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~#t376~0.base=|v_ULTIMATE.start_main_~#t376~0.base_24|, ~z~0=v_~z~0_311, ~weak$$choice2~0=v_~weak$$choice2~0_289, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_95} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t374~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t374~0.offset, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t376~0.offset, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t375~0.offset, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t373~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t375~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t373~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t376~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:42:49,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L856-1-->L858: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t374~0.base_11|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t374~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t374~0.base_11|) |v_ULTIMATE.start_main_~#t374~0.offset_10| 1)) |v_#memory_int_21|) (= 0 |v_ULTIMATE.start_main_~#t374~0.offset_10|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t374~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t374~0.base_11|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t374~0.base_11| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t374~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t374~0.base=|v_ULTIMATE.start_main_~#t374~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t374~0.offset=|v_ULTIMATE.start_main_~#t374~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t374~0.base, ULTIMATE.start_main_~#t374~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:42:49,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L858-1-->L860: Formula: (and (not (= |v_ULTIMATE.start_main_~#t375~0.base_12| 0)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t375~0.base_12| 4)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t375~0.base_12| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t375~0.base_12|) 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t375~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t375~0.base_12|) |v_ULTIMATE.start_main_~#t375~0.offset_11| 2)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t375~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t375~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t375~0.offset=|v_ULTIMATE.start_main_~#t375~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t375~0.base=|v_ULTIMATE.start_main_~#t375~0.base_12|, #valid=|v_#valid_46|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t375~0.offset, ULTIMATE.start_main_~#t375~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 17:42:49,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L860-1-->L862: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t376~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t376~0.base_13|)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t376~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t376~0.offset_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t376~0.base_13|)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t376~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t376~0.base_13|) |v_ULTIMATE.start_main_~#t376~0.offset_11| 3)) |v_#memory_int_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t376~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t376~0.offset=|v_ULTIMATE.start_main_~#t376~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t376~0.base=|v_ULTIMATE.start_main_~#t376~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t376~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t376~0.base, #length] because there is no mapped edge [2019-12-07 17:42:49,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 0)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_6| v_P3Thread1of1ForFork2_~arg.offset_4) (= 1 v_~z$w_buff0~0_22) (= v_~z$w_buff0_used~0_90 1) (= v_~z$w_buff0~0_23 v_~z$w_buff1~0_19) (= v_~z$w_buff0_used~0_91 v_~z$w_buff1_used~0_52) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_90 256))) (not (= 0 (mod v_~z$w_buff1_used~0_52 256))))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= v_P3Thread1of1ForFork2_~arg.base_4 |v_P3Thread1of1ForFork2_#in~arg.base_6|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_4, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_52, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, ~z$w_buff1~0=v_~z$w_buff1~0_19, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_4, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 17:42:49,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L818-2-->L818-5: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1197094227 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1197094227 256))) (.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out1197094227| |P3Thread1of1ForFork2_#t~ite28_Out1197094227|))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out1197094227| ~z$w_buff0~0_In1197094227) (not .cse1) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out1197094227| ~z$w_buff1~0_In1197094227)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1197094227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1197094227, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1197094227, ~z$w_buff1~0=~z$w_buff1~0_In1197094227} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1197094227|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1197094227|, ~z$w_buff0~0=~z$w_buff0~0_In1197094227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1197094227, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1197094227, ~z$w_buff1~0=~z$w_buff1~0_In1197094227} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 17:42:49,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_102 v_~z$r_buff0_thd4~0_101) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:42:49,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-938404373 256) 0))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out-938404373| ~z~0_In-938404373)) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out-938404373| ~z$mem_tmp~0_In-938404373)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-938404373, ~z$flush_delayed~0=~z$flush_delayed~0_In-938404373, ~z~0=~z~0_In-938404373} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-938404373, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-938404373|, ~z$flush_delayed~0=~z$flush_delayed~0_In-938404373, ~z~0=~z~0_In-938404373} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 17:42:49,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~a~0_15 1) (= v_~x~0_24 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 17:42:49,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~__unbuffered_p1_EBX~0_22 v_~y~0_39) (= v_~x~0_28 2) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~x~0_28 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~y~0=v_~y~0_39} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 17:42:49,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-664869230 256)))) (or (and (= ~z$mem_tmp~0_In-664869230 |P2Thread1of1ForFork1_#t~ite25_Out-664869230|) (not .cse0)) (and .cse0 (= ~z~0_In-664869230 |P2Thread1of1ForFork1_#t~ite25_Out-664869230|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-664869230, ~z$flush_delayed~0=~z$flush_delayed~0_In-664869230, ~z~0=~z~0_In-664869230} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-664869230, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-664869230|, ~z$flush_delayed~0=~z$flush_delayed~0_In-664869230, ~z~0=~z~0_In-664869230} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:42:49,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1219958149 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1219958149 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out1219958149|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1219958149 |P3Thread1of1ForFork2_#t~ite51_Out1219958149|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1219958149, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1219958149} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out1219958149|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1219958149, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1219958149} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 17:42:49,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1967332163 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1967332163 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1967332163 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1967332163 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out-1967332163| ~z$w_buff1_used~0_In-1967332163) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite52_Out-1967332163| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1967332163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1967332163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1967332163} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1967332163|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1967332163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1967332163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1967332163} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 17:42:49,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L836-->L837: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out639777418 ~z$r_buff0_thd4~0_In639777418)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In639777418 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In639777418 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~z$r_buff0_thd4~0_Out639777418) (not .cse1) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In639777418, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In639777418} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out639777418|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In639777418, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out639777418} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:42:49,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-733514122 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-733514122 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-733514122 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-733514122 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite54_Out-733514122| ~z$r_buff1_thd4~0_In-733514122) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork2_#t~ite54_Out-733514122| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-733514122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-733514122, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-733514122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-733514122} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-733514122|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-733514122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-733514122, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-733514122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-733514122} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 17:42:49,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L837-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P3Thread1of1ForFork2_#t~ite54_42| v_~z$r_buff1_thd4~0_264) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_41|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_264, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:42:49,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L788-2-->P2EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_182) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~z~0_183 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~z$flush_delayed~0=v_~z$flush_delayed~0_182, ~z~0=v_~z~0_183, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:42:49,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L862-1-->L868: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_26) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:42:49,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L868-2-->L868-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In536644220 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In536644220 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite59_Out536644220| ~z$w_buff1~0_In536644220) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out536644220| ~z~0_In536644220)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In536644220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In536644220, ~z$w_buff1~0=~z$w_buff1~0_In536644220, ~z~0=~z~0_In536644220} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In536644220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In536644220, ~z$w_buff1~0=~z$w_buff1~0_In536644220, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out536644220|, ~z~0=~z~0_In536644220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:42:49,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L868-4-->L869: Formula: (= v_~z~0_104 |v_ULTIMATE.start_main_#t~ite59_32|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_32|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_31|, ~z~0=v_~z~0_104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:42:49,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In294839624 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In294839624 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out294839624| ~z$w_buff0_used~0_In294839624) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out294839624|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In294839624, ~z$w_buff0_used~0=~z$w_buff0_used~0_In294839624} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In294839624, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out294839624|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In294839624} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:42:49,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L870-->L870-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1806181958 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1806181958 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1806181958 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1806181958 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1806181958|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1806181958 |ULTIMATE.start_main_#t~ite62_Out-1806181958|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1806181958, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1806181958, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1806181958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1806181958} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1806181958|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1806181958, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1806181958, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1806181958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1806181958} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:42:49,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L871-->L871-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1619393664 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1619393664 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-1619393664 |ULTIMATE.start_main_#t~ite63_Out-1619393664|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out-1619393664| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1619393664, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1619393664} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1619393664|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1619393664, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1619393664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:42:49,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L872-->L872-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In569457847 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In569457847 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In569457847 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In569457847 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out569457847| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite64_Out569457847| ~z$r_buff1_thd0~0_In569457847) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In569457847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In569457847, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In569457847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569457847} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In569457847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In569457847, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In569457847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569457847, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out569457847|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:42:49,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_44 2) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 1 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p3_EBX~0_28))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_21 256)) (= v_~z$r_buff1_thd0~0_227 |v_ULTIMATE.start_main_#t~ite64_49|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_49|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_48|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:42:49,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:42:49 BasicIcfg [2019-12-07 17:42:49,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:42:49,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:42:49,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:42:49,151 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:42:49,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:41:18" (3/4) ... [2019-12-07 17:42:49,153 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:42:49,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= v_~weak$$choice2~0_289 0) (= v_~z$r_buff0_thd0~0_178 0) (= 0 v_~z$r_buff1_thd3~0_386) (= v_~z~0_311 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_71) (= v_~__unbuffered_cnt~0_176 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t373~0.base_44| 4)) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t373~0.base_44| 1)) (= v_~main$tmp_guard0~0_25 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff0_thd2~0_95 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t373~0.base_44|)) (= v_~__unbuffered_p1_EBX~0_70 0) (= 0 v_~z$mem_tmp~0_209) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~z$r_buff1_thd1~0_163 0) (= v_~z$w_buff0~0_362 0) (= 0 v_~z$r_buff0_thd4~0_531) (= v_~z$r_buff0_thd1~0_95 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_196) (= 0 v_~z$flush_delayed~0_243) (= 0 v_~__unbuffered_p3_EBX~0_64) (= v_~z$w_buff0_used~0_937 0) (= 0 v_~__unbuffered_p2_EAX~0_86) (= v_~z$r_buff1_thd2~0_163 0) (= v_~z$w_buff1~0_247 0) (= 0 v_~z$r_buff0_thd3~0_403) (= v_~a~0_42 0) (= v_~z$w_buff1_used~0_682 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t373~0.base_44|) (= v_~y~0_58 0) (= 0 |v_ULTIMATE.start_main_~#t373~0.offset_28|) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t373~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t373~0.base_44|) |v_ULTIMATE.start_main_~#t373~0.offset_28| 0)) |v_#memory_int_29|) (= v_~z$r_buff1_thd0~0_268 0) (= v_~main$tmp_guard1~0_55 0) (= 0 v_~z$r_buff1_thd4~0_339) (= v_~x~0_88 0) (= 0 v_~__unbuffered_p3_EAX~0_71))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t374~0.base=|v_ULTIMATE.start_main_~#t374~0.base_36|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_~#t374~0.offset=|v_ULTIMATE.start_main_~#t374~0.offset_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_163, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_114|, ~a~0=v_~a~0_42, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_178, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_71, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_531, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_71, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ULTIMATE.start_main_~#t376~0.offset=|v_ULTIMATE.start_main_~#t376~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_209, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_682, ~z$flush_delayed~0=v_~z$flush_delayed~0_243, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_196, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_~#t375~0.offset=|v_ULTIMATE.start_main_~#t375~0.offset_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_202|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, ULTIMATE.start_main_~#t373~0.base=|v_ULTIMATE.start_main_~#t373~0.base_44|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_403, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_176, ~x~0=v_~x~0_88, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_339, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_247, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_55, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_~#t375~0.base=|v_ULTIMATE.start_main_~#t375~0.base_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_268, ULTIMATE.start_main_~#t373~0.offset=|v_ULTIMATE.start_main_~#t373~0.offset_28|, ~y~0=v_~y~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_937, ~z$w_buff0~0=v_~z$w_buff0~0_362, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_386, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_64, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_84|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_106|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~#t376~0.base=|v_ULTIMATE.start_main_~#t376~0.base_24|, ~z~0=v_~z~0_311, ~weak$$choice2~0=v_~weak$$choice2~0_289, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_95} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t374~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t374~0.offset, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t376~0.offset, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t375~0.offset, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t373~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t375~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t373~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t376~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:42:49,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L856-1-->L858: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t374~0.base_11|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t374~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t374~0.base_11|) |v_ULTIMATE.start_main_~#t374~0.offset_10| 1)) |v_#memory_int_21|) (= 0 |v_ULTIMATE.start_main_~#t374~0.offset_10|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t374~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t374~0.base_11|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t374~0.base_11| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t374~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t374~0.base=|v_ULTIMATE.start_main_~#t374~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t374~0.offset=|v_ULTIMATE.start_main_~#t374~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t374~0.base, ULTIMATE.start_main_~#t374~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:42:49,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L858-1-->L860: Formula: (and (not (= |v_ULTIMATE.start_main_~#t375~0.base_12| 0)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t375~0.base_12| 4)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t375~0.base_12| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t375~0.base_12|) 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t375~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t375~0.base_12|) |v_ULTIMATE.start_main_~#t375~0.offset_11| 2)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t375~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t375~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t375~0.offset=|v_ULTIMATE.start_main_~#t375~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t375~0.base=|v_ULTIMATE.start_main_~#t375~0.base_12|, #valid=|v_#valid_46|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t375~0.offset, ULTIMATE.start_main_~#t375~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 17:42:49,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L860-1-->L862: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t376~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t376~0.base_13|)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t376~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t376~0.offset_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t376~0.base_13|)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t376~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t376~0.base_13|) |v_ULTIMATE.start_main_~#t376~0.offset_11| 3)) |v_#memory_int_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t376~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t376~0.offset=|v_ULTIMATE.start_main_~#t376~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t376~0.base=|v_ULTIMATE.start_main_~#t376~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t376~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t376~0.base, #length] because there is no mapped edge [2019-12-07 17:42:49,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 0)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_6| v_P3Thread1of1ForFork2_~arg.offset_4) (= 1 v_~z$w_buff0~0_22) (= v_~z$w_buff0_used~0_90 1) (= v_~z$w_buff0~0_23 v_~z$w_buff1~0_19) (= v_~z$w_buff0_used~0_91 v_~z$w_buff1_used~0_52) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_90 256))) (not (= 0 (mod v_~z$w_buff1_used~0_52 256))))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= v_P3Thread1of1ForFork2_~arg.base_4 |v_P3Thread1of1ForFork2_#in~arg.base_6|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_4, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_52, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, ~z$w_buff1~0=v_~z$w_buff1~0_19, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_4, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 17:42:49,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L818-2-->L818-5: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1197094227 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1197094227 256))) (.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out1197094227| |P3Thread1of1ForFork2_#t~ite28_Out1197094227|))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out1197094227| ~z$w_buff0~0_In1197094227) (not .cse1) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out1197094227| ~z$w_buff1~0_In1197094227)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1197094227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1197094227, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1197094227, ~z$w_buff1~0=~z$w_buff1~0_In1197094227} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1197094227|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1197094227|, ~z$w_buff0~0=~z$w_buff0~0_In1197094227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1197094227, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1197094227, ~z$w_buff1~0=~z$w_buff1~0_In1197094227} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 17:42:49,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_102 v_~z$r_buff0_thd4~0_101) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:42:49,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-938404373 256) 0))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out-938404373| ~z~0_In-938404373)) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out-938404373| ~z$mem_tmp~0_In-938404373)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-938404373, ~z$flush_delayed~0=~z$flush_delayed~0_In-938404373, ~z~0=~z~0_In-938404373} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-938404373, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-938404373|, ~z$flush_delayed~0=~z$flush_delayed~0_In-938404373, ~z~0=~z~0_In-938404373} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 17:42:49,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~a~0_15 1) (= v_~x~0_24 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 17:42:49,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~__unbuffered_p1_EBX~0_22 v_~y~0_39) (= v_~x~0_28 2) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~x~0_28 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~y~0=v_~y~0_39} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 17:42:49,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-664869230 256)))) (or (and (= ~z$mem_tmp~0_In-664869230 |P2Thread1of1ForFork1_#t~ite25_Out-664869230|) (not .cse0)) (and .cse0 (= ~z~0_In-664869230 |P2Thread1of1ForFork1_#t~ite25_Out-664869230|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-664869230, ~z$flush_delayed~0=~z$flush_delayed~0_In-664869230, ~z~0=~z~0_In-664869230} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-664869230, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-664869230|, ~z$flush_delayed~0=~z$flush_delayed~0_In-664869230, ~z~0=~z~0_In-664869230} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:42:49,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1219958149 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1219958149 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out1219958149|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1219958149 |P3Thread1of1ForFork2_#t~ite51_Out1219958149|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1219958149, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1219958149} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out1219958149|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1219958149, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1219958149} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 17:42:49,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1967332163 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1967332163 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1967332163 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1967332163 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out-1967332163| ~z$w_buff1_used~0_In-1967332163) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite52_Out-1967332163| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1967332163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1967332163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1967332163} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1967332163|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1967332163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1967332163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1967332163} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 17:42:49,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L836-->L837: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out639777418 ~z$r_buff0_thd4~0_In639777418)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In639777418 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In639777418 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~z$r_buff0_thd4~0_Out639777418) (not .cse1) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In639777418, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In639777418} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out639777418|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In639777418, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out639777418} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:42:49,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-733514122 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-733514122 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-733514122 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-733514122 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite54_Out-733514122| ~z$r_buff1_thd4~0_In-733514122) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork2_#t~ite54_Out-733514122| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-733514122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-733514122, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-733514122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-733514122} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-733514122|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-733514122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-733514122, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-733514122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-733514122} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 17:42:49,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L837-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P3Thread1of1ForFork2_#t~ite54_42| v_~z$r_buff1_thd4~0_264) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_41|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_264, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:42:49,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L788-2-->P2EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_182) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~z~0_183 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~z$flush_delayed~0=v_~z$flush_delayed~0_182, ~z~0=v_~z~0_183, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:42:49,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L862-1-->L868: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_26) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:42:49,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L868-2-->L868-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In536644220 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In536644220 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite59_Out536644220| ~z$w_buff1~0_In536644220) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out536644220| ~z~0_In536644220)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In536644220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In536644220, ~z$w_buff1~0=~z$w_buff1~0_In536644220, ~z~0=~z~0_In536644220} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In536644220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In536644220, ~z$w_buff1~0=~z$w_buff1~0_In536644220, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out536644220|, ~z~0=~z~0_In536644220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:42:49,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L868-4-->L869: Formula: (= v_~z~0_104 |v_ULTIMATE.start_main_#t~ite59_32|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_32|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_31|, ~z~0=v_~z~0_104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:42:49,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In294839624 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In294839624 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out294839624| ~z$w_buff0_used~0_In294839624) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out294839624|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In294839624, ~z$w_buff0_used~0=~z$w_buff0_used~0_In294839624} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In294839624, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out294839624|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In294839624} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:42:49,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L870-->L870-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1806181958 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1806181958 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1806181958 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1806181958 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1806181958|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1806181958 |ULTIMATE.start_main_#t~ite62_Out-1806181958|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1806181958, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1806181958, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1806181958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1806181958} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1806181958|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1806181958, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1806181958, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1806181958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1806181958} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:42:49,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L871-->L871-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1619393664 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1619393664 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-1619393664 |ULTIMATE.start_main_#t~ite63_Out-1619393664|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out-1619393664| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1619393664, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1619393664} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1619393664|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1619393664, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1619393664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:42:49,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L872-->L872-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In569457847 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In569457847 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In569457847 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In569457847 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out569457847| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite64_Out569457847| ~z$r_buff1_thd0~0_In569457847) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In569457847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In569457847, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In569457847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569457847} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In569457847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In569457847, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In569457847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569457847, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out569457847|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:42:49,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_44 2) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 1 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p3_EBX~0_28))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_21 256)) (= v_~z$r_buff1_thd0~0_227 |v_ULTIMATE.start_main_#t~ite64_49|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_49|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_48|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:42:49,235 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6da257bb-1ead-43d9-bcc3-e284d38304d3/bin/uautomizer/witness.graphml [2019-12-07 17:42:49,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:42:49,237 INFO L168 Benchmark]: Toolchain (without parser) took 92092.71 ms. Allocated memory was 1.0 GB in the beginning and 8.0 GB in the end (delta: 7.0 GB). Free memory was 938.3 MB in the beginning and 5.2 GB in the end (delta: -4.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 17:42:49,237 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:42:49,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -123.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:49,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.84 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 17:42:49,237 INFO L168 Benchmark]: Boogie Preprocessor took 27.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 17:42:49,238 INFO L168 Benchmark]: RCFGBuilder took 452.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.3 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:49,238 INFO L168 Benchmark]: TraceAbstraction took 91053.09 ms. Allocated memory was 1.1 GB in the beginning and 8.0 GB in the end (delta: 6.9 GB). Free memory was 994.3 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-12-07 17:42:49,238 INFO L168 Benchmark]: Witness Printer took 84.38 ms. Allocated memory is still 8.0 GB. Free memory was 5.3 GB in the beginning and 5.2 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:49,240 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 430.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -123.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.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. * RCFGBuilder took 452.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.3 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 91053.09 ms. Allocated memory was 1.1 GB in the beginning and 8.0 GB in the end (delta: 6.9 GB). Free memory was 994.3 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 84.38 ms. Allocated memory is still 8.0 GB. Free memory was 5.3 GB in the beginning and 5.2 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 212 ProgramPointsBefore, 114 ProgramPointsAfterwards, 255 TransitionsBefore, 134 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11004 VarBasedMoverChecksPositive, 332 VarBasedMoverChecksNegative, 88 SemBasedMoverChecksPositive, 353 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 147467 CheckedPairsTotal, 131 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t373, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t374, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t375, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t376, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 3 y = 1 [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L868] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 90.8s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3977 SDtfs, 5329 SDslu, 6130 SDs, 0 SdLazy, 1495 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230750occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 58.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 179031 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 826 NumberOfCodeBlocks, 826 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 283014 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...