./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix012_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix012_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 872e46ac4033467f3a249153f373c05d47fb8df6 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-11-28 18:03:58,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:03:58,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:03:58,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:03:58,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:03:58,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:03:58,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:03:58,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:03:58,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:03:58,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:03:58,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:03:58,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:03:58,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:03:58,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:03:58,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:03:58,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:03:58,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:03:58,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:03:58,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:03:58,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:03:58,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:03:58,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:03:58,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:03:58,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:03:58,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:03:58,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:03:58,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:03:58,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:03:58,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:03:58,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:03:58,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:03:58,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:03:58,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:03:58,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:03:58,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:03:58,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:03:58,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:03:58,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:03:58,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:03:58,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:03:58,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:03:58,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:03:58,499 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:03:58,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:03:58,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:03:58,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:03:58,506 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:03:58,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:03:58,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:03:58,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:03:58,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:03:58,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:03:58,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:03:58,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:03:58,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:03:58,510 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:03:58,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:03:58,511 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:03:58,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:03:58,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:03:58,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:03:58,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:03:58,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:03:58,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:03:58,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:03:58,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:03:58,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:03:58,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:03:58,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:03:58,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:03:58,515 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:03:58,515 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 872e46ac4033467f3a249153f373c05d47fb8df6 [2019-11-28 18:03:58,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:03:58,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:03:58,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:03:58,841 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:03:58,842 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:03:58,843 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix012_tso.oepc.i [2019-11-28 18:03:58,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1dafc259/eb0b2ebb67e0488cb68bc73617cd8d20/FLAG6d70f4791 [2019-11-28 18:03:59,464 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:03:59,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix012_tso.oepc.i [2019-11-28 18:03:59,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1dafc259/eb0b2ebb67e0488cb68bc73617cd8d20/FLAG6d70f4791 [2019-11-28 18:03:59,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1dafc259/eb0b2ebb67e0488cb68bc73617cd8d20 [2019-11-28 18:03:59,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:03:59,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:03:59,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:03:59,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:03:59,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:03:59,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:03:59" (1/1) ... [2019-11-28 18:03:59,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f384efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:03:59, skipping insertion in model container [2019-11-28 18:03:59,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:03:59" (1/1) ... [2019-11-28 18:03:59,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:03:59,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:04:00,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:04:00,305 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:04:00,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:04:00,472 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:04:00,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00 WrapperNode [2019-11-28 18:04:00,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:04:00,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:04:00,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:04:00,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:04:00,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:04:00,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:04:00,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:04:00,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:04:00,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... [2019-11-28 18:04:00,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:04:00,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:04:00,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:04:00,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:04:00,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:04:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:04:00,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:04:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:04:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:04:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:04:00,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:04:00,650 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:04:00,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:04:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:04:00,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:04:00,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:04:00,653 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:04:01,266 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:04:01,267 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:04:01,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:04:01 BoogieIcfgContainer [2019-11-28 18:04:01,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:04:01,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:04:01,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:04:01,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:04:01,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:03:59" (1/3) ... [2019-11-28 18:04:01,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10142d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:04:01, skipping insertion in model container [2019-11-28 18:04:01,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:04:00" (2/3) ... [2019-11-28 18:04:01,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10142d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:04:01, skipping insertion in model container [2019-11-28 18:04:01,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:04:01" (3/3) ... [2019-11-28 18:04:01,278 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_tso.oepc.i [2019-11-28 18:04:01,288 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:04:01,289 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:04:01,308 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:04:01,309 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:04:01,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,367 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,382 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,383 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:04:01,442 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:04:01,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:04:01,461 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:04:01,461 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:04:01,462 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:04:01,462 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:04:01,462 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:04:01,462 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:04:01,462 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:04:01,478 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-11-28 18:04:01,480 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:04:01,558 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:04:01,558 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:04:01,572 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:04:01,592 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:04:01,636 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:04:01,637 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:04:01,645 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:04:01,665 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:04:01,666 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:04:06,236 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:04:06,346 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:04:06,614 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-11-28 18:04:06,614 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-11-28 18:04:06,617 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-11-28 18:04:07,162 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-11-28 18:04:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-11-28 18:04:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:04:07,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:07,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:04:07,173 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:07,179 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-11-28 18:04:07,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:07,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613713931] [2019-11-28 18:04:07,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:07,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613713931] [2019-11-28 18:04:07,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:07,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:04:07,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233699553] [2019-11-28 18:04:07,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:04:07,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:04:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:07,421 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-11-28 18:04:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:07,692 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-11-28 18:04:07,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:04:07,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:04:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:07,787 INFO L225 Difference]: With dead ends: 8760 [2019-11-28 18:04:07,787 INFO L226 Difference]: Without dead ends: 7798 [2019-11-28 18:04:07,788 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-11-28 18:04:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-11-28 18:04:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-11-28 18:04:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-11-28 18:04:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-11-28 18:04:08,271 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-11-28 18:04:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:08,271 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-11-28 18:04:08,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:04:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-11-28 18:04:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:04:08,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:08,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:08,277 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:08,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-11-28 18:04:08,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:08,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964523245] [2019-11-28 18:04:08,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:08,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964523245] [2019-11-28 18:04:08,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:08,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:04:08,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600605567] [2019-11-28 18:04:08,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:04:08,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:08,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:04:08,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:08,393 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 3 states. [2019-11-28 18:04:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:08,417 INFO L93 Difference]: Finished difference Result 1232 states and 2767 transitions. [2019-11-28 18:04:08,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:04:08,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 18:04:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:08,425 INFO L225 Difference]: With dead ends: 1232 [2019-11-28 18:04:08,425 INFO L226 Difference]: Without dead ends: 1232 [2019-11-28 18:04:08,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-28 18:04:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-11-28 18:04:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-11-28 18:04:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2767 transitions. [2019-11-28 18:04:08,461 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2767 transitions. Word has length 11 [2019-11-28 18:04:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:08,462 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2767 transitions. [2019-11-28 18:04:08,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:04:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2767 transitions. [2019-11-28 18:04:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:04:08,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:08,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:08,464 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:08,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:08,465 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-11-28 18:04:08,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:08,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111059592] [2019-11-28 18:04:08,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:08,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111059592] [2019-11-28 18:04:08,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:08,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:04:08,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264945995] [2019-11-28 18:04:08,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:04:08,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:08,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:04:08,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:04:08,628 INFO L87 Difference]: Start difference. First operand 1232 states and 2767 transitions. Second operand 5 states. [2019-11-28 18:04:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:08,983 INFO L93 Difference]: Finished difference Result 1829 states and 4038 transitions. [2019-11-28 18:04:08,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:04:08,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:04:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:08,995 INFO L225 Difference]: With dead ends: 1829 [2019-11-28 18:04:08,996 INFO L226 Difference]: Without dead ends: 1829 [2019-11-28 18:04:08,996 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-11-28 18:04:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-11-28 18:04:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1572. [2019-11-28 18:04:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-11-28 18:04:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-11-28 18:04:09,063 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 14 [2019-11-28 18:04:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:09,064 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-11-28 18:04:09,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:04:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-11-28 18:04:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:04:09,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:09,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:09,069 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-11-28 18:04:09,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:09,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56154454] [2019-11-28 18:04:09,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:09,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56154454] [2019-11-28 18:04:09,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:09,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:04:09,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094872850] [2019-11-28 18:04:09,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:04:09,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:09,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:04:09,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:04:09,273 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 7 states. [2019-11-28 18:04:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:09,829 INFO L93 Difference]: Finished difference Result 2218 states and 4789 transitions. [2019-11-28 18:04:09,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:04:09,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-11-28 18:04:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:09,842 INFO L225 Difference]: With dead ends: 2218 [2019-11-28 18:04:09,842 INFO L226 Difference]: Without dead ends: 2218 [2019-11-28 18:04:09,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:04:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2019-11-28 18:04:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1705. [2019-11-28 18:04:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-11-28 18:04:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-11-28 18:04:09,892 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-11-28 18:04:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:09,892 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-11-28 18:04:09,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:04:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-11-28 18:04:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:04:09,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:09,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:09,895 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:09,896 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-11-28 18:04:09,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:09,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600802821] [2019-11-28 18:04:09,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:10,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600802821] [2019-11-28 18:04:10,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:10,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:04:10,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633830106] [2019-11-28 18:04:10,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:04:10,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:04:10,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:04:10,009 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 5 states. [2019-11-28 18:04:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:10,429 INFO L93 Difference]: Finished difference Result 2417 states and 5251 transitions. [2019-11-28 18:04:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:04:10,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:04:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:10,442 INFO L225 Difference]: With dead ends: 2417 [2019-11-28 18:04:10,443 INFO L226 Difference]: Without dead ends: 2417 [2019-11-28 18:04:10,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:04:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-11-28 18:04:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2124. [2019-11-28 18:04:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2019-11-28 18:04:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 4675 transitions. [2019-11-28 18:04:10,493 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 4675 transitions. Word has length 26 [2019-11-28 18:04:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:10,493 INFO L462 AbstractCegarLoop]: Abstraction has 2124 states and 4675 transitions. [2019-11-28 18:04:10,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:04:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 4675 transitions. [2019-11-28 18:04:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:04:10,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:10,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:10,499 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:10,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1792140012, now seen corresponding path program 1 times [2019-11-28 18:04:10,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:10,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684283960] [2019-11-28 18:04:10,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:10,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684283960] [2019-11-28 18:04:10,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:10,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:04:10,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773038681] [2019-11-28 18:04:10,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:04:10,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:10,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:04:10,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:04:10,598 INFO L87 Difference]: Start difference. First operand 2124 states and 4675 transitions. Second operand 4 states. [2019-11-28 18:04:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:10,616 INFO L93 Difference]: Finished difference Result 1195 states and 2515 transitions. [2019-11-28 18:04:10,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:04:10,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:04:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:10,623 INFO L225 Difference]: With dead ends: 1195 [2019-11-28 18:04:10,623 INFO L226 Difference]: Without dead ends: 1195 [2019-11-28 18:04:10,623 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-11-28 18:04:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-11-28 18:04:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1099. [2019-11-28 18:04:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-11-28 18:04:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2338 transitions. [2019-11-28 18:04:10,648 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2338 transitions. Word has length 27 [2019-11-28 18:04:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:10,649 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 2338 transitions. [2019-11-28 18:04:10,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:04:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2338 transitions. [2019-11-28 18:04:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:04:10,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:10,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:10,652 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash -306941312, now seen corresponding path program 1 times [2019-11-28 18:04:10,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:10,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661814175] [2019-11-28 18:04:10,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:10,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661814175] [2019-11-28 18:04:10,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:10,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:04:10,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272965874] [2019-11-28 18:04:10,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:04:10,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:10,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:04:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:04:10,767 INFO L87 Difference]: Start difference. First operand 1099 states and 2338 transitions. Second operand 7 states. [2019-11-28 18:04:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:11,543 INFO L93 Difference]: Finished difference Result 1596 states and 3306 transitions. [2019-11-28 18:04:11,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:04:11,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-11-28 18:04:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:11,549 INFO L225 Difference]: With dead ends: 1596 [2019-11-28 18:04:11,549 INFO L226 Difference]: Without dead ends: 1590 [2019-11-28 18:04:11,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:04:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-11-28 18:04:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1154. [2019-11-28 18:04:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2019-11-28 18:04:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2439 transitions. [2019-11-28 18:04:11,578 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2439 transitions. Word has length 50 [2019-11-28 18:04:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:11,578 INFO L462 AbstractCegarLoop]: Abstraction has 1154 states and 2439 transitions. [2019-11-28 18:04:11,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:04:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2439 transitions. [2019-11-28 18:04:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:04:11,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:11,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:11,582 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash 945539546, now seen corresponding path program 2 times [2019-11-28 18:04:11,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:11,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006863151] [2019-11-28 18:04:11,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:11,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006863151] [2019-11-28 18:04:11,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:11,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:04:11,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058334391] [2019-11-28 18:04:11,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:04:11,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:04:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:11,660 INFO L87 Difference]: Start difference. First operand 1154 states and 2439 transitions. Second operand 3 states. [2019-11-28 18:04:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:11,715 INFO L93 Difference]: Finished difference Result 1575 states and 3323 transitions. [2019-11-28 18:04:11,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:04:11,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 18:04:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:11,720 INFO L225 Difference]: With dead ends: 1575 [2019-11-28 18:04:11,720 INFO L226 Difference]: Without dead ends: 1575 [2019-11-28 18:04:11,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-11-28 18:04:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1222. [2019-11-28 18:04:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-11-28 18:04:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 2603 transitions. [2019-11-28 18:04:11,776 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 2603 transitions. Word has length 50 [2019-11-28 18:04:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:11,779 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 2603 transitions. [2019-11-28 18:04:11,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:04:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 2603 transitions. [2019-11-28 18:04:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:04:11,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:11,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 18:04:11,786 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1376295086, now seen corresponding path program 1 times [2019-11-28 18:04:11,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:11,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022252279] [2019-11-28 18:04:11,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:12,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022252279] [2019-11-28 18:04:12,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:12,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:04:12,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998649684] [2019-11-28 18:04:12,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:04:12,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:12,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:04:12,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:04:12,060 INFO L87 Difference]: Start difference. First operand 1222 states and 2603 transitions. Second operand 10 states. [2019-11-28 18:04:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:13,211 INFO L93 Difference]: Finished difference Result 1987 states and 4096 transitions. [2019-11-28 18:04:13,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 18:04:13,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-11-28 18:04:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:13,217 INFO L225 Difference]: With dead ends: 1987 [2019-11-28 18:04:13,217 INFO L226 Difference]: Without dead ends: 1987 [2019-11-28 18:04:13,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-11-28 18:04:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-11-28 18:04:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1323. [2019-11-28 18:04:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2019-11-28 18:04:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2817 transitions. [2019-11-28 18:04:13,258 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2817 transitions. Word has length 51 [2019-11-28 18:04:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:13,259 INFO L462 AbstractCegarLoop]: Abstraction has 1323 states and 2817 transitions. [2019-11-28 18:04:13,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:04:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2817 transitions. [2019-11-28 18:04:13,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:04:13,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:13,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:13,263 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:13,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:13,263 INFO L82 PathProgramCache]: Analyzing trace with hash 576609332, now seen corresponding path program 2 times [2019-11-28 18:04:13,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:13,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020885075] [2019-11-28 18:04:13,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:13,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020885075] [2019-11-28 18:04:13,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:13,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:04:13,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992981962] [2019-11-28 18:04:13,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:04:13,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:04:13,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:04:13,426 INFO L87 Difference]: Start difference. First operand 1323 states and 2817 transitions. Second operand 7 states. [2019-11-28 18:04:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:13,559 INFO L93 Difference]: Finished difference Result 2216 states and 4731 transitions. [2019-11-28 18:04:13,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:04:13,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-28 18:04:13,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:13,564 INFO L225 Difference]: With dead ends: 2216 [2019-11-28 18:04:13,564 INFO L226 Difference]: Without dead ends: 1652 [2019-11-28 18:04:13,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:04:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2019-11-28 18:04:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1458. [2019-11-28 18:04:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-11-28 18:04:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 3133 transitions. [2019-11-28 18:04:13,594 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 3133 transitions. Word has length 51 [2019-11-28 18:04:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:13,594 INFO L462 AbstractCegarLoop]: Abstraction has 1458 states and 3133 transitions. [2019-11-28 18:04:13,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:04:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 3133 transitions. [2019-11-28 18:04:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:04:13,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:13,598 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:13,598 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash 126942710, now seen corresponding path program 3 times [2019-11-28 18:04:13,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:13,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857091787] [2019-11-28 18:04:13,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:13,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857091787] [2019-11-28 18:04:13,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:13,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:04:13,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925001608] [2019-11-28 18:04:13,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:04:13,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:13,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:04:13,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:04:13,670 INFO L87 Difference]: Start difference. First operand 1458 states and 3133 transitions. Second operand 3 states. [2019-11-28 18:04:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:13,685 INFO L93 Difference]: Finished difference Result 1457 states and 3131 transitions. [2019-11-28 18:04:13,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:04:13,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:04:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:13,689 INFO L225 Difference]: With dead ends: 1457 [2019-11-28 18:04:13,690 INFO L226 Difference]: Without dead ends: 1457 [2019-11-28 18:04:13,690 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-11-28 18:04:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-11-28 18:04:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1239. [2019-11-28 18:04:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-11-28 18:04:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2709 transitions. [2019-11-28 18:04:13,718 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2709 transitions. Word has length 51 [2019-11-28 18:04:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:13,718 INFO L462 AbstractCegarLoop]: Abstraction has 1239 states and 2709 transitions. [2019-11-28 18:04:13,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:04:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2709 transitions. [2019-11-28 18:04:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:04:13,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:13,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:13,722 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1353726900, now seen corresponding path program 1 times [2019-11-28 18:04:13,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:13,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715725928] [2019-11-28 18:04:13,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:13,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715725928] [2019-11-28 18:04:13,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:13,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:04:13,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309574370] [2019-11-28 18:04:13,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:04:13,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:13,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:04:13,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:04:13,833 INFO L87 Difference]: Start difference. First operand 1239 states and 2709 transitions. Second operand 5 states. [2019-11-28 18:04:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:13,861 INFO L93 Difference]: Finished difference Result 1451 states and 3094 transitions. [2019-11-28 18:04:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:04:13,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-28 18:04:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:13,864 INFO L225 Difference]: With dead ends: 1451 [2019-11-28 18:04:13,864 INFO L226 Difference]: Without dead ends: 795 [2019-11-28 18:04:13,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:04:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-11-28 18:04:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2019-11-28 18:04:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-11-28 18:04:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1715 transitions. [2019-11-28 18:04:13,879 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1715 transitions. Word has length 52 [2019-11-28 18:04:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:13,880 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1715 transitions. [2019-11-28 18:04:13,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:04:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1715 transitions. [2019-11-28 18:04:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:04:13,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:13,882 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:13,882 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:13,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash -673987370, now seen corresponding path program 2 times [2019-11-28 18:04:13,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:13,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855392467] [2019-11-28 18:04:13,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:04:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:04:14,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855392467] [2019-11-28 18:04:14,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:04:14,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:04:14,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796111099] [2019-11-28 18:04:14,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:04:14,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:04:14,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:04:14,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:04:14,054 INFO L87 Difference]: Start difference. First operand 795 states and 1715 transitions. Second operand 7 states. [2019-11-28 18:04:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:04:14,275 INFO L93 Difference]: Finished difference Result 1395 states and 2928 transitions. [2019-11-28 18:04:14,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:04:14,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:04:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:04:14,280 INFO L225 Difference]: With dead ends: 1395 [2019-11-28 18:04:14,280 INFO L226 Difference]: Without dead ends: 945 [2019-11-28 18:04:14,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:04:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-28 18:04:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 789. [2019-11-28 18:04:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-11-28 18:04:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-11-28 18:04:14,307 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 52 [2019-11-28 18:04:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:04:14,309 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-11-28 18:04:14,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:04:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-11-28 18:04:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:04:14,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:04:14,313 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:04:14,313 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:04:14,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:04:14,314 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 3 times [2019-11-28 18:04:14,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:04:14,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296870098] [2019-11-28 18:04:14,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:04:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:04:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:04:14,461 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:04:14,462 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:04:14,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t317~0.base_27|) (= 0 v_~y$r_buff0_thd2~0_418) (= (select .cse0 |v_ULTIMATE.start_main_~#t317~0.base_27|) 0) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t317~0.base_27| 1)) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_ULTIMATE.start_main_~#t317~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t317~0.base_27| 4)) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t317~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t317~0.base_27|) |v_ULTIMATE.start_main_~#t317~0.offset_19| 0)) |v_#memory_int_11|) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t318~0.offset=|v_ULTIMATE.start_main_~#t318~0.offset_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t318~0.base=|v_ULTIMATE.start_main_~#t318~0.base_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t317~0.base=|v_ULTIMATE.start_main_~#t317~0.base_27|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t317~0.offset=|v_ULTIMATE.start_main_~#t317~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_~#t318~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t318~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t317~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t317~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:14,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t318~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t318~0.base_10|) |v_ULTIMATE.start_main_~#t318~0.offset_9| 1)) |v_#memory_int_5|) (not (= 0 |v_ULTIMATE.start_main_~#t318~0.base_10|)) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t318~0.base_10|)) (= |v_ULTIMATE.start_main_~#t318~0.offset_9| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t318~0.base_10| 4) |v_#length_9|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t318~0.base_10| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t318~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t318~0.base=|v_ULTIMATE.start_main_~#t318~0.base_10|, ULTIMATE.start_main_~#t318~0.offset=|v_ULTIMATE.start_main_~#t318~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t318~0.base, ULTIMATE.start_main_~#t318~0.offset, #length] because there is no mapped edge [2019-11-28 18:04:14,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~x~0_In-1254543217 ~__unbuffered_p0_EAX~0_Out-1254543217) (= ~y$r_buff1_thd2~0_Out-1254543217 ~y$r_buff0_thd2~0_In-1254543217) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1254543217 0)) (= 1 ~y$r_buff0_thd1~0_Out-1254543217) (= ~y$r_buff1_thd1~0_Out-1254543217 ~y$r_buff0_thd1~0_In-1254543217) (= ~y$r_buff1_thd0~0_Out-1254543217 ~y$r_buff0_thd0~0_In-1254543217)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1254543217, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1254543217, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1254543217, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1254543217, ~x~0=~x~0_In-1254543217} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1254543217, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1254543217, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1254543217, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1254543217, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1254543217, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1254543217, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1254543217, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1254543217, ~x~0=~x~0_In-1254543217} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:04:14,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1665441989 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1665441989 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1665441989| ~y$w_buff0_used~0_In1665441989)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1665441989| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1665441989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1665441989} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1665441989|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1665441989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1665441989} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:04:14,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In2117057848 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In2117057848 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2117057848 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In2117057848 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2117057848 |P0Thread1of1ForFork0_#t~ite6_Out2117057848|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out2117057848| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2117057848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2117057848, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2117057848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2117057848} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2117057848|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2117057848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2117057848, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2117057848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2117057848} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:04:14,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In725734741 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In725734741 256) 0)) (.cse0 (= ~y$r_buff0_thd1~0_Out725734741 ~y$r_buff0_thd1~0_In725734741))) (or (and .cse0 .cse1) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out725734741 0) (not .cse2)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In725734741, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In725734741} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In725734741, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out725734741|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out725734741} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:04:14,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In732665681 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In732665681 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In732665681 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In732665681 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out732665681| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out732665681| ~y$r_buff1_thd1~0_In732665681) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In732665681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In732665681, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In732665681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In732665681} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In732665681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In732665681, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out732665681|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In732665681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In732665681} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:04:14,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:04:14,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In303989276 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out303989276| ~y$w_buff1~0_In303989276) (= |P1Thread1of1ForFork1_#t~ite17_In303989276| |P1Thread1of1ForFork1_#t~ite17_Out303989276|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In303989276 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In303989276 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In303989276 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In303989276 256)))) (= ~y$w_buff1~0_In303989276 |P1Thread1of1ForFork1_#t~ite17_Out303989276|) .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out303989276| |P1Thread1of1ForFork1_#t~ite17_Out303989276|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In303989276, ~y$w_buff1~0=~y$w_buff1~0_In303989276, ~y$w_buff0_used~0=~y$w_buff0_used~0_In303989276, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In303989276, ~weak$$choice2~0=~weak$$choice2~0_In303989276, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In303989276|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In303989276} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In303989276, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out303989276|, ~y$w_buff1~0=~y$w_buff1~0_In303989276, ~y$w_buff0_used~0=~y$w_buff0_used~0_In303989276, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In303989276, ~weak$$choice2~0=~weak$$choice2~0_In303989276, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out303989276|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In303989276} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:04:14,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In633908278 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out633908278| ~y$w_buff0_used~0_In633908278) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In633908278 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In633908278 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In633908278 256)) (and (= (mod ~y$w_buff1_used~0_In633908278 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out633908278| |P1Thread1of1ForFork1_#t~ite20_Out633908278|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In633908278| |P1Thread1of1ForFork1_#t~ite20_Out633908278|) (= |P1Thread1of1ForFork1_#t~ite21_Out633908278| ~y$w_buff0_used~0_In633908278)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In633908278, ~y$w_buff0_used~0=~y$w_buff0_used~0_In633908278, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In633908278|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In633908278, ~weak$$choice2~0=~weak$$choice2~0_In633908278, ~y$w_buff1_used~0=~y$w_buff1_used~0_In633908278} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In633908278, ~y$w_buff0_used~0=~y$w_buff0_used~0_In633908278, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out633908278|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In633908278, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out633908278|, ~weak$$choice2~0=~weak$$choice2~0_In633908278, ~y$w_buff1_used~0=~y$w_buff1_used~0_In633908278} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:04:14,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In30974892 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out30974892| |P1Thread1of1ForFork1_#t~ite24_Out30974892|)) (.cse4 (= 0 (mod ~y$w_buff1_used~0_In30974892 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In30974892 256))) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In30974892 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In30974892 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In30974892| |P1Thread1of1ForFork1_#t~ite22_Out30974892|) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out30974892| ~y$w_buff1_used~0_In30974892) .cse1 (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) (and (= ~y$w_buff1_used~0_In30974892 |P1Thread1of1ForFork1_#t~ite24_Out30974892|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out30974892| |P1Thread1of1ForFork1_#t~ite23_In30974892|)))) (let ((.cse6 (not .cse3))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite22_Out30974892| 0) .cse1 (or .cse6 (not .cse4)) (or (not .cse2) .cse6) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out30974892| |P1Thread1of1ForFork1_#t~ite22_Out30974892|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In30974892, ~y$w_buff0_used~0=~y$w_buff0_used~0_In30974892, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In30974892, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In30974892|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In30974892|, ~weak$$choice2~0=~weak$$choice2~0_In30974892, ~y$w_buff1_used~0=~y$w_buff1_used~0_In30974892} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In30974892, ~y$w_buff0_used~0=~y$w_buff0_used~0_In30974892, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In30974892, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out30974892|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out30974892|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out30974892|, ~weak$$choice2~0=~weak$$choice2~0_In30974892, ~y$w_buff1_used~0=~y$w_buff1_used~0_In30974892} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:04:14,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:14,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-675557713 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In-675557713| |P1Thread1of1ForFork1_#t~ite28_Out-675557713|) (= ~y$r_buff1_thd2~0_In-675557713 |P1Thread1of1ForFork1_#t~ite30_Out-675557713|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-675557713| |P1Thread1of1ForFork1_#t~ite29_Out-675557713|)) (let ((.cse1 (not (= (mod ~y$r_buff0_thd2~0_In-675557713 256) 0)))) (and .cse0 (or (not (= 0 (mod ~y$r_buff1_thd2~0_In-675557713 256))) .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-675557713| |P1Thread1of1ForFork1_#t~ite29_Out-675557713|) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-675557713|) (or (not (= 0 (mod ~y$w_buff1_used~0_In-675557713 256))) .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out-675557713| |P1Thread1of1ForFork1_#t~ite29_Out-675557713|) (not (= 0 (mod ~y$w_buff0_used~0_In-675557713 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-675557713, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-675557713|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-675557713, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-675557713, ~weak$$choice2~0=~weak$$choice2~0_In-675557713, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-675557713|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-675557713} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-675557713, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-675557713|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-675557713|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-675557713, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-675557713, ~weak$$choice2~0=~weak$$choice2~0_In-675557713, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-675557713|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-675557713} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:04:14,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:04:14,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-635281753 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-635281753 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-635281753| |P1Thread1of1ForFork1_#t~ite32_Out-635281753|))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In-635281753 |P1Thread1of1ForFork1_#t~ite32_Out-635281753|)) (and (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-635281753 |P1Thread1of1ForFork1_#t~ite32_Out-635281753|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-635281753, ~y$w_buff1~0=~y$w_buff1~0_In-635281753, ~y~0=~y~0_In-635281753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-635281753} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-635281753, ~y$w_buff1~0=~y$w_buff1~0_In-635281753, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-635281753|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-635281753|, ~y~0=~y~0_In-635281753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-635281753} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:04:14,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1269188224 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1269188224 256)))) (or (and (= ~y$w_buff0_used~0_In-1269188224 |P1Thread1of1ForFork1_#t~ite34_Out-1269188224|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1269188224|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1269188224, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1269188224} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1269188224, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1269188224, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1269188224|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:04:14,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1280316891 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1280316891 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1280316891 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1280316891 256)))) (or (and (= ~y$w_buff1_used~0_In1280316891 |P1Thread1of1ForFork1_#t~ite35_Out1280316891|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite35_Out1280316891| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1280316891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1280316891, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1280316891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280316891} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1280316891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1280316891, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1280316891, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1280316891|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280316891} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:04:14,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In660973837 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In660973837 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out660973837|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In660973837 |P1Thread1of1ForFork1_#t~ite36_Out660973837|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In660973837, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In660973837} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In660973837, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In660973837, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out660973837|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:04:14,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In346958381 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In346958381 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In346958381 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In346958381 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out346958381| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In346958381 |P1Thread1of1ForFork1_#t~ite37_Out346958381|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In346958381, ~y$w_buff0_used~0=~y$w_buff0_used~0_In346958381, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In346958381, ~y$w_buff1_used~0=~y$w_buff1_used~0_In346958381} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In346958381, ~y$w_buff0_used~0=~y$w_buff0_used~0_In346958381, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In346958381, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out346958381|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In346958381} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:14,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:14,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:04:14,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1173771623 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1173771623 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1173771623| ~y~0_In-1173771623)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1173771623| ~y$w_buff1~0_In-1173771623) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1173771623, ~y~0=~y~0_In-1173771623, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1173771623, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1173771623} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1173771623|, ~y$w_buff1~0=~y$w_buff1~0_In-1173771623, ~y~0=~y~0_In-1173771623, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1173771623, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1173771623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:04:14,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:04:14,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1061228437 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1061228437 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1061228437 |ULTIMATE.start_main_#t~ite42_Out1061228437|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1061228437| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1061228437, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1061228437} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1061228437, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1061228437, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1061228437|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:04:14,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-485601595 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-485601595 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-485601595 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-485601595 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-485601595|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-485601595 |ULTIMATE.start_main_#t~ite43_Out-485601595|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-485601595, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-485601595, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-485601595, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-485601595} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-485601595, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-485601595, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-485601595|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-485601595, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-485601595} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:04:14,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1805585142 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1805585142 256)))) (or (and (= ~y$r_buff0_thd0~0_In-1805585142 |ULTIMATE.start_main_#t~ite44_Out-1805585142|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1805585142|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805585142, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1805585142} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805585142, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1805585142, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1805585142|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:04:14,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-1167283940 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1167283940 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1167283940 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1167283940 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1167283940| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1167283940| ~y$r_buff1_thd0~0_In-1167283940) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1167283940, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1167283940, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1167283940, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1167283940} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1167283940, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1167283940, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1167283940, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1167283940|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1167283940} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:04:14,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:04:14,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:04:14 BasicIcfg [2019-11-28 18:04:14,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:04:14,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:04:14,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:04:14,599 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:04:14,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:04:01" (3/4) ... [2019-11-28 18:04:14,602 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:04:14,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t317~0.base_27|) (= 0 v_~y$r_buff0_thd2~0_418) (= (select .cse0 |v_ULTIMATE.start_main_~#t317~0.base_27|) 0) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t317~0.base_27| 1)) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_ULTIMATE.start_main_~#t317~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t317~0.base_27| 4)) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t317~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t317~0.base_27|) |v_ULTIMATE.start_main_~#t317~0.offset_19| 0)) |v_#memory_int_11|) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t318~0.offset=|v_ULTIMATE.start_main_~#t318~0.offset_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t318~0.base=|v_ULTIMATE.start_main_~#t318~0.base_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t317~0.base=|v_ULTIMATE.start_main_~#t317~0.base_27|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t317~0.offset=|v_ULTIMATE.start_main_~#t317~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_~#t318~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t318~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t317~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t317~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:14,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t318~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t318~0.base_10|) |v_ULTIMATE.start_main_~#t318~0.offset_9| 1)) |v_#memory_int_5|) (not (= 0 |v_ULTIMATE.start_main_~#t318~0.base_10|)) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t318~0.base_10|)) (= |v_ULTIMATE.start_main_~#t318~0.offset_9| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t318~0.base_10| 4) |v_#length_9|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t318~0.base_10| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t318~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t318~0.base=|v_ULTIMATE.start_main_~#t318~0.base_10|, ULTIMATE.start_main_~#t318~0.offset=|v_ULTIMATE.start_main_~#t318~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t318~0.base, ULTIMATE.start_main_~#t318~0.offset, #length] because there is no mapped edge [2019-11-28 18:04:14,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~x~0_In-1254543217 ~__unbuffered_p0_EAX~0_Out-1254543217) (= ~y$r_buff1_thd2~0_Out-1254543217 ~y$r_buff0_thd2~0_In-1254543217) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1254543217 0)) (= 1 ~y$r_buff0_thd1~0_Out-1254543217) (= ~y$r_buff1_thd1~0_Out-1254543217 ~y$r_buff0_thd1~0_In-1254543217) (= ~y$r_buff1_thd0~0_Out-1254543217 ~y$r_buff0_thd0~0_In-1254543217)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1254543217, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1254543217, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1254543217, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1254543217, ~x~0=~x~0_In-1254543217} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1254543217, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1254543217, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1254543217, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1254543217, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1254543217, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1254543217, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1254543217, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1254543217, ~x~0=~x~0_In-1254543217} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:04:14,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1665441989 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1665441989 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1665441989| ~y$w_buff0_used~0_In1665441989)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1665441989| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1665441989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1665441989} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1665441989|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1665441989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1665441989} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:04:14,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In2117057848 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In2117057848 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2117057848 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In2117057848 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2117057848 |P0Thread1of1ForFork0_#t~ite6_Out2117057848|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out2117057848| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2117057848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2117057848, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2117057848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2117057848} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2117057848|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2117057848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2117057848, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2117057848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2117057848} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:04:14,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In725734741 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In725734741 256) 0)) (.cse0 (= ~y$r_buff0_thd1~0_Out725734741 ~y$r_buff0_thd1~0_In725734741))) (or (and .cse0 .cse1) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out725734741 0) (not .cse2)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In725734741, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In725734741} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In725734741, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out725734741|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out725734741} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:04:14,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In732665681 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In732665681 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In732665681 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In732665681 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out732665681| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out732665681| ~y$r_buff1_thd1~0_In732665681) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In732665681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In732665681, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In732665681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In732665681} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In732665681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In732665681, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out732665681|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In732665681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In732665681} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:04:14,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:04:14,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In303989276 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out303989276| ~y$w_buff1~0_In303989276) (= |P1Thread1of1ForFork1_#t~ite17_In303989276| |P1Thread1of1ForFork1_#t~ite17_Out303989276|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In303989276 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In303989276 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In303989276 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In303989276 256)))) (= ~y$w_buff1~0_In303989276 |P1Thread1of1ForFork1_#t~ite17_Out303989276|) .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out303989276| |P1Thread1of1ForFork1_#t~ite17_Out303989276|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In303989276, ~y$w_buff1~0=~y$w_buff1~0_In303989276, ~y$w_buff0_used~0=~y$w_buff0_used~0_In303989276, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In303989276, ~weak$$choice2~0=~weak$$choice2~0_In303989276, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In303989276|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In303989276} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In303989276, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out303989276|, ~y$w_buff1~0=~y$w_buff1~0_In303989276, ~y$w_buff0_used~0=~y$w_buff0_used~0_In303989276, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In303989276, ~weak$$choice2~0=~weak$$choice2~0_In303989276, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out303989276|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In303989276} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:04:14,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In633908278 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out633908278| ~y$w_buff0_used~0_In633908278) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In633908278 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In633908278 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In633908278 256)) (and (= (mod ~y$w_buff1_used~0_In633908278 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out633908278| |P1Thread1of1ForFork1_#t~ite20_Out633908278|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In633908278| |P1Thread1of1ForFork1_#t~ite20_Out633908278|) (= |P1Thread1of1ForFork1_#t~ite21_Out633908278| ~y$w_buff0_used~0_In633908278)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In633908278, ~y$w_buff0_used~0=~y$w_buff0_used~0_In633908278, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In633908278|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In633908278, ~weak$$choice2~0=~weak$$choice2~0_In633908278, ~y$w_buff1_used~0=~y$w_buff1_used~0_In633908278} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In633908278, ~y$w_buff0_used~0=~y$w_buff0_used~0_In633908278, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out633908278|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In633908278, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out633908278|, ~weak$$choice2~0=~weak$$choice2~0_In633908278, ~y$w_buff1_used~0=~y$w_buff1_used~0_In633908278} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:04:14,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In30974892 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out30974892| |P1Thread1of1ForFork1_#t~ite24_Out30974892|)) (.cse4 (= 0 (mod ~y$w_buff1_used~0_In30974892 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In30974892 256))) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In30974892 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In30974892 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In30974892| |P1Thread1of1ForFork1_#t~ite22_Out30974892|) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out30974892| ~y$w_buff1_used~0_In30974892) .cse1 (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) (and (= ~y$w_buff1_used~0_In30974892 |P1Thread1of1ForFork1_#t~ite24_Out30974892|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out30974892| |P1Thread1of1ForFork1_#t~ite23_In30974892|)))) (let ((.cse6 (not .cse3))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite22_Out30974892| 0) .cse1 (or .cse6 (not .cse4)) (or (not .cse2) .cse6) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out30974892| |P1Thread1of1ForFork1_#t~ite22_Out30974892|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In30974892, ~y$w_buff0_used~0=~y$w_buff0_used~0_In30974892, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In30974892, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In30974892|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In30974892|, ~weak$$choice2~0=~weak$$choice2~0_In30974892, ~y$w_buff1_used~0=~y$w_buff1_used~0_In30974892} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In30974892, ~y$w_buff0_used~0=~y$w_buff0_used~0_In30974892, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In30974892, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out30974892|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out30974892|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out30974892|, ~weak$$choice2~0=~weak$$choice2~0_In30974892, ~y$w_buff1_used~0=~y$w_buff1_used~0_In30974892} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:04:14,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_23|) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_23|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_20|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_22|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_18|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_33|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_26|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:04:14,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-675557713 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In-675557713| |P1Thread1of1ForFork1_#t~ite28_Out-675557713|) (= ~y$r_buff1_thd2~0_In-675557713 |P1Thread1of1ForFork1_#t~ite30_Out-675557713|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-675557713| |P1Thread1of1ForFork1_#t~ite29_Out-675557713|)) (let ((.cse1 (not (= (mod ~y$r_buff0_thd2~0_In-675557713 256) 0)))) (and .cse0 (or (not (= 0 (mod ~y$r_buff1_thd2~0_In-675557713 256))) .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-675557713| |P1Thread1of1ForFork1_#t~ite29_Out-675557713|) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-675557713|) (or (not (= 0 (mod ~y$w_buff1_used~0_In-675557713 256))) .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out-675557713| |P1Thread1of1ForFork1_#t~ite29_Out-675557713|) (not (= 0 (mod ~y$w_buff0_used~0_In-675557713 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-675557713, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-675557713|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-675557713, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-675557713, ~weak$$choice2~0=~weak$$choice2~0_In-675557713, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-675557713|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-675557713} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-675557713, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-675557713|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-675557713|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-675557713, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-675557713, ~weak$$choice2~0=~weak$$choice2~0_In-675557713, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-675557713|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-675557713} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:04:14,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:04:14,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-635281753 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-635281753 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-635281753| |P1Thread1of1ForFork1_#t~ite32_Out-635281753|))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In-635281753 |P1Thread1of1ForFork1_#t~ite32_Out-635281753|)) (and (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-635281753 |P1Thread1of1ForFork1_#t~ite32_Out-635281753|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-635281753, ~y$w_buff1~0=~y$w_buff1~0_In-635281753, ~y~0=~y~0_In-635281753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-635281753} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-635281753, ~y$w_buff1~0=~y$w_buff1~0_In-635281753, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-635281753|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-635281753|, ~y~0=~y~0_In-635281753, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-635281753} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:04:14,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1269188224 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1269188224 256)))) (or (and (= ~y$w_buff0_used~0_In-1269188224 |P1Thread1of1ForFork1_#t~ite34_Out-1269188224|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1269188224|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1269188224, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1269188224} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1269188224, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1269188224, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1269188224|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:04:14,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1280316891 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1280316891 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1280316891 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1280316891 256)))) (or (and (= ~y$w_buff1_used~0_In1280316891 |P1Thread1of1ForFork1_#t~ite35_Out1280316891|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite35_Out1280316891| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1280316891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1280316891, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1280316891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280316891} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1280316891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1280316891, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1280316891, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1280316891|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1280316891} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:04:14,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In660973837 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In660973837 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out660973837|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In660973837 |P1Thread1of1ForFork1_#t~ite36_Out660973837|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In660973837, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In660973837} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In660973837, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In660973837, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out660973837|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:04:14,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In346958381 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In346958381 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In346958381 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In346958381 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out346958381| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In346958381 |P1Thread1of1ForFork1_#t~ite37_Out346958381|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In346958381, ~y$w_buff0_used~0=~y$w_buff0_used~0_In346958381, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In346958381, ~y$w_buff1_used~0=~y$w_buff1_used~0_In346958381} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In346958381, ~y$w_buff0_used~0=~y$w_buff0_used~0_In346958381, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In346958381, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out346958381|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In346958381} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:14,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:04:14,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:04:14,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1173771623 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1173771623 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1173771623| ~y~0_In-1173771623)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1173771623| ~y$w_buff1~0_In-1173771623) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1173771623, ~y~0=~y~0_In-1173771623, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1173771623, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1173771623} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1173771623|, ~y$w_buff1~0=~y$w_buff1~0_In-1173771623, ~y~0=~y~0_In-1173771623, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1173771623, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1173771623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:04:14,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:04:14,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1061228437 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1061228437 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1061228437 |ULTIMATE.start_main_#t~ite42_Out1061228437|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1061228437| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1061228437, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1061228437} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1061228437, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1061228437, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1061228437|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:04:14,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-485601595 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-485601595 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-485601595 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-485601595 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-485601595|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-485601595 |ULTIMATE.start_main_#t~ite43_Out-485601595|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-485601595, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-485601595, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-485601595, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-485601595} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-485601595, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-485601595, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-485601595|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-485601595, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-485601595} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:04:14,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1805585142 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1805585142 256)))) (or (and (= ~y$r_buff0_thd0~0_In-1805585142 |ULTIMATE.start_main_#t~ite44_Out-1805585142|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1805585142|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805585142, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1805585142} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805585142, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1805585142, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1805585142|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:04:14,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-1167283940 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1167283940 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1167283940 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1167283940 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1167283940| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1167283940| ~y$r_buff1_thd0~0_In-1167283940) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1167283940, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1167283940, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1167283940, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1167283940} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1167283940, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1167283940, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1167283940, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1167283940|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1167283940} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:04:14,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76))) 1 0)) 0 1) v_~main$tmp_guard1~0_28)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:04:14,730 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:04:14,731 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:04:14,735 INFO L168 Benchmark]: Toolchain (without parser) took 14998.03 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 461.9 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -72.7 MB). Peak memory consumption was 389.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:14,736 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:04:14,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:14,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:14,737 INFO L168 Benchmark]: Boogie Preprocessor took 43.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:04:14,737 INFO L168 Benchmark]: RCFGBuilder took 688.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:14,738 INFO L168 Benchmark]: TraceAbstraction took 13327.90 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 315.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 325.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:14,738 INFO L168 Benchmark]: Witness Printer took 132.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:04:14,740 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.74 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 737.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 688.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13327.90 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 315.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.8 MB). Peak memory consumption was 325.9 MB. Max. memory is 11.5 GB. * Witness Printer took 132.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t317, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t318, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L764] 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, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 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) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] 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)) [L766] 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)) [L767] 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)) [L770] 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)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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 [L810] 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 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1615 SDtfs, 1806 SDslu, 3445 SDs, 0 SdLazy, 2830 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 20 SyntacticMatches, 15 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8912occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 3180 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 449 ConstructedInterpolants, 0 QuantifiedInterpolants, 116546 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...