./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_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_bd1052a2-c109-473e-9947-39e2b84aa7b0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/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 79f97b4bbf8153d20dcd7a57477019ff9d02e780 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:04:58,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:04:58,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:04:58,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:04:58,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:04:58,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:04:58,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:04:58,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:04:58,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:04:58,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:04:58,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:04:58,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:04:58,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:04:58,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:04:58,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:04:58,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:04:58,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:04:58,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:04:58,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:04:58,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:04:58,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:04:58,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:04:58,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:04:58,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:04:58,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:04:58,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:04:58,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:04:58,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:04:58,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:04:58,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:04:58,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:04:58,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:04:58,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:04:58,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:04:58,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:04:58,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:04:58,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:04:58,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:04:58,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:04:58,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:04:58,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:04:58,524 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:04:58,537 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:04:58,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:04:58,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:04:58,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:04:58,538 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:04:58,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:04:58,539 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:04:58,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:04:58,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:04:58,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:04:58,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:04:58,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:04:58,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:04:58,540 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:04:58,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:04:58,540 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:04:58,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:04:58,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:04:58,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:04:58,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:04:58,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:04:58,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:04:58,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:04:58,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:04:58,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:04:58,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:04:58,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:04:58,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:04:58,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:04:58,543 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_bd1052a2-c109-473e-9947-39e2b84aa7b0/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 -> 79f97b4bbf8153d20dcd7a57477019ff9d02e780 [2019-12-07 14:04:58,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:04:58,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:04:58,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:04:58,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:04:58,678 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:04:58,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe034_pso.opt.i [2019-12-07 14:04:58,722 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/bin/uautomizer/data/656463c20/2d7cb56143d54a3ab548166f4a188dfc/FLAG910454518 [2019-12-07 14:04:59,156 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:04:59,157 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/sv-benchmarks/c/pthread-wmm/safe034_pso.opt.i [2019-12-07 14:04:59,168 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/bin/uautomizer/data/656463c20/2d7cb56143d54a3ab548166f4a188dfc/FLAG910454518 [2019-12-07 14:04:59,177 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/bin/uautomizer/data/656463c20/2d7cb56143d54a3ab548166f4a188dfc [2019-12-07 14:04:59,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:04:59,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:04:59,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:04:59,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:04:59,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:04:59,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:04:59" (1/1) ... [2019-12-07 14:04:59,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc55db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59, skipping insertion in model container [2019-12-07 14:04:59,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:04:59" (1/1) ... [2019-12-07 14:04:59,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:04:59,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:04:59,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:04:59,478 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:04:59,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:04:59,563 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:04:59,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59 WrapperNode [2019-12-07 14:04:59,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:04:59,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:04:59,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:04:59,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:04:59,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59" (1/1) ... [2019-12-07 14:04:59,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59" (1/1) ... [2019-12-07 14:04:59,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:04:59,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:04:59,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:04:59,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:04:59,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59" (1/1) ... [2019-12-07 14:04:59,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59" (1/1) ... [2019-12-07 14:04:59,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59" (1/1) ... [2019-12-07 14:04:59,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59" (1/1) ... [2019-12-07 14:04:59,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59" (1/1) ... [2019-12-07 14:04:59,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59" (1/1) ... [2019-12-07 14:04:59,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59" (1/1) ... [2019-12-07 14:04:59,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:04:59,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:04:59,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:04:59,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:04:59,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/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 14:04:59,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:04:59,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:04:59,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:04:59,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:04:59,665 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:04:59,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:04:59,665 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:04:59,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:04:59,665 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:04:59,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:04:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:04:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:04:59,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:04:59,667 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 14:05:00,001 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:05:00,001 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:05:00,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:05:00 BoogieIcfgContainer [2019-12-07 14:05:00,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:05:00,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:05:00,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:05:00,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:05:00,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:04:59" (1/3) ... [2019-12-07 14:05:00,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0dae43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:05:00, skipping insertion in model container [2019-12-07 14:05:00,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:04:59" (2/3) ... [2019-12-07 14:05:00,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0dae43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:05:00, skipping insertion in model container [2019-12-07 14:05:00,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:05:00" (3/3) ... [2019-12-07 14:05:00,006 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_pso.opt.i [2019-12-07 14:05:00,012 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:05:00,013 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:05:00,017 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:05:00,018 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:05:00,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,040 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,040 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,042 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,042 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,052 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,053 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,053 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,053 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,053 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:05:00,067 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:05:00,079 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:05:00,079 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:05:00,079 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:05:00,079 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:05:00,079 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:05:00,080 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:05:00,080 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:05:00,080 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:05:00,090 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-07 14:05:00,091 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 14:05:00,137 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 14:05:00,137 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:05:00,146 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 14:05:00,158 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 14:05:00,181 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 14:05:00,181 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:05:00,185 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 14:05:00,194 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 14:05:00,195 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:05:02,697 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 14:05:02,898 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-12-07 14:05:02,898 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 14:05:02,901 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-12-07 14:05:03,562 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-12-07 14:05:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-12-07 14:05:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:05:03,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:03,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:03,568 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 14:05:03,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-12-07 14:05:03,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:03,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758020317] [2019-12-07 14:05:03,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:03,721 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 14:05:03,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758020317] [2019-12-07 14:05:03,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:03,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:05:03,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545191031] [2019-12-07 14:05:03,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:05:03,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:03,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:05:03,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:05:03,738 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-12-07 14:05:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:03,937 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-12-07 14:05:03,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:05:03,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 14:05:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:04,039 INFO L225 Difference]: With dead ends: 13722 [2019-12-07 14:05:04,039 INFO L226 Difference]: Without dead ends: 12214 [2019-12-07 14:05:04,040 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 14:05:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-12-07 14:05:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-12-07 14:05:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-12-07 14:05:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-12-07 14:05:04,522 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-12-07 14:05:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:04,523 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-12-07 14:05:04,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:05:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-12-07 14:05:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:05:04,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:04,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:04,529 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 14:05:04,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:04,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-12-07 14:05:04,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:04,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136944570] [2019-12-07 14:05:04,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:04,608 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 14:05:04,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136944570] [2019-12-07 14:05:04,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:04,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:05:04,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867751711] [2019-12-07 14:05:04,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:05:04,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:04,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:05:04,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:05:04,610 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-12-07 14:05:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:04,843 INFO L93 Difference]: Finished difference Result 18446 states and 67942 transitions. [2019-12-07 14:05:04,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:05:04,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:05:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:04,908 INFO L225 Difference]: With dead ends: 18446 [2019-12-07 14:05:04,908 INFO L226 Difference]: Without dead ends: 18390 [2019-12-07 14:05:04,909 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 14:05:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2019-12-07 14:05:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 16710. [2019-12-07 14:05:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-07 14:05:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 62402 transitions. [2019-12-07 14:05:05,372 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 62402 transitions. Word has length 13 [2019-12-07 14:05:05,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:05,373 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 62402 transitions. [2019-12-07 14:05:05,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:05:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 62402 transitions. [2019-12-07 14:05:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:05:05,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:05,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:05,377 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 14:05:05,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:05,377 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-12-07 14:05:05,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:05,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456410397] [2019-12-07 14:05:05,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:05,433 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 14:05:05,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456410397] [2019-12-07 14:05:05,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:05,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:05:05,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884570301] [2019-12-07 14:05:05,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:05:05,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:05,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:05:05,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:05:05,435 INFO L87 Difference]: Start difference. First operand 16710 states and 62402 transitions. Second operand 5 states. [2019-12-07 14:05:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:05,670 INFO L93 Difference]: Finished difference Result 24000 states and 87901 transitions. [2019-12-07 14:05:05,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:05:05,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 14:05:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:05,721 INFO L225 Difference]: With dead ends: 24000 [2019-12-07 14:05:05,721 INFO L226 Difference]: Without dead ends: 23924 [2019-12-07 14:05:05,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:05:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-12-07 14:05:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20292. [2019-12-07 14:05:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20292 states. [2019-12-07 14:05:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 75385 transitions. [2019-12-07 14:05:06,160 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 75385 transitions. Word has length 16 [2019-12-07 14:05:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:06,160 INFO L462 AbstractCegarLoop]: Abstraction has 20292 states and 75385 transitions. [2019-12-07 14:05:06,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:05:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 75385 transitions. [2019-12-07 14:05:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:05:06,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:06,165 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 14:05:06,166 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 14:05:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:06,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-12-07 14:05:06,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:06,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206559605] [2019-12-07 14:05:06,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:06,222 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 14:05:06,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206559605] [2019-12-07 14:05:06,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:06,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:05:06,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344336527] [2019-12-07 14:05:06,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:05:06,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:06,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:05:06,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:05:06,223 INFO L87 Difference]: Start difference. First operand 20292 states and 75385 transitions. Second operand 3 states. [2019-12-07 14:05:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:06,297 INFO L93 Difference]: Finished difference Result 19280 states and 70741 transitions. [2019-12-07 14:05:06,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:05:06,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 14:05:06,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:06,329 INFO L225 Difference]: With dead ends: 19280 [2019-12-07 14:05:06,329 INFO L226 Difference]: Without dead ends: 19280 [2019-12-07 14:05:06,330 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 14:05:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19280 states. [2019-12-07 14:05:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19280 to 19016. [2019-12-07 14:05:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19016 states. [2019-12-07 14:05:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19016 states to 19016 states and 69841 transitions. [2019-12-07 14:05:06,675 INFO L78 Accepts]: Start accepts. Automaton has 19016 states and 69841 transitions. Word has length 18 [2019-12-07 14:05:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:06,675 INFO L462 AbstractCegarLoop]: Abstraction has 19016 states and 69841 transitions. [2019-12-07 14:05:06,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:05:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 19016 states and 69841 transitions. [2019-12-07 14:05:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:05:06,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:06,680 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 14:05:06,680 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 14:05:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash 2086322840, now seen corresponding path program 1 times [2019-12-07 14:05:06,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:06,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846717050] [2019-12-07 14:05:06,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:06,722 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 14:05:06,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846717050] [2019-12-07 14:05:06,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:06,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:05:06,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921319727] [2019-12-07 14:05:06,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:05:06,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:06,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:05:06,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:05:06,724 INFO L87 Difference]: Start difference. First operand 19016 states and 69841 transitions. Second operand 3 states. [2019-12-07 14:05:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:06,865 INFO L93 Difference]: Finished difference Result 18891 states and 69309 transitions. [2019-12-07 14:05:06,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:05:06,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 14:05:06,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:06,895 INFO L225 Difference]: With dead ends: 18891 [2019-12-07 14:05:06,895 INFO L226 Difference]: Without dead ends: 18891 [2019-12-07 14:05:06,895 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 14:05:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18891 states. [2019-12-07 14:05:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18891 to 18891. [2019-12-07 14:05:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18891 states. [2019-12-07 14:05:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18891 states to 18891 states and 69309 transitions. [2019-12-07 14:05:07,205 INFO L78 Accepts]: Start accepts. Automaton has 18891 states and 69309 transitions. Word has length 18 [2019-12-07 14:05:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:07,206 INFO L462 AbstractCegarLoop]: Abstraction has 18891 states and 69309 transitions. [2019-12-07 14:05:07,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:05:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 18891 states and 69309 transitions. [2019-12-07 14:05:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:05:07,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:07,210 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 14:05:07,210 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 14:05:07,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash 44045431, now seen corresponding path program 1 times [2019-12-07 14:05:07,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:07,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035505520] [2019-12-07 14:05:07,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:07,270 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 14:05:07,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035505520] [2019-12-07 14:05:07,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:07,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:05:07,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959488675] [2019-12-07 14:05:07,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:05:07,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:07,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:05:07,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:05:07,272 INFO L87 Difference]: Start difference. First operand 18891 states and 69309 transitions. Second operand 5 states. [2019-12-07 14:05:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:07,319 INFO L93 Difference]: Finished difference Result 3080 states and 9315 transitions. [2019-12-07 14:05:07,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:05:07,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 14:05:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:07,321 INFO L225 Difference]: With dead ends: 3080 [2019-12-07 14:05:07,322 INFO L226 Difference]: Without dead ends: 2014 [2019-12-07 14:05:07,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:05:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2019-12-07 14:05:07,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2014. [2019-12-07 14:05:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-07 14:05:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 5324 transitions. [2019-12-07 14:05:07,343 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 5324 transitions. Word has length 19 [2019-12-07 14:05:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:07,344 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 5324 transitions. [2019-12-07 14:05:07,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:05:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 5324 transitions. [2019-12-07 14:05:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:05:07,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:07,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:07,346 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 14:05:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-12-07 14:05:07,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:07,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794243371] [2019-12-07 14:05:07,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:07,371 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 14:05:07,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794243371] [2019-12-07 14:05:07,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:07,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:05:07,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878884463] [2019-12-07 14:05:07,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:05:07,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:07,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:05:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:05:07,373 INFO L87 Difference]: Start difference. First operand 2014 states and 5324 transitions. Second operand 3 states. [2019-12-07 14:05:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:07,400 INFO L93 Difference]: Finished difference Result 2850 states and 7274 transitions. [2019-12-07 14:05:07,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:05:07,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 14:05:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:07,402 INFO L225 Difference]: With dead ends: 2850 [2019-12-07 14:05:07,402 INFO L226 Difference]: Without dead ends: 2850 [2019-12-07 14:05:07,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:05:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2019-12-07 14:05:07,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2110. [2019-12-07 14:05:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-12-07 14:05:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 5466 transitions. [2019-12-07 14:05:07,423 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 5466 transitions. Word has length 29 [2019-12-07 14:05:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:07,423 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 5466 transitions. [2019-12-07 14:05:07,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:05:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 5466 transitions. [2019-12-07 14:05:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:05:07,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:07,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:07,425 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 14:05:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-12-07 14:05:07,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:07,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205380220] [2019-12-07 14:05:07,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:07,485 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 14:05:07,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205380220] [2019-12-07 14:05:07,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:07,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:05:07,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551900977] [2019-12-07 14:05:07,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:05:07,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:05:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:05:07,487 INFO L87 Difference]: Start difference. First operand 2110 states and 5466 transitions. Second operand 6 states. [2019-12-07 14:05:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:07,705 INFO L93 Difference]: Finished difference Result 3354 states and 8440 transitions. [2019-12-07 14:05:07,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:05:07,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 14:05:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:07,708 INFO L225 Difference]: With dead ends: 3354 [2019-12-07 14:05:07,708 INFO L226 Difference]: Without dead ends: 3346 [2019-12-07 14:05:07,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:05:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-12-07 14:05:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2160. [2019-12-07 14:05:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2019-12-07 14:05:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 5592 transitions. [2019-12-07 14:05:07,732 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 5592 transitions. Word has length 29 [2019-12-07 14:05:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:07,732 INFO L462 AbstractCegarLoop]: Abstraction has 2160 states and 5592 transitions. [2019-12-07 14:05:07,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:05:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 5592 transitions. [2019-12-07 14:05:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 14:05:07,735 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:07,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:07,735 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 14:05:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash 804701306, now seen corresponding path program 1 times [2019-12-07 14:05:07,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:07,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211362648] [2019-12-07 14:05:07,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:05:07,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211362648] [2019-12-07 14:05:07,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:07,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:05:07,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181514493] [2019-12-07 14:05:07,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:05:07,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:07,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:05:07,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:05:07,792 INFO L87 Difference]: Start difference. First operand 2160 states and 5592 transitions. Second operand 6 states. [2019-12-07 14:05:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:07,844 INFO L93 Difference]: Finished difference Result 1348 states and 3614 transitions. [2019-12-07 14:05:07,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:05:07,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 14:05:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:07,845 INFO L225 Difference]: With dead ends: 1348 [2019-12-07 14:05:07,845 INFO L226 Difference]: Without dead ends: 1276 [2019-12-07 14:05:07,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:05:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-12-07 14:05:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2019-12-07 14:05:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-12-07 14:05:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3443 transitions. [2019-12-07 14:05:07,858 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3443 transitions. Word has length 30 [2019-12-07 14:05:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:07,858 INFO L462 AbstractCegarLoop]: Abstraction has 1276 states and 3443 transitions. [2019-12-07 14:05:07,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:05:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3443 transitions. [2019-12-07 14:05:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:05:07,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:07,860 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:05:07,860 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 14:05:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:07,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1812124980, now seen corresponding path program 1 times [2019-12-07 14:05:07,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:07,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629586968] [2019-12-07 14:05:07,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:07,885 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 14:05:07,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629586968] [2019-12-07 14:05:07,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:07,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:05:07,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671935268] [2019-12-07 14:05:07,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:05:07,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:07,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:05:07,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:05:07,887 INFO L87 Difference]: Start difference. First operand 1276 states and 3443 transitions. Second operand 3 states. [2019-12-07 14:05:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:07,918 INFO L93 Difference]: Finished difference Result 1496 states and 3891 transitions. [2019-12-07 14:05:07,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:05:07,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-07 14:05:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:07,920 INFO L225 Difference]: With dead ends: 1496 [2019-12-07 14:05:07,920 INFO L226 Difference]: Without dead ends: 1496 [2019-12-07 14:05:07,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:05:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-12-07 14:05:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1328. [2019-12-07 14:05:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-12-07 14:05:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3495 transitions. [2019-12-07 14:05:07,937 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3495 transitions. Word has length 45 [2019-12-07 14:05:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:07,938 INFO L462 AbstractCegarLoop]: Abstraction has 1328 states and 3495 transitions. [2019-12-07 14:05:07,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:05:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3495 transitions. [2019-12-07 14:05:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:05:07,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:07,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:07,940 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 14:05:07,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:07,940 INFO L82 PathProgramCache]: Analyzing trace with hash -24959066, now seen corresponding path program 1 times [2019-12-07 14:05:07,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:07,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106936098] [2019-12-07 14:05:07,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:05:08,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106936098] [2019-12-07 14:05:08,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:08,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:05:08,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935978952] [2019-12-07 14:05:08,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:05:08,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:08,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:05:08,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:05:08,001 INFO L87 Difference]: Start difference. First operand 1328 states and 3495 transitions. Second operand 4 states. [2019-12-07 14:05:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:08,050 INFO L93 Difference]: Finished difference Result 1865 states and 4650 transitions. [2019-12-07 14:05:08,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:05:08,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 14:05:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:08,051 INFO L225 Difference]: With dead ends: 1865 [2019-12-07 14:05:08,051 INFO L226 Difference]: Without dead ends: 1192 [2019-12-07 14:05:08,051 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 14:05:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-12-07 14:05:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2019-12-07 14:05:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-12-07 14:05:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 3078 transitions. [2019-12-07 14:05:08,063 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 3078 transitions. Word has length 45 [2019-12-07 14:05:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:08,063 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 3078 transitions. [2019-12-07 14:05:08,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:05:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 3078 transitions. [2019-12-07 14:05:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:05:08,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:08,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:08,065 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 14:05:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:08,065 INFO L82 PathProgramCache]: Analyzing trace with hash -928078620, now seen corresponding path program 2 times [2019-12-07 14:05:08,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:08,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017729055] [2019-12-07 14:05:08,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:08,136 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 14:05:08,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017729055] [2019-12-07 14:05:08,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:08,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:05:08,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465181544] [2019-12-07 14:05:08,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:05:08,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:05:08,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:05:08,138 INFO L87 Difference]: Start difference. First operand 1192 states and 3078 transitions. Second operand 7 states. [2019-12-07 14:05:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:08,353 INFO L93 Difference]: Finished difference Result 3292 states and 8482 transitions. [2019-12-07 14:05:08,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 14:05:08,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-07 14:05:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:08,356 INFO L225 Difference]: With dead ends: 3292 [2019-12-07 14:05:08,356 INFO L226 Difference]: Without dead ends: 2736 [2019-12-07 14:05:08,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:05:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-12-07 14:05:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1608. [2019-12-07 14:05:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-12-07 14:05:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 4035 transitions. [2019-12-07 14:05:08,373 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 4035 transitions. Word has length 45 [2019-12-07 14:05:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:08,374 INFO L462 AbstractCegarLoop]: Abstraction has 1608 states and 4035 transitions. [2019-12-07 14:05:08,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:05:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 4035 transitions. [2019-12-07 14:05:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:05:08,375 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:08,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:08,376 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 14:05:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:08,376 INFO L82 PathProgramCache]: Analyzing trace with hash -228434578, now seen corresponding path program 3 times [2019-12-07 14:05:08,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:08,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364269803] [2019-12-07 14:05:08,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:08,415 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 14:05:08,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364269803] [2019-12-07 14:05:08,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:08,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:05:08,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208323454] [2019-12-07 14:05:08,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:05:08,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:08,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:05:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:05:08,416 INFO L87 Difference]: Start difference. First operand 1608 states and 4035 transitions. Second operand 4 states. [2019-12-07 14:05:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:08,429 INFO L93 Difference]: Finished difference Result 2081 states and 5044 transitions. [2019-12-07 14:05:08,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:05:08,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 14:05:08,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:08,430 INFO L225 Difference]: With dead ends: 2081 [2019-12-07 14:05:08,430 INFO L226 Difference]: Without dead ends: 523 [2019-12-07 14:05:08,430 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 14:05:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-12-07 14:05:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2019-12-07 14:05:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-12-07 14:05:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1098 transitions. [2019-12-07 14:05:08,435 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 1098 transitions. Word has length 45 [2019-12-07 14:05:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:08,435 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 1098 transitions. [2019-12-07 14:05:08,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:05:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1098 transitions. [2019-12-07 14:05:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:05:08,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:08,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:08,436 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 14:05:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:08,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 4 times [2019-12-07 14:05:08,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:08,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029534872] [2019-12-07 14:05:08,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:05:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:05:08,499 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:05:08,499 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:05:08,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2586~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2586~0.base_31|) |v_ULTIMATE.start_main_~#t2586~0.offset_22| 0)) |v_#memory_int_23|) (= v_~y$w_buff1_used~0_392 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2586~0.base_31| 4)) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2586~0.base_31|) (= |v_#NULL.offset_6| 0) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2586~0.base_31|)) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= (store .cse0 |v_ULTIMATE.start_main_~#t2586~0.base_31| 1) |v_#valid_66|) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t2586~0.offset_22|) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_~#t2588~0.offset=|v_ULTIMATE.start_main_~#t2588~0.offset_15|, ULTIMATE.start_main_~#t2586~0.base=|v_ULTIMATE.start_main_~#t2586~0.base_31|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t2588~0.base=|v_ULTIMATE.start_main_~#t2588~0.base_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2587~0.offset=|v_ULTIMATE.start_main_~#t2587~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_~#t2586~0.offset=|v_ULTIMATE.start_main_~#t2586~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ULTIMATE.start_main_~#t2587~0.base=|v_ULTIMATE.start_main_~#t2587~0.base_31|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2588~0.base, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2588~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2586~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2587~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2586~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2587~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:05:08,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2587~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2587~0.offset_9|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2587~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t2587~0.base_10| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2587~0.base_10| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2587~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2587~0.base_10|) |v_ULTIMATE.start_main_~#t2587~0.offset_9| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2587~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2587~0.offset=|v_ULTIMATE.start_main_~#t2587~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2587~0.base=|v_ULTIMATE.start_main_~#t2587~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2587~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2587~0.base] because there is no mapped edge [2019-12-07 14:05:08,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2588~0.base_11| 1) |v_#valid_36|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2588~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2588~0.base_11|) |v_ULTIMATE.start_main_~#t2588~0.offset_10| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2588~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2588~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2588~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t2588~0.offset_10|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2588~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2588~0.offset=|v_ULTIMATE.start_main_~#t2588~0.offset_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2588~0.base=|v_ULTIMATE.start_main_~#t2588~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2588~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2588~0.base, #length] because there is no mapped edge [2019-12-07 14:05:08,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:05:08,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 14:05:08,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1955678256 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1955678256| ~y$w_buff0~0_In-1955678256) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-1955678256| |P1Thread1of1ForFork1_#t~ite8_Out-1955678256|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite8_Out-1955678256| ~y$w_buff0~0_In-1955678256) (= |P1Thread1of1ForFork1_#t~ite9_Out-1955678256| |P1Thread1of1ForFork1_#t~ite8_Out-1955678256|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1955678256 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1955678256 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1955678256 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1955678256 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1955678256, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955678256, ~y$w_buff0~0=~y$w_buff0~0_In-1955678256, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1955678256, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-1955678256|, ~weak$$choice2~0=~weak$$choice2~0_In-1955678256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955678256} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1955678256, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955678256, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1955678256|, ~y$w_buff0~0=~y$w_buff0~0_In-1955678256, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1955678256, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-1955678256|, ~weak$$choice2~0=~weak$$choice2~0_In-1955678256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955678256} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 14:05:08,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1387753958 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1387753958 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In1387753958 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1387753958 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1387753958 256))))) (= |P1Thread1of1ForFork1_#t~ite14_Out1387753958| |P1Thread1of1ForFork1_#t~ite15_Out1387753958|) .cse1 (= ~y$w_buff0_used~0_In1387753958 |P1Thread1of1ForFork1_#t~ite14_Out1387753958|)) (and (= ~y$w_buff0_used~0_In1387753958 |P1Thread1of1ForFork1_#t~ite15_Out1387753958|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In1387753958| |P1Thread1of1ForFork1_#t~ite14_Out1387753958|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1387753958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1387753958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1387753958, ~weak$$choice2~0=~weak$$choice2~0_In1387753958, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1387753958|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1387753958} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1387753958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1387753958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1387753958, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1387753958|, ~weak$$choice2~0=~weak$$choice2~0_In1387753958, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1387753958|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1387753958} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 14:05:08,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 14:05:08,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-463058570 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-463058570 256)))) (or (and (= ~y$w_buff0_used~0_In-463058570 |P2Thread1of1ForFork2_#t~ite28_Out-463058570|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-463058570|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-463058570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-463058570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-463058570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-463058570, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-463058570|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 14:05:08,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 14:05:08,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-943751022 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-943751022 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-943751022 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-943751022 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-943751022| ~y$w_buff1_used~0_In-943751022) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-943751022| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-943751022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-943751022, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-943751022, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943751022} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-943751022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-943751022, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-943751022, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-943751022|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943751022} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 14:05:08,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In378731864 ~y$r_buff0_thd3~0_Out378731864)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In378731864 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In378731864 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= ~y$r_buff0_thd3~0_Out378731864 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In378731864, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In378731864} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In378731864, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out378731864|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out378731864} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 14:05:08,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1473590846 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1473590846 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1473590846 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1473590846 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite31_Out1473590846| ~y$r_buff1_thd3~0_In1473590846) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite31_Out1473590846| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1473590846, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1473590846, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1473590846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1473590846} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1473590846, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1473590846, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1473590846|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1473590846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1473590846} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 14:05:08,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 14:05:08,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:05:08,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-544329701 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-544329701 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-544329701| ~y$w_buff1~0_In-544329701)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite35_Out-544329701| ~y~0_In-544329701)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-544329701, ~y~0=~y~0_In-544329701, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-544329701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-544329701} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-544329701, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-544329701|, ~y~0=~y~0_In-544329701, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-544329701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-544329701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 14:05:08,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 14:05:08,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1464844761 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1464844761 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out-1464844761|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1464844761 |ULTIMATE.start_main_#t~ite37_Out-1464844761|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464844761, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1464844761} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464844761, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1464844761, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1464844761|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:05:08,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1098782252 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1098782252 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1098782252 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1098782252 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-1098782252| ~y$w_buff1_used~0_In-1098782252)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite38_Out-1098782252| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098782252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1098782252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098782252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098782252} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098782252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1098782252, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1098782252|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098782252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098782252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:05:08,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1871141667 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1871141667 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1871141667| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1871141667| ~y$r_buff0_thd0~0_In1871141667)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1871141667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1871141667} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1871141667, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1871141667|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1871141667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:05:08,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1542523989 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1542523989 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1542523989 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1542523989 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out1542523989| 0)) (and (= |ULTIMATE.start_main_#t~ite40_Out1542523989| ~y$r_buff1_thd0~0_In1542523989) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1542523989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1542523989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1542523989, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1542523989} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1542523989|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1542523989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1542523989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1542523989, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1542523989} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:05:08,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:05:08,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:05:08 BasicIcfg [2019-12-07 14:05:08,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:05:08,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:05:08,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:05:08,555 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:05:08,555 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:05:00" (3/4) ... [2019-12-07 14:05:08,557 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:05:08,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2586~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2586~0.base_31|) |v_ULTIMATE.start_main_~#t2586~0.offset_22| 0)) |v_#memory_int_23|) (= v_~y$w_buff1_used~0_392 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2586~0.base_31| 4)) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2586~0.base_31|) (= |v_#NULL.offset_6| 0) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2586~0.base_31|)) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= (store .cse0 |v_ULTIMATE.start_main_~#t2586~0.base_31| 1) |v_#valid_66|) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t2586~0.offset_22|) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_~#t2588~0.offset=|v_ULTIMATE.start_main_~#t2588~0.offset_15|, ULTIMATE.start_main_~#t2586~0.base=|v_ULTIMATE.start_main_~#t2586~0.base_31|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t2588~0.base=|v_ULTIMATE.start_main_~#t2588~0.base_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2587~0.offset=|v_ULTIMATE.start_main_~#t2587~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_~#t2586~0.offset=|v_ULTIMATE.start_main_~#t2586~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ULTIMATE.start_main_~#t2587~0.base=|v_ULTIMATE.start_main_~#t2587~0.base_31|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2588~0.base, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2588~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2586~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2587~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2586~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2587~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:05:08,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2587~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2587~0.offset_9|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2587~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t2587~0.base_10| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2587~0.base_10| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2587~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2587~0.base_10|) |v_ULTIMATE.start_main_~#t2587~0.offset_9| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2587~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2587~0.offset=|v_ULTIMATE.start_main_~#t2587~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2587~0.base=|v_ULTIMATE.start_main_~#t2587~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2587~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2587~0.base] because there is no mapped edge [2019-12-07 14:05:08,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2588~0.base_11| 1) |v_#valid_36|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2588~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2588~0.base_11|) |v_ULTIMATE.start_main_~#t2588~0.offset_10| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2588~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2588~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2588~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t2588~0.offset_10|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2588~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2588~0.offset=|v_ULTIMATE.start_main_~#t2588~0.offset_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2588~0.base=|v_ULTIMATE.start_main_~#t2588~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2588~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2588~0.base, #length] because there is no mapped edge [2019-12-07 14:05:08,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:05:08,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 14:05:08,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1955678256 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1955678256| ~y$w_buff0~0_In-1955678256) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-1955678256| |P1Thread1of1ForFork1_#t~ite8_Out-1955678256|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite8_Out-1955678256| ~y$w_buff0~0_In-1955678256) (= |P1Thread1of1ForFork1_#t~ite9_Out-1955678256| |P1Thread1of1ForFork1_#t~ite8_Out-1955678256|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1955678256 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1955678256 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1955678256 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1955678256 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1955678256, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955678256, ~y$w_buff0~0=~y$w_buff0~0_In-1955678256, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1955678256, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-1955678256|, ~weak$$choice2~0=~weak$$choice2~0_In-1955678256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955678256} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1955678256, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955678256, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1955678256|, ~y$w_buff0~0=~y$w_buff0~0_In-1955678256, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1955678256, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-1955678256|, ~weak$$choice2~0=~weak$$choice2~0_In-1955678256, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955678256} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 14:05:08,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1387753958 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1387753958 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In1387753958 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1387753958 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1387753958 256))))) (= |P1Thread1of1ForFork1_#t~ite14_Out1387753958| |P1Thread1of1ForFork1_#t~ite15_Out1387753958|) .cse1 (= ~y$w_buff0_used~0_In1387753958 |P1Thread1of1ForFork1_#t~ite14_Out1387753958|)) (and (= ~y$w_buff0_used~0_In1387753958 |P1Thread1of1ForFork1_#t~ite15_Out1387753958|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In1387753958| |P1Thread1of1ForFork1_#t~ite14_Out1387753958|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1387753958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1387753958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1387753958, ~weak$$choice2~0=~weak$$choice2~0_In1387753958, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1387753958|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1387753958} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1387753958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1387753958, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1387753958, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1387753958|, ~weak$$choice2~0=~weak$$choice2~0_In1387753958, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1387753958|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1387753958} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 14:05:08,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 14:05:08,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-463058570 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-463058570 256)))) (or (and (= ~y$w_buff0_used~0_In-463058570 |P2Thread1of1ForFork2_#t~ite28_Out-463058570|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-463058570|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-463058570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-463058570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-463058570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-463058570, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-463058570|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 14:05:08,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 14:05:08,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-943751022 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-943751022 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-943751022 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-943751022 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-943751022| ~y$w_buff1_used~0_In-943751022) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-943751022| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-943751022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-943751022, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-943751022, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943751022} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-943751022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-943751022, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-943751022, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-943751022|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943751022} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 14:05:08,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In378731864 ~y$r_buff0_thd3~0_Out378731864)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In378731864 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In378731864 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= ~y$r_buff0_thd3~0_Out378731864 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In378731864, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In378731864} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In378731864, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out378731864|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out378731864} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 14:05:08,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1473590846 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1473590846 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1473590846 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1473590846 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite31_Out1473590846| ~y$r_buff1_thd3~0_In1473590846) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite31_Out1473590846| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1473590846, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1473590846, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1473590846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1473590846} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1473590846, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1473590846, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1473590846|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1473590846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1473590846} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 14:05:08,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 14:05:08,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:05:08,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-544329701 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-544329701 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-544329701| ~y$w_buff1~0_In-544329701)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite35_Out-544329701| ~y~0_In-544329701)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-544329701, ~y~0=~y~0_In-544329701, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-544329701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-544329701} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-544329701, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-544329701|, ~y~0=~y~0_In-544329701, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-544329701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-544329701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 14:05:08,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 14:05:08,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1464844761 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1464844761 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out-1464844761|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1464844761 |ULTIMATE.start_main_#t~ite37_Out-1464844761|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464844761, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1464844761} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464844761, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1464844761, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1464844761|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 14:05:08,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1098782252 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1098782252 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1098782252 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1098782252 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-1098782252| ~y$w_buff1_used~0_In-1098782252)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite38_Out-1098782252| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098782252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1098782252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098782252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098782252} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1098782252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1098782252, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1098782252|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098782252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098782252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 14:05:08,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1871141667 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1871141667 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1871141667| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1871141667| ~y$r_buff0_thd0~0_In1871141667)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1871141667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1871141667} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1871141667, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1871141667|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1871141667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 14:05:08,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1542523989 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1542523989 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1542523989 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1542523989 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out1542523989| 0)) (and (= |ULTIMATE.start_main_#t~ite40_Out1542523989| ~y$r_buff1_thd0~0_In1542523989) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1542523989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1542523989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1542523989, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1542523989} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1542523989|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1542523989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1542523989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1542523989, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1542523989} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:05:08,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:05:08,614 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bd1052a2-c109-473e-9947-39e2b84aa7b0/bin/uautomizer/witness.graphml [2019-12-07 14:05:08,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:05:08,615 INFO L168 Benchmark]: Toolchain (without parser) took 9435.02 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 662.7 MB). Free memory was 940.6 MB in the beginning and 1.3 GB in the end (delta: -369.0 MB). Peak memory consumption was 293.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:05:08,615 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:05:08,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -97.3 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:05:08,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:05:08,616 INFO L168 Benchmark]: Boogie Preprocessor took 23.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:05:08,617 INFO L168 Benchmark]: RCFGBuilder took 377.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 984.5 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:05:08,617 INFO L168 Benchmark]: TraceAbstraction took 8552.24 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 588.8 MB). Free memory was 984.5 MB in the beginning and 1.3 GB in the end (delta: -345.1 MB). Peak memory consumption was 243.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:05:08,617 INFO L168 Benchmark]: Witness Printer took 59.34 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:05:08,619 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -97.3 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 377.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 984.5 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8552.24 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 588.8 MB). Free memory was 984.5 MB in the beginning and 1.3 GB in the end (delta: -345.1 MB). Peak memory consumption was 243.7 MB. Max. memory is 11.5 GB. * Witness Printer took 59.34 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.8s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2586, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2587, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2588, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1458 SDtfs, 1753 SDslu, 2464 SDs, 0 SdLazy, 852 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20292occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 8798 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 47922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...