./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/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 c5f9a31035ac6c4c6792387a60affe460fa7bdf9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:50:42,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:50:42,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:50:42,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:50:42,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:50:42,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:50:42,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:50:42,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:50:42,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:50:42,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:50:42,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:50:42,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:50:42,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:50:42,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:50:42,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:50:42,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:50:42,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:50:42,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:50:42,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:50:42,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:50:42,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:50:42,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:50:42,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:50:42,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:50:42,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:50:42,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:50:42,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:50:42,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:50:42,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:50:42,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:50:42,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:50:42,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:50:42,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:50:42,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:50:42,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:50:42,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:50:42,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:50:42,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:50:42,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:50:42,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:50:42,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:50:42,564 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:50:42,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:50:42,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:50:42,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:50:42,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:50:42,578 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:50:42,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:50:42,579 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:50:42,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:50:42,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:50:42,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:50:42,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:50:42,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:50:42,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:50:42,580 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:50:42,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:50:42,580 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:50:42,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:50:42,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:50:42,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:50:42,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:50:42,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:50:42,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:50:42,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:50:42,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:50:42,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:50:42,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:50:42,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:50:42,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:50:42,583 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:50:42,583 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_44ad3b13-af8c-473e-9640-a127d0ce7536/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 -> c5f9a31035ac6c4c6792387a60affe460fa7bdf9 [2019-12-07 10:50:42,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:50:42,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:50:42,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:50:42,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:50:42,703 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:50:42,703 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix019_pso.opt.i [2019-12-07 10:50:42,739 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/bin/uautomizer/data/601f50eb3/bfbbd99778cc49d3bbab80b443a9ba13/FLAG2fa126b67 [2019-12-07 10:50:43,214 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:50:43,215 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/sv-benchmarks/c/pthread-wmm/mix019_pso.opt.i [2019-12-07 10:50:43,225 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/bin/uautomizer/data/601f50eb3/bfbbd99778cc49d3bbab80b443a9ba13/FLAG2fa126b67 [2019-12-07 10:50:43,234 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/bin/uautomizer/data/601f50eb3/bfbbd99778cc49d3bbab80b443a9ba13 [2019-12-07 10:50:43,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:50:43,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:50:43,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:50:43,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:50:43,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:50:43,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:50:43" (1/1) ... [2019-12-07 10:50:43,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1693e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43, skipping insertion in model container [2019-12-07 10:50:43,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:50:43" (1/1) ... [2019-12-07 10:50:43,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:50:43,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:50:43,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:50:43,605 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:50:43,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:50:43,711 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:50:43,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43 WrapperNode [2019-12-07 10:50:43,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:50:43,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:50:43,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:50:43,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:50:43,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43" (1/1) ... [2019-12-07 10:50:43,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43" (1/1) ... [2019-12-07 10:50:43,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:50:43,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:50:43,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:50:43,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:50:43,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43" (1/1) ... [2019-12-07 10:50:43,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43" (1/1) ... [2019-12-07 10:50:43,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43" (1/1) ... [2019-12-07 10:50:43,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43" (1/1) ... [2019-12-07 10:50:43,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43" (1/1) ... [2019-12-07 10:50:43,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43" (1/1) ... [2019-12-07 10:50:43,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43" (1/1) ... [2019-12-07 10:50:43,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:50:43,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:50:43,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:50:43,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:50:43,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/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 10:50:43,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:50:43,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:50:43,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:50:43,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:50:43,829 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:50:43,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:50:43,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:50:43,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:50:43,830 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:50:43,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:50:43,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:50:43,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:50:43,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:50:43,831 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 10:50:44,221 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:50:44,221 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:50:44,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:50:44 BoogieIcfgContainer [2019-12-07 10:50:44,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:50:44,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:50:44,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:50:44,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:50:44,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:50:43" (1/3) ... [2019-12-07 10:50:44,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b39d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:50:44, skipping insertion in model container [2019-12-07 10:50:44,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:50:43" (2/3) ... [2019-12-07 10:50:44,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b39d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:50:44, skipping insertion in model container [2019-12-07 10:50:44,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:50:44" (3/3) ... [2019-12-07 10:50:44,227 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_pso.opt.i [2019-12-07 10:50:44,233 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:50:44,233 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:50:44,238 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:50:44,238 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:50:44,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,268 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,268 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:50:44,302 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:50:44,314 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:50:44,314 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:50:44,314 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:50:44,314 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:50:44,314 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:50:44,314 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:50:44,314 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:50:44,314 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:50:44,325 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 240 transitions [2019-12-07 10:50:44,326 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 194 places, 240 transitions [2019-12-07 10:50:44,388 INFO L134 PetriNetUnfolder]: 56/237 cut-off events. [2019-12-07 10:50:44,388 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:50:44,402 INFO L76 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 237 events. 56/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 915 event pairs. 9/188 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 10:50:44,421 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 194 places, 240 transitions [2019-12-07 10:50:44,458 INFO L134 PetriNetUnfolder]: 56/237 cut-off events. [2019-12-07 10:50:44,458 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:50:44,466 INFO L76 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 237 events. 56/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 915 event pairs. 9/188 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 10:50:44,490 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 10:50:44,490 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:50:47,707 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 10:50:47,858 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128329 [2019-12-07 10:50:47,858 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-07 10:50:47,861 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 131 transitions [2019-12-07 10:50:51,042 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 48994 states. [2019-12-07 10:50:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 48994 states. [2019-12-07 10:50:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:50:51,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:50:51,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:50:51,049 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:50:51,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:50:51,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1376992094, now seen corresponding path program 1 times [2019-12-07 10:50:51,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:50:51,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732192713] [2019-12-07 10:50:51,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:50:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:51,209 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 10:50:51,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732192713] [2019-12-07 10:50:51,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:50:51,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:50:51,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89838214] [2019-12-07 10:50:51,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:50:51,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:50:51,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:50:51,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:50:51,224 INFO L87 Difference]: Start difference. First operand 48994 states. Second operand 3 states. [2019-12-07 10:50:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:50:51,689 INFO L93 Difference]: Finished difference Result 48562 states and 198786 transitions. [2019-12-07 10:50:51,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:50:51,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:50:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:50:51,965 INFO L225 Difference]: With dead ends: 48562 [2019-12-07 10:50:51,965 INFO L226 Difference]: Without dead ends: 45454 [2019-12-07 10:50:51,966 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 10:50:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45454 states. [2019-12-07 10:50:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45454 to 45454. [2019-12-07 10:50:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45454 states. [2019-12-07 10:50:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45454 states to 45454 states and 185938 transitions. [2019-12-07 10:50:53,636 INFO L78 Accepts]: Start accepts. Automaton has 45454 states and 185938 transitions. Word has length 7 [2019-12-07 10:50:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:50:53,637 INFO L462 AbstractCegarLoop]: Abstraction has 45454 states and 185938 transitions. [2019-12-07 10:50:53,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:50:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 45454 states and 185938 transitions. [2019-12-07 10:50:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:50:53,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:50:53,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:50:53,644 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:50:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:50:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash -694250741, now seen corresponding path program 1 times [2019-12-07 10:50:53,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:50:53,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004653880] [2019-12-07 10:50:53,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:50:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:53,723 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 10:50:53,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004653880] [2019-12-07 10:50:53,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:50:53,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:50:53,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433381542] [2019-12-07 10:50:53,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:50:53,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:50:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:50:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:50:53,726 INFO L87 Difference]: Start difference. First operand 45454 states and 185938 transitions. Second operand 4 states. [2019-12-07 10:50:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:50:54,238 INFO L93 Difference]: Finished difference Result 70498 states and 277512 transitions. [2019-12-07 10:50:54,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:50:54,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:50:54,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:50:54,465 INFO L225 Difference]: With dead ends: 70498 [2019-12-07 10:50:54,465 INFO L226 Difference]: Without dead ends: 70464 [2019-12-07 10:50:54,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:50:55,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70464 states. [2019-12-07 10:50:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70464 to 68586. [2019-12-07 10:50:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68586 states. [2019-12-07 10:50:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68586 states to 68586 states and 271564 transitions. [2019-12-07 10:50:56,457 INFO L78 Accepts]: Start accepts. Automaton has 68586 states and 271564 transitions. Word has length 13 [2019-12-07 10:50:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:50:56,457 INFO L462 AbstractCegarLoop]: Abstraction has 68586 states and 271564 transitions. [2019-12-07 10:50:56,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:50:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 68586 states and 271564 transitions. [2019-12-07 10:50:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:50:56,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:50:56,462 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:50:56,462 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:50:56,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:50:56,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1574256306, now seen corresponding path program 1 times [2019-12-07 10:50:56,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:50:56,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484829075] [2019-12-07 10:50:56,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:50:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:56,505 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 10:50:56,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484829075] [2019-12-07 10:50:56,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:50:56,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:50:56,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755302650] [2019-12-07 10:50:56,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:50:56,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:50:56,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:50:56,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:50:56,506 INFO L87 Difference]: Start difference. First operand 68586 states and 271564 transitions. Second operand 4 states. [2019-12-07 10:50:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:50:56,990 INFO L93 Difference]: Finished difference Result 86148 states and 336751 transitions. [2019-12-07 10:50:56,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:50:56,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:50:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:50:57,173 INFO L225 Difference]: With dead ends: 86148 [2019-12-07 10:50:57,173 INFO L226 Difference]: Without dead ends: 86120 [2019-12-07 10:50:57,174 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 10:50:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86120 states. [2019-12-07 10:51:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86120 to 77624. [2019-12-07 10:51:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77624 states. [2019-12-07 10:51:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77624 states to 77624 states and 306129 transitions. [2019-12-07 10:51:00,356 INFO L78 Accepts]: Start accepts. Automaton has 77624 states and 306129 transitions. Word has length 16 [2019-12-07 10:51:00,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:00,357 INFO L462 AbstractCegarLoop]: Abstraction has 77624 states and 306129 transitions. [2019-12-07 10:51:00,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:51:00,357 INFO L276 IsEmpty]: Start isEmpty. Operand 77624 states and 306129 transitions. [2019-12-07 10:51:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:51:00,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:00,364 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 10:51:00,364 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:00,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1845190065, now seen corresponding path program 1 times [2019-12-07 10:51:00,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:00,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488845998] [2019-12-07 10:51:00,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:00,411 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 10:51:00,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488845998] [2019-12-07 10:51:00,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:00,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:51:00,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860117827] [2019-12-07 10:51:00,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:51:00,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:00,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:51:00,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:51:00,412 INFO L87 Difference]: Start difference. First operand 77624 states and 306129 transitions. Second operand 3 states. [2019-12-07 10:51:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:00,696 INFO L93 Difference]: Finished difference Result 73470 states and 286144 transitions. [2019-12-07 10:51:00,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:51:00,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:51:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:00,850 INFO L225 Difference]: With dead ends: 73470 [2019-12-07 10:51:00,850 INFO L226 Difference]: Without dead ends: 73470 [2019-12-07 10:51:00,850 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 10:51:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73470 states. [2019-12-07 10:51:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73470 to 73210. [2019-12-07 10:51:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73210 states. [2019-12-07 10:51:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73210 states to 73210 states and 285306 transitions. [2019-12-07 10:51:02,788 INFO L78 Accepts]: Start accepts. Automaton has 73210 states and 285306 transitions. Word has length 18 [2019-12-07 10:51:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:02,788 INFO L462 AbstractCegarLoop]: Abstraction has 73210 states and 285306 transitions. [2019-12-07 10:51:02,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:51:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 73210 states and 285306 transitions. [2019-12-07 10:51:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:51:02,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:02,792 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 10:51:02,792 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:02,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:02,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1908707647, now seen corresponding path program 1 times [2019-12-07 10:51:02,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:02,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590781653] [2019-12-07 10:51:02,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:02,843 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 10:51:02,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590781653] [2019-12-07 10:51:02,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:02,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:51:02,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202509394] [2019-12-07 10:51:02,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:51:02,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:02,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:51:02,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:51:02,845 INFO L87 Difference]: Start difference. First operand 73210 states and 285306 transitions. Second operand 3 states. [2019-12-07 10:51:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:03,257 INFO L93 Difference]: Finished difference Result 109140 states and 404313 transitions. [2019-12-07 10:51:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:51:03,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:51:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:03,490 INFO L225 Difference]: With dead ends: 109140 [2019-12-07 10:51:03,490 INFO L226 Difference]: Without dead ends: 108666 [2019-12-07 10:51:03,490 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 10:51:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108666 states. [2019-12-07 10:51:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108666 to 105508. [2019-12-07 10:51:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105508 states. [2019-12-07 10:51:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105508 states to 105508 states and 394901 transitions. [2019-12-07 10:51:06,148 INFO L78 Accepts]: Start accepts. Automaton has 105508 states and 394901 transitions. Word has length 18 [2019-12-07 10:51:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:06,149 INFO L462 AbstractCegarLoop]: Abstraction has 105508 states and 394901 transitions. [2019-12-07 10:51:06,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:51:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 105508 states and 394901 transitions. [2019-12-07 10:51:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:51:06,156 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:06,156 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 10:51:06,156 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:06,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:06,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1181742338, now seen corresponding path program 1 times [2019-12-07 10:51:06,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:06,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799657721] [2019-12-07 10:51:06,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:06,185 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 10:51:06,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799657721] [2019-12-07 10:51:06,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:06,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:51:06,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957642718] [2019-12-07 10:51:06,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:51:06,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:51:06,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:51:06,186 INFO L87 Difference]: Start difference. First operand 105508 states and 394901 transitions. Second operand 3 states. [2019-12-07 10:51:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:06,563 INFO L93 Difference]: Finished difference Result 69284 states and 237073 transitions. [2019-12-07 10:51:06,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:51:06,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 10:51:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:06,679 INFO L225 Difference]: With dead ends: 69284 [2019-12-07 10:51:06,679 INFO L226 Difference]: Without dead ends: 69284 [2019-12-07 10:51:06,679 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 10:51:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69284 states. [2019-12-07 10:51:07,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69284 to 69284. [2019-12-07 10:51:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69284 states. [2019-12-07 10:51:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69284 states to 69284 states and 237073 transitions. [2019-12-07 10:51:08,009 INFO L78 Accepts]: Start accepts. Automaton has 69284 states and 237073 transitions. Word has length 19 [2019-12-07 10:51:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:08,009 INFO L462 AbstractCegarLoop]: Abstraction has 69284 states and 237073 transitions. [2019-12-07 10:51:08,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:51:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 69284 states and 237073 transitions. [2019-12-07 10:51:08,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:51:08,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:08,015 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 10:51:08,015 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:08,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:08,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1662799879, now seen corresponding path program 1 times [2019-12-07 10:51:08,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:08,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387961845] [2019-12-07 10:51:08,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:08,051 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 10:51:08,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387961845] [2019-12-07 10:51:08,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:08,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:51:08,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893287644] [2019-12-07 10:51:08,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:51:08,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:08,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:51:08,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:51:08,053 INFO L87 Difference]: Start difference. First operand 69284 states and 237073 transitions. Second operand 4 states. [2019-12-07 10:51:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:08,090 INFO L93 Difference]: Finished difference Result 8583 states and 23454 transitions. [2019-12-07 10:51:08,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:51:08,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 10:51:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:08,099 INFO L225 Difference]: With dead ends: 8583 [2019-12-07 10:51:08,099 INFO L226 Difference]: Without dead ends: 8583 [2019-12-07 10:51:08,099 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 10:51:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8583 states. [2019-12-07 10:51:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8583 to 7199. [2019-12-07 10:51:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7199 states. [2019-12-07 10:51:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7199 states to 7199 states and 19720 transitions. [2019-12-07 10:51:08,190 INFO L78 Accepts]: Start accepts. Automaton has 7199 states and 19720 transitions. Word has length 20 [2019-12-07 10:51:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:08,190 INFO L462 AbstractCegarLoop]: Abstraction has 7199 states and 19720 transitions. [2019-12-07 10:51:08,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:51:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 7199 states and 19720 transitions. [2019-12-07 10:51:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:51:08,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:08,195 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] [2019-12-07 10:51:08,195 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:08,195 INFO L82 PathProgramCache]: Analyzing trace with hash 664454488, now seen corresponding path program 1 times [2019-12-07 10:51:08,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:08,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935336881] [2019-12-07 10:51:08,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:08,240 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 10:51:08,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935336881] [2019-12-07 10:51:08,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:08,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:51:08,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887789910] [2019-12-07 10:51:08,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:51:08,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:08,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:51:08,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:51:08,241 INFO L87 Difference]: Start difference. First operand 7199 states and 19720 transitions. Second operand 5 states. [2019-12-07 10:51:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:08,495 INFO L93 Difference]: Finished difference Result 8171 states and 21707 transitions. [2019-12-07 10:51:08,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:51:08,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 10:51:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:08,502 INFO L225 Difference]: With dead ends: 8171 [2019-12-07 10:51:08,503 INFO L226 Difference]: Without dead ends: 8170 [2019-12-07 10:51:08,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:51:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2019-12-07 10:51:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 7672. [2019-12-07 10:51:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7672 states. [2019-12-07 10:51:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7672 states to 7672 states and 20727 transitions. [2019-12-07 10:51:08,583 INFO L78 Accepts]: Start accepts. Automaton has 7672 states and 20727 transitions. Word has length 31 [2019-12-07 10:51:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:08,584 INFO L462 AbstractCegarLoop]: Abstraction has 7672 states and 20727 transitions. [2019-12-07 10:51:08,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:51:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 7672 states and 20727 transitions. [2019-12-07 10:51:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 10:51:08,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:08,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:08,590 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:08,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:08,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1349756052, now seen corresponding path program 1 times [2019-12-07 10:51:08,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:08,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453673571] [2019-12-07 10:51:08,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:08,625 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 10:51:08,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453673571] [2019-12-07 10:51:08,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:08,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:51:08,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16225209] [2019-12-07 10:51:08,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:51:08,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:08,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:51:08,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:51:08,626 INFO L87 Difference]: Start difference. First operand 7672 states and 20727 transitions. Second operand 5 states. [2019-12-07 10:51:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:08,654 INFO L93 Difference]: Finished difference Result 5055 states and 14675 transitions. [2019-12-07 10:51:08,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:51:08,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 10:51:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:08,660 INFO L225 Difference]: With dead ends: 5055 [2019-12-07 10:51:08,660 INFO L226 Difference]: Without dead ends: 5016 [2019-12-07 10:51:08,660 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 10:51:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5016 states. [2019-12-07 10:51:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5016 to 4289. [2019-12-07 10:51:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4289 states. [2019-12-07 10:51:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 12931 transitions. [2019-12-07 10:51:08,715 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 12931 transitions. Word has length 36 [2019-12-07 10:51:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:08,715 INFO L462 AbstractCegarLoop]: Abstraction has 4289 states and 12931 transitions. [2019-12-07 10:51:08,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:51:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 12931 transitions. [2019-12-07 10:51:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:51:08,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:08,721 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:08,721 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:08,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:08,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1263962261, now seen corresponding path program 1 times [2019-12-07 10:51:08,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:08,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872450983] [2019-12-07 10:51:08,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:08,800 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 10:51:08,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872450983] [2019-12-07 10:51:08,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:08,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:51:08,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341594990] [2019-12-07 10:51:08,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:51:08,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:08,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:51:08,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:51:08,801 INFO L87 Difference]: Start difference. First operand 4289 states and 12931 transitions. Second operand 4 states. [2019-12-07 10:51:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:08,959 INFO L93 Difference]: Finished difference Result 4901 states and 14575 transitions. [2019-12-07 10:51:08,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:51:08,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 10:51:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:08,964 INFO L225 Difference]: With dead ends: 4901 [2019-12-07 10:51:08,965 INFO L226 Difference]: Without dead ends: 4901 [2019-12-07 10:51:08,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:51:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2019-12-07 10:51:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 4833. [2019-12-07 10:51:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4833 states. [2019-12-07 10:51:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 14385 transitions. [2019-12-07 10:51:09,019 INFO L78 Accepts]: Start accepts. Automaton has 4833 states and 14385 transitions. Word has length 62 [2019-12-07 10:51:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:09,019 INFO L462 AbstractCegarLoop]: Abstraction has 4833 states and 14385 transitions. [2019-12-07 10:51:09,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:51:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4833 states and 14385 transitions. [2019-12-07 10:51:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:51:09,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:09,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:09,025 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1677278569, now seen corresponding path program 2 times [2019-12-07 10:51:09,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:09,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946942283] [2019-12-07 10:51:09,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:09,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946942283] [2019-12-07 10:51:09,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:09,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:51:09,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127946522] [2019-12-07 10:51:09,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:51:09,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:09,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:51:09,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:51:09,124 INFO L87 Difference]: Start difference. First operand 4833 states and 14385 transitions. Second operand 6 states. [2019-12-07 10:51:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:09,392 INFO L93 Difference]: Finished difference Result 6628 states and 19573 transitions. [2019-12-07 10:51:09,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:51:09,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 10:51:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:09,400 INFO L225 Difference]: With dead ends: 6628 [2019-12-07 10:51:09,400 INFO L226 Difference]: Without dead ends: 6628 [2019-12-07 10:51:09,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:51:09,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6628 states. [2019-12-07 10:51:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6628 to 5296. [2019-12-07 10:51:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5296 states. [2019-12-07 10:51:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 15776 transitions. [2019-12-07 10:51:09,468 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 15776 transitions. Word has length 62 [2019-12-07 10:51:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:09,468 INFO L462 AbstractCegarLoop]: Abstraction has 5296 states and 15776 transitions. [2019-12-07 10:51:09,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:51:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 15776 transitions. [2019-12-07 10:51:09,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:51:09,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:09,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:09,475 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:09,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:09,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1554599097, now seen corresponding path program 3 times [2019-12-07 10:51:09,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:09,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12654986] [2019-12-07 10:51:09,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:09,556 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 10:51:09,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12654986] [2019-12-07 10:51:09,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:09,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:51:09,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044299818] [2019-12-07 10:51:09,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:51:09,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:09,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:51:09,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:51:09,557 INFO L87 Difference]: Start difference. First operand 5296 states and 15776 transitions. Second operand 7 states. [2019-12-07 10:51:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:09,730 INFO L93 Difference]: Finished difference Result 11177 states and 32791 transitions. [2019-12-07 10:51:09,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:51:09,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 10:51:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:09,745 INFO L225 Difference]: With dead ends: 11177 [2019-12-07 10:51:09,745 INFO L226 Difference]: Without dead ends: 10127 [2019-12-07 10:51:09,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:51:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10127 states. [2019-12-07 10:51:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10127 to 7934. [2019-12-07 10:51:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7934 states. [2019-12-07 10:51:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7934 states to 7934 states and 24139 transitions. [2019-12-07 10:51:09,864 INFO L78 Accepts]: Start accepts. Automaton has 7934 states and 24139 transitions. Word has length 62 [2019-12-07 10:51:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:09,864 INFO L462 AbstractCegarLoop]: Abstraction has 7934 states and 24139 transitions. [2019-12-07 10:51:09,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:51:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 7934 states and 24139 transitions. [2019-12-07 10:51:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:51:09,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:09,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:09,874 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1789429231, now seen corresponding path program 4 times [2019-12-07 10:51:09,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:09,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129819695] [2019-12-07 10:51:09,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:09,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129819695] [2019-12-07 10:51:09,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:09,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:51:09,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260159215] [2019-12-07 10:51:09,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:51:09,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:09,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:51:09,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:51:09,926 INFO L87 Difference]: Start difference. First operand 7934 states and 24139 transitions. Second operand 4 states. [2019-12-07 10:51:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:09,957 INFO L93 Difference]: Finished difference Result 8520 states and 25477 transitions. [2019-12-07 10:51:09,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:51:09,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 10:51:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:09,961 INFO L225 Difference]: With dead ends: 8520 [2019-12-07 10:51:09,961 INFO L226 Difference]: Without dead ends: 3007 [2019-12-07 10:51:09,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:51:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2019-12-07 10:51:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2019-12-07 10:51:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3007 states. [2019-12-07 10:51:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 7771 transitions. [2019-12-07 10:51:09,992 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 7771 transitions. Word has length 62 [2019-12-07 10:51:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:09,992 INFO L462 AbstractCegarLoop]: Abstraction has 3007 states and 7771 transitions. [2019-12-07 10:51:09,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:51:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 7771 transitions. [2019-12-07 10:51:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:51:09,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:09,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:09,995 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:09,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:09,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1516979920, now seen corresponding path program 1 times [2019-12-07 10:51:09,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:09,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705320989] [2019-12-07 10:51:09,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:10,177 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 10:51:10,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705320989] [2019-12-07 10:51:10,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:10,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:51:10,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106963699] [2019-12-07 10:51:10,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:51:10,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:10,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:51:10,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:51:10,179 INFO L87 Difference]: Start difference. First operand 3007 states and 7771 transitions. Second operand 13 states. [2019-12-07 10:51:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:11,316 INFO L93 Difference]: Finished difference Result 7446 states and 19135 transitions. [2019-12-07 10:51:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 10:51:11,317 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2019-12-07 10:51:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:11,322 INFO L225 Difference]: With dead ends: 7446 [2019-12-07 10:51:11,322 INFO L226 Difference]: Without dead ends: 6296 [2019-12-07 10:51:11,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-12-07 10:51:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6296 states. [2019-12-07 10:51:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6296 to 4364. [2019-12-07 10:51:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4364 states. [2019-12-07 10:51:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4364 states to 4364 states and 11330 transitions. [2019-12-07 10:51:11,373 INFO L78 Accepts]: Start accepts. Automaton has 4364 states and 11330 transitions. Word has length 63 [2019-12-07 10:51:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:11,373 INFO L462 AbstractCegarLoop]: Abstraction has 4364 states and 11330 transitions. [2019-12-07 10:51:11,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:51:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 4364 states and 11330 transitions. [2019-12-07 10:51:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:51:11,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:11,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:11,378 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:11,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1519691002, now seen corresponding path program 2 times [2019-12-07 10:51:11,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:11,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928097507] [2019-12-07 10:51:11,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:11,443 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 10:51:11,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928097507] [2019-12-07 10:51:11,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:11,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:51:11,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348558112] [2019-12-07 10:51:11,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:51:11,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:11,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:51:11,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:51:11,445 INFO L87 Difference]: Start difference. First operand 4364 states and 11330 transitions. Second operand 4 states. [2019-12-07 10:51:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:11,470 INFO L93 Difference]: Finished difference Result 4849 states and 12429 transitions. [2019-12-07 10:51:11,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:51:11,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 10:51:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:11,471 INFO L225 Difference]: With dead ends: 4849 [2019-12-07 10:51:11,471 INFO L226 Difference]: Without dead ends: 572 [2019-12-07 10:51:11,472 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 10:51:11,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-12-07 10:51:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-12-07 10:51:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-07 10:51:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1231 transitions. [2019-12-07 10:51:11,477 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1231 transitions. Word has length 63 [2019-12-07 10:51:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:11,477 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 1231 transitions. [2019-12-07 10:51:11,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:51:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1231 transitions. [2019-12-07 10:51:11,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:51:11,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:11,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:11,478 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:11,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:11,478 INFO L82 PathProgramCache]: Analyzing trace with hash 78017404, now seen corresponding path program 3 times [2019-12-07 10:51:11,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:11,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830892650] [2019-12-07 10:51:11,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:11,548 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 10:51:11,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830892650] [2019-12-07 10:51:11,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:51:11,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:51:11,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157968542] [2019-12-07 10:51:11,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:51:11,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:51:11,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:51:11,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:51:11,549 INFO L87 Difference]: Start difference. First operand 572 states and 1231 transitions. Second operand 8 states. [2019-12-07 10:51:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:11,729 INFO L93 Difference]: Finished difference Result 1035 states and 2208 transitions. [2019-12-07 10:51:11,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:51:11,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 10:51:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:11,730 INFO L225 Difference]: With dead ends: 1035 [2019-12-07 10:51:11,730 INFO L226 Difference]: Without dead ends: 760 [2019-12-07 10:51:11,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:51:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-12-07 10:51:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 596. [2019-12-07 10:51:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-07 10:51:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1276 transitions. [2019-12-07 10:51:11,735 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1276 transitions. Word has length 63 [2019-12-07 10:51:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:11,736 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1276 transitions. [2019-12-07 10:51:11,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:51:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1276 transitions. [2019-12-07 10:51:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:51:11,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:11,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:11,737 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:51:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1479252612, now seen corresponding path program 4 times [2019-12-07 10:51:11,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:51:11,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268360108] [2019-12-07 10:51:11,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:51:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:51:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:51:11,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:51:11,810 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:51:11,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~y$r_buff1_thd2~0_356) (= v_~y$r_buff0_thd0~0_194 0) (= v_~y$r_buff1_thd1~0_192 0) (= v_~y$w_buff1_used~0_559 0) (= v_~y$r_buff0_thd1~0_121 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_350) (= v_~y~0_367 0) (= v_~main$tmp_guard1~0_26 0) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$w_buff1~0_262 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_244 0) (= 0 v_~__unbuffered_p1_EAX~0_43) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t506~0.base_24| 4)) (= v_~y$mem_tmp~0_237 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t506~0.base_24|) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~__unbuffered_p2_EAX~0_29) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t506~0.base_24| 1)) (= 0 v_~y$r_buff0_thd2~0_368) (= (select .cse0 |v_ULTIMATE.start_main_~#t506~0.base_24|) 0) (= v_~y$w_buff0_used~0_898 0) (= |v_ULTIMATE.start_main_~#t506~0.offset_17| 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~weak$$choice0~0_225) (= v_~y$flush_delayed~0_303 0) (= v_~z~0_25 0) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~x~0_65 0) (= v_~weak$$choice2~0_304 0) (= v_~__unbuffered_cnt~0_157 0) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t506~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t506~0.base_24|) |v_ULTIMATE.start_main_~#t506~0.offset_17| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff0_thd3~0_578))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_19|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t506~0.base=|v_ULTIMATE.start_main_~#t506~0.base_24|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t506~0.offset=|v_ULTIMATE.start_main_~#t506~0.offset_17|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_237, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_350, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_121, ~y$flush_delayed~0=v_~y$flush_delayed~0_303, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_~#t507~0.offset=|v_ULTIMATE.start_main_~#t507~0.offset_17|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_91|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~weak$$choice0~0=v_~weak$$choice0~0_225, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_203|, ~y$w_buff1~0=v_~y$w_buff1~0_262, ULTIMATE.start_main_~#t508~0.offset=|v_ULTIMATE.start_main_~#t508~0.offset_17|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_368, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_244, ~x~0=v_~x~0_65, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_898, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_192, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_578, ~y~0=v_~y~0_367, ULTIMATE.start_main_~#t508~0.base=|v_ULTIMATE.start_main_~#t508~0.base_23|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_151|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_356, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_209|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_194, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_304, ULTIMATE.start_main_~#t507~0.base=|v_ULTIMATE.start_main_~#t507~0.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t506~0.base, #NULL.offset, ULTIMATE.start_main_~#t506~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t507~0.offset, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ULTIMATE.start_main_~#t508~0.offset, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t508~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t507~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:51:11,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L828-1-->L830: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t507~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t507~0.offset_10| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t507~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t507~0.base_12| 1)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t507~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t507~0.base_12|) |v_ULTIMATE.start_main_~#t507~0.offset_10| 1))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t507~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t507~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t507~0.offset=|v_ULTIMATE.start_main_~#t507~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t507~0.base=|v_ULTIMATE.start_main_~#t507~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t507~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t507~0.base] because there is no mapped edge [2019-12-07 10:51:11,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L830-1-->L832: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t508~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t508~0.base_13|) |v_ULTIMATE.start_main_~#t508~0.offset_11| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t508~0.base_13|)) (= |v_ULTIMATE.start_main_~#t508~0.offset_11| 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t508~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t508~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t508~0.base_13|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t508~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t508~0.offset=|v_ULTIMATE.start_main_~#t508~0.offset_11|, #valid=|v_#valid_38|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t508~0.base=|v_ULTIMATE.start_main_~#t508~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t508~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t508~0.base, #length] because there is no mapped edge [2019-12-07 10:51:11,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork2_#in~arg.base_15| v_P2Thread1of1ForFork2_~arg.base_13) (= 1 v_~y$w_buff0~0_40) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_110 1) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_63 256) 0)) (not (= (mod v_~y$w_buff0_used~0_110 256) 0)))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15)) (= v_P2Thread1of1ForFork2_~arg.offset_13 |v_P2Thread1of1ForFork2_#in~arg.offset_15|) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_111)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_29, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_13, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_13, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:51:11,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L790-2-->L790-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork2_#t~ite28_Out1967555288| |P2Thread1of1ForFork2_#t~ite29_Out1967555288|)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1967555288 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1967555288 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite28_Out1967555288| ~y$w_buff0~0_In1967555288)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out1967555288| ~y$w_buff1~0_In1967555288) .cse2 (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1967555288, ~y$w_buff1~0=~y$w_buff1~0_In1967555288, ~y$w_buff0~0=~y$w_buff0~0_In1967555288, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1967555288} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1967555288, ~y$w_buff1~0=~y$w_buff1~0_In1967555288, ~y$w_buff0~0=~y$w_buff0~0_In1967555288, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1967555288, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1967555288|, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1967555288|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 10:51:11,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L795-->L796: Formula: (and (= v_~y$r_buff0_thd3~0_209 v_~y$r_buff0_thd3~0_210) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_210, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork2_#t~ite42=|v_P2Thread1of1ForFork2_#t~ite42_6|, P2Thread1of1ForFork2_#t~ite44=|v_P2Thread1of1ForFork2_#t~ite44_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_209, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42, P2Thread1of1ForFork2_#t~ite44, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 10:51:11,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1269756463 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite48_Out1269756463| ~y$mem_tmp~0_In1269756463)) (and (= |P2Thread1of1ForFork2_#t~ite48_Out1269756463| ~y~0_In1269756463) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1269756463, ~y$flush_delayed~0=~y$flush_delayed~0_In1269756463, ~y~0=~y~0_In1269756463} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1269756463, P2Thread1of1ForFork2_#t~ite48=|P2Thread1of1ForFork2_#t~ite48_Out1269756463|, ~y$flush_delayed~0=~y$flush_delayed~0_In1269756463, ~y~0=~y~0_In1269756463} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 10:51:11,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_7|) (= v_P0Thread1of1ForFork0_~arg.offset_9 |v_P0Thread1of1ForFork0_#in~arg.offset_11|) (= v_~z~0_17 1) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_138 (+ v_~__unbuffered_cnt~0_139 1)) (= v_P0Thread1of1ForFork0_~arg.base_9 |v_P0Thread1of1ForFork0_#in~arg.base_11|) (= v_~x~0_49 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ~z~0=v_~z~0_17, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_9, ~x~0=v_~x~0_49, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 10:51:11,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In692409917 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In692409917 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite51_Out692409917| ~y$w_buff0_used~0_In692409917)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite51_Out692409917| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In692409917, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In692409917} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In692409917, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In692409917, P2Thread1of1ForFork2_#t~ite51=|P2Thread1of1ForFork2_#t~ite51_Out692409917|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 10:51:11,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L807-->L807-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-953908077 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-953908077 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-953908077 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-953908077 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite52_Out-953908077| ~y$w_buff1_used~0_In-953908077) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite52_Out-953908077|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-953908077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-953908077, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-953908077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-953908077} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-953908077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-953908077, P2Thread1of1ForFork2_#t~ite52=|P2Thread1of1ForFork2_#t~ite52_Out-953908077|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-953908077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-953908077} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 10:51:11,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L808-->L809: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2085751336 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In2085751336 ~y$r_buff0_thd3~0_Out2085751336)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In2085751336 256) 0))) (or (and (= 0 ~y$r_buff0_thd3~0_Out2085751336) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2085751336, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2085751336} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2085751336, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2085751336, P2Thread1of1ForFork2_#t~ite53=|P2Thread1of1ForFork2_#t~ite53_Out2085751336|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite53] because there is no mapped edge [2019-12-07 10:51:11,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1730714153 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1730714153 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1730714153 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1730714153 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In-1730714153 |P2Thread1of1ForFork2_#t~ite54_Out-1730714153|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite54_Out-1730714153|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1730714153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730714153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1730714153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730714153} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1730714153, P2Thread1of1ForFork2_#t~ite54=|P2Thread1of1ForFork2_#t~ite54_Out-1730714153|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730714153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1730714153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730714153} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 10:51:11,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L809-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_124 (+ v_~__unbuffered_cnt~0_125 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite54_32| v_~y$r_buff1_thd3~0_249)) InVars {P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_249, P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite54, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 10:51:11,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1576214246 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite25_Out-1576214246| ~y~0_In-1576214246)) (and (= |P1Thread1of1ForFork1_#t~ite25_Out-1576214246| ~y$mem_tmp~0_In-1576214246) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1576214246, ~y$flush_delayed~0=~y$flush_delayed~0_In-1576214246, ~y~0=~y~0_In-1576214246} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1576214246, ~y$flush_delayed~0=~y$flush_delayed~0_In-1576214246, ~y~0=~y~0_In-1576214246, P1Thread1of1ForFork1_#t~ite25=|P1Thread1of1ForFork1_#t~ite25_Out-1576214246|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 10:51:11,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L761-2-->P1EXIT: Formula: (and (= v_~y~0_274 |v_P1Thread1of1ForFork1_#t~ite25_116|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$flush_delayed~0_269 0) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_148 (+ v_~__unbuffered_cnt~0_149 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_116|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~y~0=v_~y~0_274, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_115|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 10:51:11,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L832-1-->L838: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_11 256))) (= v_~main$tmp_guard0~0_11 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_70) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:51:11,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L838-2-->L838-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2126790116 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2126790116 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out2126790116| ~y$w_buff1~0_In2126790116)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite58_Out2126790116| ~y~0_In2126790116)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2126790116, ~y~0=~y~0_In2126790116, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2126790116, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2126790116} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2126790116, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out2126790116|, ~y~0=~y~0_In2126790116, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2126790116, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2126790116} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58] because there is no mapped edge [2019-12-07 10:51:11,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L838-4-->L839: Formula: (= v_~y~0_42 |v_ULTIMATE.start_main_#t~ite58_10|) InVars {ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_9|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_15|, ~y~0=v_~y~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59, ~y~0] because there is no mapped edge [2019-12-07 10:51:11,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1339375596 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1339375596 256)))) (or (and (= ~y$w_buff0_used~0_In1339375596 |ULTIMATE.start_main_#t~ite60_Out1339375596|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out1339375596|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1339375596, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1339375596} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1339375596|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1339375596, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1339375596} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:51:11,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L840-->L840-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In595443597 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In595443597 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In595443597 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In595443597 256) 0))) (or (and (= ~y$w_buff1_used~0_In595443597 |ULTIMATE.start_main_#t~ite61_Out595443597|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out595443597|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In595443597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In595443597, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In595443597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In595443597} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out595443597|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In595443597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In595443597, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In595443597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In595443597} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:51:11,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1554229536 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1554229536 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-1554229536 |ULTIMATE.start_main_#t~ite62_Out-1554229536|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-1554229536| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1554229536, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1554229536} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1554229536|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1554229536, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1554229536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:51:11,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L842-->L842-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-1834318382 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1834318382 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1834318382 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1834318382 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-1834318382| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out-1834318382| ~y$r_buff1_thd0~0_In-1834318382) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1834318382, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1834318382, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1834318382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1834318382} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1834318382|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1834318382, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1834318382, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1834318382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1834318382} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:51:11,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_59 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~y$r_buff1_thd0~0_234 |v_ULTIMATE.start_main_#t~ite63_45|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_44|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_234, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:51:11,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:51:11 BasicIcfg [2019-12-07 10:51:11,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:51:11,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:51:11,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:51:11,886 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:51:11,886 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:50:44" (3/4) ... [2019-12-07 10:51:11,888 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:51:11,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~y$r_buff1_thd2~0_356) (= v_~y$r_buff0_thd0~0_194 0) (= v_~y$r_buff1_thd1~0_192 0) (= v_~y$w_buff1_used~0_559 0) (= v_~y$r_buff0_thd1~0_121 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_350) (= v_~y~0_367 0) (= v_~main$tmp_guard1~0_26 0) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$w_buff1~0_262 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_244 0) (= 0 v_~__unbuffered_p1_EAX~0_43) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t506~0.base_24| 4)) (= v_~y$mem_tmp~0_237 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t506~0.base_24|) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~__unbuffered_p2_EAX~0_29) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t506~0.base_24| 1)) (= 0 v_~y$r_buff0_thd2~0_368) (= (select .cse0 |v_ULTIMATE.start_main_~#t506~0.base_24|) 0) (= v_~y$w_buff0_used~0_898 0) (= |v_ULTIMATE.start_main_~#t506~0.offset_17| 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~weak$$choice0~0_225) (= v_~y$flush_delayed~0_303 0) (= v_~z~0_25 0) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard0~0_22 0) (= v_~x~0_65 0) (= v_~weak$$choice2~0_304 0) (= v_~__unbuffered_cnt~0_157 0) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t506~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t506~0.base_24|) |v_ULTIMATE.start_main_~#t506~0.offset_17| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff0_thd3~0_578))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_19|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t506~0.base=|v_ULTIMATE.start_main_~#t506~0.base_24|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t506~0.offset=|v_ULTIMATE.start_main_~#t506~0.offset_17|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_237, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_350, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_121, ~y$flush_delayed~0=v_~y$flush_delayed~0_303, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_~#t507~0.offset=|v_ULTIMATE.start_main_~#t507~0.offset_17|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_91|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~weak$$choice0~0=v_~weak$$choice0~0_225, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_203|, ~y$w_buff1~0=v_~y$w_buff1~0_262, ULTIMATE.start_main_~#t508~0.offset=|v_ULTIMATE.start_main_~#t508~0.offset_17|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_368, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_244, ~x~0=v_~x~0_65, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_898, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_192, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_578, ~y~0=v_~y~0_367, ULTIMATE.start_main_~#t508~0.base=|v_ULTIMATE.start_main_~#t508~0.base_23|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_151|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_356, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_209|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_194, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_304, ULTIMATE.start_main_~#t507~0.base=|v_ULTIMATE.start_main_~#t507~0.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t506~0.base, #NULL.offset, ULTIMATE.start_main_~#t506~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t507~0.offset, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ULTIMATE.start_main_~#t508~0.offset, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t508~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t507~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:51:11,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L828-1-->L830: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t507~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t507~0.offset_10| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t507~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t507~0.base_12| 1)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t507~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t507~0.base_12|) |v_ULTIMATE.start_main_~#t507~0.offset_10| 1))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t507~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t507~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t507~0.offset=|v_ULTIMATE.start_main_~#t507~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t507~0.base=|v_ULTIMATE.start_main_~#t507~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t507~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t507~0.base] because there is no mapped edge [2019-12-07 10:51:11,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L830-1-->L832: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t508~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t508~0.base_13|) |v_ULTIMATE.start_main_~#t508~0.offset_11| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t508~0.base_13|)) (= |v_ULTIMATE.start_main_~#t508~0.offset_11| 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t508~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t508~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t508~0.base_13|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t508~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t508~0.offset=|v_ULTIMATE.start_main_~#t508~0.offset_11|, #valid=|v_#valid_38|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t508~0.base=|v_ULTIMATE.start_main_~#t508~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t508~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t508~0.base, #length] because there is no mapped edge [2019-12-07 10:51:11,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork2_#in~arg.base_15| v_P2Thread1of1ForFork2_~arg.base_13) (= 1 v_~y$w_buff0~0_40) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_110 1) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_63 256) 0)) (not (= (mod v_~y$w_buff0_used~0_110 256) 0)))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15)) (= v_P2Thread1of1ForFork2_~arg.offset_13 |v_P2Thread1of1ForFork2_#in~arg.offset_15|) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_111)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_29, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_13, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_13, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_13|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_15, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:51:11,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L790-2-->L790-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork2_#t~ite28_Out1967555288| |P2Thread1of1ForFork2_#t~ite29_Out1967555288|)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1967555288 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1967555288 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite28_Out1967555288| ~y$w_buff0~0_In1967555288)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out1967555288| ~y$w_buff1~0_In1967555288) .cse2 (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1967555288, ~y$w_buff1~0=~y$w_buff1~0_In1967555288, ~y$w_buff0~0=~y$w_buff0~0_In1967555288, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1967555288} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1967555288, ~y$w_buff1~0=~y$w_buff1~0_In1967555288, ~y$w_buff0~0=~y$w_buff0~0_In1967555288, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1967555288, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1967555288|, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1967555288|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 10:51:11,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L795-->L796: Formula: (and (= v_~y$r_buff0_thd3~0_209 v_~y$r_buff0_thd3~0_210) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_210, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork2_#t~ite42=|v_P2Thread1of1ForFork2_#t~ite42_6|, P2Thread1of1ForFork2_#t~ite44=|v_P2Thread1of1ForFork2_#t~ite44_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_209, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42, P2Thread1of1ForFork2_#t~ite44, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 10:51:11,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1269756463 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite48_Out1269756463| ~y$mem_tmp~0_In1269756463)) (and (= |P2Thread1of1ForFork2_#t~ite48_Out1269756463| ~y~0_In1269756463) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1269756463, ~y$flush_delayed~0=~y$flush_delayed~0_In1269756463, ~y~0=~y~0_In1269756463} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1269756463, P2Thread1of1ForFork2_#t~ite48=|P2Thread1of1ForFork2_#t~ite48_Out1269756463|, ~y$flush_delayed~0=~y$flush_delayed~0_In1269756463, ~y~0=~y~0_In1269756463} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 10:51:11,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_7|) (= v_P0Thread1of1ForFork0_~arg.offset_9 |v_P0Thread1of1ForFork0_#in~arg.offset_11|) (= v_~z~0_17 1) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_138 (+ v_~__unbuffered_cnt~0_139 1)) (= v_P0Thread1of1ForFork0_~arg.base_9 |v_P0Thread1of1ForFork0_#in~arg.base_11|) (= v_~x~0_49 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ~z~0=v_~z~0_17, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_9, ~x~0=v_~x~0_49, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 10:51:11,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In692409917 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In692409917 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite51_Out692409917| ~y$w_buff0_used~0_In692409917)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite51_Out692409917| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In692409917, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In692409917} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In692409917, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In692409917, P2Thread1of1ForFork2_#t~ite51=|P2Thread1of1ForFork2_#t~ite51_Out692409917|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 10:51:11,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L807-->L807-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-953908077 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-953908077 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-953908077 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-953908077 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite52_Out-953908077| ~y$w_buff1_used~0_In-953908077) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite52_Out-953908077|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-953908077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-953908077, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-953908077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-953908077} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-953908077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-953908077, P2Thread1of1ForFork2_#t~ite52=|P2Thread1of1ForFork2_#t~ite52_Out-953908077|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-953908077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-953908077} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 10:51:11,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L808-->L809: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2085751336 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In2085751336 ~y$r_buff0_thd3~0_Out2085751336)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In2085751336 256) 0))) (or (and (= 0 ~y$r_buff0_thd3~0_Out2085751336) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2085751336, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2085751336} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2085751336, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2085751336, P2Thread1of1ForFork2_#t~ite53=|P2Thread1of1ForFork2_#t~ite53_Out2085751336|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite53] because there is no mapped edge [2019-12-07 10:51:11,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1730714153 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1730714153 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1730714153 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1730714153 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In-1730714153 |P2Thread1of1ForFork2_#t~ite54_Out-1730714153|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite54_Out-1730714153|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1730714153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730714153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1730714153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730714153} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1730714153, P2Thread1of1ForFork2_#t~ite54=|P2Thread1of1ForFork2_#t~ite54_Out-1730714153|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730714153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1730714153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730714153} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 10:51:11,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L809-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_124 (+ v_~__unbuffered_cnt~0_125 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite54_32| v_~y$r_buff1_thd3~0_249)) InVars {P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_249, P2Thread1of1ForFork2_#t~ite54=|v_P2Thread1of1ForFork2_#t~ite54_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite54, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 10:51:11,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1576214246 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite25_Out-1576214246| ~y~0_In-1576214246)) (and (= |P1Thread1of1ForFork1_#t~ite25_Out-1576214246| ~y$mem_tmp~0_In-1576214246) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1576214246, ~y$flush_delayed~0=~y$flush_delayed~0_In-1576214246, ~y~0=~y~0_In-1576214246} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1576214246, ~y$flush_delayed~0=~y$flush_delayed~0_In-1576214246, ~y~0=~y~0_In-1576214246, P1Thread1of1ForFork1_#t~ite25=|P1Thread1of1ForFork1_#t~ite25_Out-1576214246|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 10:51:11,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L761-2-->P1EXIT: Formula: (and (= v_~y~0_274 |v_P1Thread1of1ForFork1_#t~ite25_116|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$flush_delayed~0_269 0) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_148 (+ v_~__unbuffered_cnt~0_149 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_116|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~y~0=v_~y~0_274, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_115|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 10:51:11,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L832-1-->L838: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_11 256))) (= v_~main$tmp_guard0~0_11 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_70) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:51:11,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L838-2-->L838-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2126790116 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2126790116 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out2126790116| ~y$w_buff1~0_In2126790116)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite58_Out2126790116| ~y~0_In2126790116)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2126790116, ~y~0=~y~0_In2126790116, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2126790116, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2126790116} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2126790116, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out2126790116|, ~y~0=~y~0_In2126790116, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2126790116, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2126790116} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58] because there is no mapped edge [2019-12-07 10:51:11,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L838-4-->L839: Formula: (= v_~y~0_42 |v_ULTIMATE.start_main_#t~ite58_10|) InVars {ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_9|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_15|, ~y~0=v_~y~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59, ~y~0] because there is no mapped edge [2019-12-07 10:51:11,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1339375596 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1339375596 256)))) (or (and (= ~y$w_buff0_used~0_In1339375596 |ULTIMATE.start_main_#t~ite60_Out1339375596|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out1339375596|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1339375596, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1339375596} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1339375596|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1339375596, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1339375596} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:51:11,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L840-->L840-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In595443597 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In595443597 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In595443597 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In595443597 256) 0))) (or (and (= ~y$w_buff1_used~0_In595443597 |ULTIMATE.start_main_#t~ite61_Out595443597|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out595443597|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In595443597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In595443597, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In595443597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In595443597} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out595443597|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In595443597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In595443597, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In595443597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In595443597} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:51:11,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1554229536 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1554229536 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-1554229536 |ULTIMATE.start_main_#t~ite62_Out-1554229536|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-1554229536| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1554229536, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1554229536} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1554229536|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1554229536, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1554229536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:51:11,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L842-->L842-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-1834318382 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1834318382 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1834318382 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1834318382 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-1834318382| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out-1834318382| ~y$r_buff1_thd0~0_In-1834318382) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1834318382, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1834318382, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1834318382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1834318382} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1834318382|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1834318382, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1834318382, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1834318382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1834318382} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:51:11,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_59 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~y$r_buff1_thd0~0_234 |v_ULTIMATE.start_main_#t~ite63_45|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_44|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_59, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_234, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:51:11,960 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_44ad3b13-af8c-473e-9640-a127d0ce7536/bin/uautomizer/witness.graphml [2019-12-07 10:51:11,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:51:11,962 INFO L168 Benchmark]: Toolchain (without parser) took 28725.47 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 939.3 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 10:51:11,962 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:51:11,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:51:11,962 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:51:11,963 INFO L168 Benchmark]: Boogie Preprocessor took 27.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:51:11,963 INFO L168 Benchmark]: RCFGBuilder took 441.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:51:11,963 INFO L168 Benchmark]: TraceAbstraction took 27663.02 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 10:51:11,963 INFO L168 Benchmark]: Witness Printer took 74.87 ms. Allocated memory is still 4.4 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:51:11,965 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 474.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 441.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27663.02 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 74.87 ms. Allocated memory is still 4.4 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 194 ProgramPointsBefore, 109 ProgramPointsAfterwards, 240 TransitionsBefore, 131 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 28 ChoiceCompositions, 9412 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 312 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 128329 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t506, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t507, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t508, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 y$flush_delayed = weak$$choice2 [L789] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L791] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L792] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L793] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L794] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y = y$flush_delayed ? y$mem_tmp : y [L799] 3 y$flush_delayed = (_Bool)0 [L802] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 2 x = 2 [L749] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 2 y$flush_delayed = weak$$choice2 [L752] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L754] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L755] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L756] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L759] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3246 SDtfs, 3907 SDslu, 6987 SDs, 0 SdLazy, 3228 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105508occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 22090 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 678 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 599 ConstructedInterpolants, 0 QuantifiedInterpolants, 146767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...