./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix034_rmo.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/mix034_rmo.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 3d98a09472ed49784779cf00f3c4893e4ce092bc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:12:30,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:12:30,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:12:30,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:12:30,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:12:30,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:12:30,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:12:30,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:12:30,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:12:30,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:12:30,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:12:30,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:12:30,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:12:30,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:12:30,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:12:30,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:12:30,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:12:30,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:12:30,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:12:30,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:12:30,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:12:30,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:12:30,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:12:30,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:12:30,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:12:30,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:12:30,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:12:30,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:12:30,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:12:30,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:12:30,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:12:30,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:12:30,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:12:30,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:12:30,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:12:30,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:12:30,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:12:30,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:12:30,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:12:30,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:12:30,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:12:30,441 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:12:30,477 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:12:30,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:12:30,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:12:30,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:12:30,482 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:12:30,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:12:30,483 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:12:30,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:12:30,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:12:30,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:12:30,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:12:30,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:12:30,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:12:30,484 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:12:30,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:12:30,485 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:12:30,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:12:30,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:12:30,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:12:30,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:12:30,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:12:30,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:12:30,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:12:30,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:12:30,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:12:30,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:12:30,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:12:30,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:12:30,494 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:12:30,494 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 -> 3d98a09472ed49784779cf00f3c4893e4ce092bc [2019-11-28 18:12:30,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:12:30,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:12:30,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:12:30,832 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:12:30,832 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:12:30,833 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix034_rmo.oepc.i [2019-11-28 18:12:30,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d9a4102/2cb40216fbd242a884561b61519cee60/FLAGc4f4fa9e1 [2019-11-28 18:12:31,458 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:12:31,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_rmo.oepc.i [2019-11-28 18:12:31,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d9a4102/2cb40216fbd242a884561b61519cee60/FLAGc4f4fa9e1 [2019-11-28 18:12:31,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d9a4102/2cb40216fbd242a884561b61519cee60 [2019-11-28 18:12:31,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:12:31,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:12:31,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:31,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:12:31,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:12:31,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:31" (1/1) ... [2019-11-28 18:12:31,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ebd404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:31, skipping insertion in model container [2019-11-28 18:12:31,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:31" (1/1) ... [2019-11-28 18:12:31,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:12:31,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:12:32,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:32,358 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:12:32,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:32,510 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:12:32,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:32 WrapperNode [2019-11-28 18:12:32,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:32,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:32,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:12:32,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:12:32,521 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:12:32" (1/1) ... [2019-11-28 18:12:32,548 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:12:32" (1/1) ... [2019-11-28 18:12:32,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:32,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:12:32,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:12:32,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:12:32,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:32" (1/1) ... [2019-11-28 18:12:32,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:32" (1/1) ... [2019-11-28 18:12:32,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:32" (1/1) ... [2019-11-28 18:12:32,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:32" (1/1) ... [2019-11-28 18:12:32,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:32" (1/1) ... [2019-11-28 18:12:32,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:32" (1/1) ... [2019-11-28 18:12:32,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:32" (1/1) ... [2019-11-28 18:12:32,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:12:32,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:12:32,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:12:32,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:12:32,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:32" (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:12:32,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:12:32,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:12:32,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:12:32,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:12:32,710 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:12:32,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:12:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:12:32,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:12:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:12:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:12:32,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:12:32,713 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:12:33,477 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:12:33,477 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:12:33,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:33 BoogieIcfgContainer [2019-11-28 18:12:33,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:12:33,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:12:33,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:12:33,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:12:33,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:12:31" (1/3) ... [2019-11-28 18:12:33,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f95f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:33, skipping insertion in model container [2019-11-28 18:12:33,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:32" (2/3) ... [2019-11-28 18:12:33,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f95f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:33, skipping insertion in model container [2019-11-28 18:12:33,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:33" (3/3) ... [2019-11-28 18:12:33,497 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_rmo.oepc.i [2019-11-28 18:12:33,510 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:12:33,510 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:33,519 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:33,520 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:33,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,560 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,560 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,570 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,570 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:33,616 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:12:33,639 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:33,639 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:33,639 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:33,639 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:33,640 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:33,640 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:33,640 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:33,640 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:33,658 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-11-28 18:12:33,660 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-11-28 18:12:33,747 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-11-28 18:12:33,747 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:33,764 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:12:33,786 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-11-28 18:12:33,834 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-11-28 18:12:33,834 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:33,842 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:12:33,861 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:12:33,862 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:38,866 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 18:12:39,012 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 18:12:39,258 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-11-28 18:12:39,258 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-11-28 18:12:39,262 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-11-28 18:12:39,831 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-11-28 18:12:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-11-28 18:12:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:12:39,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:39,840 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:12:39,840 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:12:39,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-11-28 18:12:39,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:39,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506320098] [2019-11-28 18:12:39,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:40,071 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:12:40,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506320098] [2019-11-28 18:12:40,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:40,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:40,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915759108] [2019-11-28 18:12:40,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:40,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:40,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:40,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:40,101 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-11-28 18:12:40,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:40,422 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-11-28 18:12:40,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:40,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:12:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:40,515 INFO L225 Difference]: With dead ends: 8598 [2019-11-28 18:12:40,516 INFO L226 Difference]: Without dead ends: 7662 [2019-11-28 18:12:40,517 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:12:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-11-28 18:12:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-11-28 18:12:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-11-28 18:12:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-11-28 18:12:41,007 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-11-28 18:12:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:41,008 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-11-28 18:12:41,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-11-28 18:12:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:12:41,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:41,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:41,021 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:12:41,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:41,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-11-28 18:12:41,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:41,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439156975] [2019-11-28 18:12:41,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:41,204 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:12:41,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439156975] [2019-11-28 18:12:41,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:41,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:41,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131783659] [2019-11-28 18:12:41,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:41,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:41,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:41,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:41,207 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 4 states. [2019-11-28 18:12:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:41,658 INFO L93 Difference]: Finished difference Result 11648 states and 36322 transitions. [2019-11-28 18:12:41,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:41,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:12:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:41,746 INFO L225 Difference]: With dead ends: 11648 [2019-11-28 18:12:41,746 INFO L226 Difference]: Without dead ends: 11634 [2019-11-28 18:12:41,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2019-11-28 18:12:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 10434. [2019-11-28 18:12:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10434 states. [2019-11-28 18:12:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10434 states to 10434 states and 33156 transitions. [2019-11-28 18:12:42,270 INFO L78 Accepts]: Start accepts. Automaton has 10434 states and 33156 transitions. Word has length 11 [2019-11-28 18:12:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:42,271 INFO L462 AbstractCegarLoop]: Abstraction has 10434 states and 33156 transitions. [2019-11-28 18:12:42,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 10434 states and 33156 transitions. [2019-11-28 18:12:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:42,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:42,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:42,276 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:12:42,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:42,277 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-11-28 18:12:42,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:42,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455203643] [2019-11-28 18:12:42,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:42,334 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:12:42,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455203643] [2019-11-28 18:12:42,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:42,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:42,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258806700] [2019-11-28 18:12:42,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:42,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:42,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:42,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:42,336 INFO L87 Difference]: Start difference. First operand 10434 states and 33156 transitions. Second operand 3 states. [2019-11-28 18:12:42,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:42,443 INFO L93 Difference]: Finished difference Result 15676 states and 49653 transitions. [2019-11-28 18:12:42,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:42,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:12:42,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:42,500 INFO L225 Difference]: With dead ends: 15676 [2019-11-28 18:12:42,500 INFO L226 Difference]: Without dead ends: 15676 [2019-11-28 18:12:42,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15676 states. [2019-11-28 18:12:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15676 to 11940. [2019-11-28 18:12:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11940 states. [2019-11-28 18:12:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11940 states to 11940 states and 38316 transitions. [2019-11-28 18:12:42,953 INFO L78 Accepts]: Start accepts. Automaton has 11940 states and 38316 transitions. Word has length 14 [2019-11-28 18:12:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:42,954 INFO L462 AbstractCegarLoop]: Abstraction has 11940 states and 38316 transitions. [2019-11-28 18:12:42,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 11940 states and 38316 transitions. [2019-11-28 18:12:42,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:42,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:42,958 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:42,958 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:12:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:42,958 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-11-28 18:12:42,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:42,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802367794] [2019-11-28 18:12:42,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:43,059 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:12:43,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802367794] [2019-11-28 18:12:43,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:43,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:43,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628197319] [2019-11-28 18:12:43,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:43,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:43,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:43,061 INFO L87 Difference]: Start difference. First operand 11940 states and 38316 transitions. Second operand 4 states. [2019-11-28 18:12:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:43,302 INFO L93 Difference]: Finished difference Result 14601 states and 46104 transitions. [2019-11-28 18:12:43,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:43,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:43,354 INFO L225 Difference]: With dead ends: 14601 [2019-11-28 18:12:43,354 INFO L226 Difference]: Without dead ends: 14601 [2019-11-28 18:12:43,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2019-11-28 18:12:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 13192. [2019-11-28 18:12:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-11-28 18:12:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 42090 transitions. [2019-11-28 18:12:43,997 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 42090 transitions. Word has length 14 [2019-11-28 18:12:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:43,997 INFO L462 AbstractCegarLoop]: Abstraction has 13192 states and 42090 transitions. [2019-11-28 18:12:43,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 42090 transitions. [2019-11-28 18:12:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:44,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:44,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:44,002 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:12:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-11-28 18:12:44,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:44,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373752627] [2019-11-28 18:12:44,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:44,080 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:12:44,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373752627] [2019-11-28 18:12:44,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:44,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:44,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639337181] [2019-11-28 18:12:44,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:44,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:44,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:44,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:44,082 INFO L87 Difference]: Start difference. First operand 13192 states and 42090 transitions. Second operand 4 states. [2019-11-28 18:12:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:44,322 INFO L93 Difference]: Finished difference Result 15525 states and 49066 transitions. [2019-11-28 18:12:44,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:44,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:44,358 INFO L225 Difference]: With dead ends: 15525 [2019-11-28 18:12:44,358 INFO L226 Difference]: Without dead ends: 15525 [2019-11-28 18:12:44,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15525 states. [2019-11-28 18:12:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15525 to 13326. [2019-11-28 18:12:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13326 states. [2019-11-28 18:12:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13326 states to 13326 states and 42542 transitions. [2019-11-28 18:12:44,764 INFO L78 Accepts]: Start accepts. Automaton has 13326 states and 42542 transitions. Word has length 14 [2019-11-28 18:12:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:44,765 INFO L462 AbstractCegarLoop]: Abstraction has 13326 states and 42542 transitions. [2019-11-28 18:12:44,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:44,765 INFO L276 IsEmpty]: Start isEmpty. Operand 13326 states and 42542 transitions. [2019-11-28 18:12:44,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:44,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:44,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:44,770 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:12:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1158249311, now seen corresponding path program 1 times [2019-11-28 18:12:44,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:44,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39978308] [2019-11-28 18:12:44,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:44,836 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:12:44,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39978308] [2019-11-28 18:12:44,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:44,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:44,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535930797] [2019-11-28 18:12:44,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:44,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:44,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:44,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:44,840 INFO L87 Difference]: Start difference. First operand 13326 states and 42542 transitions. Second operand 3 states. [2019-11-28 18:12:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:44,906 INFO L93 Difference]: Finished difference Result 13301 states and 42468 transitions. [2019-11-28 18:12:44,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:44,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:44,929 INFO L225 Difference]: With dead ends: 13301 [2019-11-28 18:12:44,930 INFO L226 Difference]: Without dead ends: 13301 [2019-11-28 18:12:44,930 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:12:45,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13301 states. [2019-11-28 18:12:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13301 to 13301. [2019-11-28 18:12:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13301 states. [2019-11-28 18:12:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13301 states to 13301 states and 42468 transitions. [2019-11-28 18:12:45,295 INFO L78 Accepts]: Start accepts. Automaton has 13301 states and 42468 transitions. Word has length 16 [2019-11-28 18:12:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:45,296 INFO L462 AbstractCegarLoop]: Abstraction has 13301 states and 42468 transitions. [2019-11-28 18:12:45,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 13301 states and 42468 transitions. [2019-11-28 18:12:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:12:45,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:45,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:45,303 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:12:45,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:45,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1545984591, now seen corresponding path program 1 times [2019-11-28 18:12:45,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:45,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821709734] [2019-11-28 18:12:45,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:45,369 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:12:45,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821709734] [2019-11-28 18:12:45,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:45,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:45,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402905203] [2019-11-28 18:12:45,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:45,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:45,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:45,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:45,373 INFO L87 Difference]: Start difference. First operand 13301 states and 42468 transitions. Second operand 3 states. [2019-11-28 18:12:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:45,428 INFO L93 Difference]: Finished difference Result 12583 states and 39558 transitions. [2019-11-28 18:12:45,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:45,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:12:45,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:45,448 INFO L225 Difference]: With dead ends: 12583 [2019-11-28 18:12:45,449 INFO L226 Difference]: Without dead ends: 12583 [2019-11-28 18:12:45,449 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:12:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12583 states. [2019-11-28 18:12:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12583 to 12503. [2019-11-28 18:12:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12503 states. [2019-11-28 18:12:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12503 states to 12503 states and 39326 transitions. [2019-11-28 18:12:45,995 INFO L78 Accepts]: Start accepts. Automaton has 12503 states and 39326 transitions. Word has length 17 [2019-11-28 18:12:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:45,995 INFO L462 AbstractCegarLoop]: Abstraction has 12503 states and 39326 transitions. [2019-11-28 18:12:45,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 12503 states and 39326 transitions. [2019-11-28 18:12:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:12:46,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:46,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:46,000 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:12:46,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash 819852344, now seen corresponding path program 1 times [2019-11-28 18:12:46,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:46,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6656027] [2019-11-28 18:12:46,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:46,049 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:12:46,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6656027] [2019-11-28 18:12:46,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:46,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:46,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019776875] [2019-11-28 18:12:46,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:46,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:46,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:46,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:46,052 INFO L87 Difference]: Start difference. First operand 12503 states and 39326 transitions. Second operand 3 states. [2019-11-28 18:12:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:46,063 INFO L93 Difference]: Finished difference Result 1631 states and 3669 transitions. [2019-11-28 18:12:46,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:46,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:12:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:46,066 INFO L225 Difference]: With dead ends: 1631 [2019-11-28 18:12:46,066 INFO L226 Difference]: Without dead ends: 1631 [2019-11-28 18:12:46,067 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:12:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-11-28 18:12:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2019-11-28 18:12:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2019-11-28 18:12:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 3669 transitions. [2019-11-28 18:12:46,092 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 3669 transitions. Word has length 17 [2019-11-28 18:12:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:46,092 INFO L462 AbstractCegarLoop]: Abstraction has 1631 states and 3669 transitions. [2019-11-28 18:12:46,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 3669 transitions. [2019-11-28 18:12:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:12:46,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:46,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:46,096 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:12:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:46,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-11-28 18:12:46,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:46,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084413770] [2019-11-28 18:12:46,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:46,202 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:12:46,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084413770] [2019-11-28 18:12:46,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:46,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:46,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042243256] [2019-11-28 18:12:46,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:46,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:46,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:46,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:46,204 INFO L87 Difference]: Start difference. First operand 1631 states and 3669 transitions. Second operand 5 states. [2019-11-28 18:12:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:46,432 INFO L93 Difference]: Finished difference Result 2140 states and 4682 transitions. [2019-11-28 18:12:46,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:46,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 18:12:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:46,436 INFO L225 Difference]: With dead ends: 2140 [2019-11-28 18:12:46,436 INFO L226 Difference]: Without dead ends: 2140 [2019-11-28 18:12:46,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-28 18:12:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1699. [2019-11-28 18:12:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-28 18:12:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3809 transitions. [2019-11-28 18:12:46,464 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3809 transitions. Word has length 24 [2019-11-28 18:12:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:46,464 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 3809 transitions. [2019-11-28 18:12:46,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3809 transitions. [2019-11-28 18:12:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:12:46,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:46,467 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:12:46,468 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:12:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-11-28 18:12:46,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:46,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798829538] [2019-11-28 18:12:46,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:46,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798829538] [2019-11-28 18:12:46,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:46,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:46,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968953822] [2019-11-28 18:12:46,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:46,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:46,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:46,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:46,559 INFO L87 Difference]: Start difference. First operand 1699 states and 3809 transitions. Second operand 5 states. [2019-11-28 18:12:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:46,785 INFO L93 Difference]: Finished difference Result 2154 states and 4711 transitions. [2019-11-28 18:12:46,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:46,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:12:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:46,790 INFO L225 Difference]: With dead ends: 2154 [2019-11-28 18:12:46,790 INFO L226 Difference]: Without dead ends: 2154 [2019-11-28 18:12:46,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2019-11-28 18:12:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1645. [2019-11-28 18:12:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2019-11-28 18:12:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 3698 transitions. [2019-11-28 18:12:46,812 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 3698 transitions. Word has length 26 [2019-11-28 18:12:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:46,812 INFO L462 AbstractCegarLoop]: Abstraction has 1645 states and 3698 transitions. [2019-11-28 18:12:46,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 3698 transitions. [2019-11-28 18:12:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:12:46,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:46,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:46,815 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:12:46,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:46,815 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-11-28 18:12:46,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:46,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458499459] [2019-11-28 18:12:46,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:46,883 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:12:46,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458499459] [2019-11-28 18:12:46,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:46,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:46,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445543564] [2019-11-28 18:12:46,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:46,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:46,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:46,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:46,885 INFO L87 Difference]: Start difference. First operand 1645 states and 3698 transitions. Second operand 4 states. [2019-11-28 18:12:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:46,901 INFO L93 Difference]: Finished difference Result 797 states and 1775 transitions. [2019-11-28 18:12:46,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:46,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:12:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:46,903 INFO L225 Difference]: With dead ends: 797 [2019-11-28 18:12:46,903 INFO L226 Difference]: Without dead ends: 797 [2019-11-28 18:12:46,903 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:12:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-28 18:12:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-11-28 18:12:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-28 18:12:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1775 transitions. [2019-11-28 18:12:46,916 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1775 transitions. Word has length 28 [2019-11-28 18:12:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:46,916 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1775 transitions. [2019-11-28 18:12:46,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1775 transitions. [2019-11-28 18:12:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:12:46,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:46,921 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:12:46,921 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:12:46,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1237801842, now seen corresponding path program 1 times [2019-11-28 18:12:46,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:46,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177427835] [2019-11-28 18:12:46,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:47,029 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:12:47,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177427835] [2019-11-28 18:12:47,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:47,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:47,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777190958] [2019-11-28 18:12:47,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:12:47,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:47,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:12:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:12:47,032 INFO L87 Difference]: Start difference. First operand 797 states and 1775 transitions. Second operand 6 states. [2019-11-28 18:12:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:47,624 INFO L93 Difference]: Finished difference Result 1393 states and 2999 transitions. [2019-11-28 18:12:47,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:12:47,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-28 18:12:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:47,627 INFO L225 Difference]: With dead ends: 1393 [2019-11-28 18:12:47,627 INFO L226 Difference]: Without dead ends: 1393 [2019-11-28 18:12:47,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:12:47,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2019-11-28 18:12:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1070. [2019-11-28 18:12:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2019-11-28 18:12:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 2374 transitions. [2019-11-28 18:12:47,639 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 2374 transitions. Word has length 51 [2019-11-28 18:12:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:47,640 INFO L462 AbstractCegarLoop]: Abstraction has 1070 states and 2374 transitions. [2019-11-28 18:12:47,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:12:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 2374 transitions. [2019-11-28 18:12:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:12:47,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:47,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:47,642 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:12:47,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:47,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2123622504, now seen corresponding path program 2 times [2019-11-28 18:12:47,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:47,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913913591] [2019-11-28 18:12:47,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:47,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913913591] [2019-11-28 18:12:47,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:47,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:47,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447258998] [2019-11-28 18:12:47,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:47,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:47,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:47,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:47,725 INFO L87 Difference]: Start difference. First operand 1070 states and 2374 transitions. Second operand 3 states. [2019-11-28 18:12:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:47,779 INFO L93 Difference]: Finished difference Result 1308 states and 2876 transitions. [2019-11-28 18:12:47,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:47,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:12:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:47,783 INFO L225 Difference]: With dead ends: 1308 [2019-11-28 18:12:47,784 INFO L226 Difference]: Without dead ends: 1308 [2019-11-28 18:12:47,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:12:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-11-28 18:12:47,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1082. [2019-11-28 18:12:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-11-28 18:12:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 2405 transitions. [2019-11-28 18:12:47,808 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 2405 transitions. Word has length 51 [2019-11-28 18:12:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:47,809 INFO L462 AbstractCegarLoop]: Abstraction has 1082 states and 2405 transitions. [2019-11-28 18:12:47,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 2405 transitions. [2019-11-28 18:12:47,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:12:47,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:47,813 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:12:47,813 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:12:47,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:47,814 INFO L82 PathProgramCache]: Analyzing trace with hash 953721779, now seen corresponding path program 1 times [2019-11-28 18:12:47,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:47,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731645216] [2019-11-28 18:12:47,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:47,982 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:12:47,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731645216] [2019-11-28 18:12:47,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:47,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:47,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015105137] [2019-11-28 18:12:47,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:12:47,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:12:47,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:47,985 INFO L87 Difference]: Start difference. First operand 1082 states and 2405 transitions. Second operand 7 states. [2019-11-28 18:12:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:48,281 INFO L93 Difference]: Finished difference Result 2908 states and 6314 transitions. [2019-11-28 18:12:48,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:12:48,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:12:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:48,286 INFO L225 Difference]: With dead ends: 2908 [2019-11-28 18:12:48,287 INFO L226 Difference]: Without dead ends: 1983 [2019-11-28 18:12:48,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:12:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2019-11-28 18:12:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1139. [2019-11-28 18:12:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-28 18:12:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2528 transitions. [2019-11-28 18:12:48,310 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2528 transitions. Word has length 52 [2019-11-28 18:12:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:48,311 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 2528 transitions. [2019-11-28 18:12:48,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:12:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2528 transitions. [2019-11-28 18:12:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:12:48,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:48,314 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:12:48,314 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:48,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:48,315 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 2 times [2019-11-28 18:12:48,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:48,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14620646] [2019-11-28 18:12:48,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:48,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:48,483 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:48,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= 0 |v_ULTIMATE.start_main_~#t905~0.offset_24|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t905~0.base_35|)) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t905~0.base_35| 4) |v_#length_15|) (= 0 v_~__unbuffered_p1_EAX~0_37) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t905~0.base_35| 1)) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t905~0.base_35|) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t905~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t905~0.base_35|) |v_ULTIMATE.start_main_~#t905~0.offset_24| 0)) |v_#memory_int_15|) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ULTIMATE.start_main_~#t905~0.offset=|v_ULTIMATE.start_main_~#t905~0.offset_24|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_~#t906~0.base=|v_ULTIMATE.start_main_~#t906~0.base_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ULTIMATE.start_main_~#t906~0.offset=|v_ULTIMATE.start_main_~#t906~0.offset_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, ULTIMATE.start_main_~#t905~0.base=|v_ULTIMATE.start_main_~#t905~0.base_35|, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t905~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t906~0.base, ~z$r_buff1_thd0~0, #length, ULTIMATE.start_main_~#t906~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t905~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:48,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t906~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t906~0.base_13|) |v_ULTIMATE.start_main_~#t906~0.offset_11| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t906~0.base_13| 4)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t906~0.base_13|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t906~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t906~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t906~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t906~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t906~0.base=|v_ULTIMATE.start_main_~#t906~0.base_13|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t906~0.offset=|v_ULTIMATE.start_main_~#t906~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t906~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t906~0.offset] because there is no mapped edge [2019-11-28 18:12:48,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork0_~arg.base_Out1805078436 |P0Thread1of1ForFork0_#in~arg.base_In1805078436|) (= ~z$w_buff1~0_Out1805078436 ~z$w_buff0~0_In1805078436) (= 1 ~z$w_buff0~0_Out1805078436) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1805078436| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1805078436) (= ~z$w_buff1_used~0_Out1805078436 ~z$w_buff0_used~0_In1805078436) (= P0Thread1of1ForFork0_~arg.offset_Out1805078436 |P0Thread1of1ForFork0_#in~arg.offset_In1805078436|) (= (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out1805078436 256))) (not (= 0 (mod ~z$w_buff0_used~0_Out1805078436 256))))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1805078436|) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1805078436)) (= 1 ~z$w_buff0_used~0_Out1805078436)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1805078436|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1805078436, ~z$w_buff0~0=~z$w_buff0~0_In1805078436, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1805078436|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1805078436|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1805078436, ~z$w_buff0~0=~z$w_buff0~0_Out1805078436, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1805078436, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1805078436, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1805078436|, ~z$w_buff1~0=~z$w_buff1~0_Out1805078436, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1805078436, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1805078436|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1805078436} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:48,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1515617671 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1515617671 256)))) (or (and (= 0 (mod ~z$r_buff1_thd2~0_In1515617671 256)) .cse0) (and (= (mod ~z$w_buff1_used~0_In1515617671 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In1515617671 256)))) (= |P1Thread1of1ForFork1_#t~ite23_Out1515617671| |P1Thread1of1ForFork1_#t~ite24_Out1515617671|) (= ~z$w_buff1_used~0_In1515617671 |P1Thread1of1ForFork1_#t~ite23_Out1515617671|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In1515617671| |P1Thread1of1ForFork1_#t~ite23_Out1515617671|) (= ~z$w_buff1_used~0_In1515617671 |P1Thread1of1ForFork1_#t~ite24_Out1515617671|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1515617671, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1515617671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1515617671, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1515617671|, ~weak$$choice2~0=~weak$$choice2~0_In1515617671, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1515617671} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1515617671, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1515617671, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1515617671|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1515617671, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1515617671|, ~weak$$choice2~0=~weak$$choice2~0_In1515617671, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1515617671} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:48,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:48,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:12:48,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In666206365 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In666206365 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out666206365|)) (and (= ~z$w_buff0_used~0_In666206365 |P0Thread1of1ForFork0_#t~ite5_Out666206365|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In666206365, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In666206365} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out666206365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In666206365, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In666206365} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:48,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1980935418 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1980935418 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1980935418 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1980935418 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1980935418| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1980935418 |P0Thread1of1ForFork0_#t~ite6_Out1980935418|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1980935418, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1980935418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1980935418, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1980935418} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1980935418|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1980935418, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1980935418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1980935418, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1980935418} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:48,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-6168499 256) 0)) (.cse2 (= ~z$r_buff0_thd1~0_In-6168499 ~z$r_buff0_thd1~0_Out-6168499)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-6168499 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-6168499) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-6168499, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-6168499} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-6168499, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-6168499|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-6168499} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:48,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1343733304 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1343733304 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1343733304 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1343733304 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1343733304|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In-1343733304 |P0Thread1of1ForFork0_#t~ite8_Out-1343733304|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1343733304, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1343733304, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1343733304, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1343733304} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1343733304, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1343733304|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1343733304, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1343733304, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1343733304} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:48,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out1951541807| |P1Thread1of1ForFork1_#t~ite33_Out1951541807|)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1951541807 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1951541807 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out1951541807| ~z$w_buff1~0_In1951541807) (not .cse0) (not .cse1) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1951541807| ~z~0_In1951541807) .cse2 (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1951541807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951541807, ~z$w_buff1~0=~z$w_buff1~0_In1951541807, ~z~0=~z~0_In1951541807} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1951541807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951541807, ~z$w_buff1~0=~z$w_buff1~0_In1951541807, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1951541807|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1951541807|, ~z~0=~z~0_In1951541807} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:48,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In655318020 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In655318020 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out655318020| ~z$w_buff0_used~0_In655318020) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out655318020|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In655318020, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In655318020} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In655318020, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out655318020|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In655318020} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:48,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In1399147586 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1399147586 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1399147586 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1399147586 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1399147586| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out1399147586| ~z$w_buff1_used~0_In1399147586)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1399147586, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1399147586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1399147586, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1399147586} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1399147586, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1399147586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1399147586, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1399147586|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1399147586} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:48,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1319120644 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1319120644 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1319120644|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1319120644| ~z$r_buff0_thd2~0_In-1319120644) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1319120644, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1319120644} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1319120644, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1319120644, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1319120644|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:48,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-903027452 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-903027452 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-903027452 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-903027452 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-903027452|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-903027452 |P1Thread1of1ForFork1_#t~ite37_Out-903027452|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-903027452, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-903027452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-903027452, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-903027452} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-903027452, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-903027452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-903027452, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-903027452, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-903027452|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:48,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:48,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:48,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~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:12:48,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2007078672 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2007078672 256) 0))) (or (and (= ~z$w_buff1~0_In-2007078672 |ULTIMATE.start_main_#t~ite40_Out-2007078672|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-2007078672 |ULTIMATE.start_main_#t~ite40_Out-2007078672|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2007078672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2007078672, ~z$w_buff1~0=~z$w_buff1~0_In-2007078672, ~z~0=~z~0_In-2007078672} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2007078672|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2007078672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2007078672, ~z$w_buff1~0=~z$w_buff1~0_In-2007078672, ~z~0=~z~0_In-2007078672} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:48,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:12:48,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-694331655 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-694331655 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-694331655|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-694331655 |ULTIMATE.start_main_#t~ite42_Out-694331655|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-694331655, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-694331655} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-694331655, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-694331655, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-694331655|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:48,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1228464931 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1228464931 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1228464931 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1228464931 256) 0))) (or (and (= ~z$w_buff1_used~0_In1228464931 |ULTIMATE.start_main_#t~ite43_Out1228464931|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1228464931|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1228464931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1228464931, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1228464931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1228464931} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1228464931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1228464931, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1228464931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1228464931, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1228464931|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:48,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In683497456 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In683497456 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In683497456 |ULTIMATE.start_main_#t~ite44_Out683497456|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out683497456| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In683497456, ~z$w_buff0_used~0=~z$w_buff0_used~0_In683497456} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In683497456, ~z$w_buff0_used~0=~z$w_buff0_used~0_In683497456, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out683497456|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:48,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1015925250 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1015925250 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1015925250 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1015925250 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1015925250| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1015925250| ~z$r_buff1_thd0~0_In-1015925250) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1015925250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1015925250, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1015925250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1015925250} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1015925250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1015925250, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1015925250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1015925250, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1015925250|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:48,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:48,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:48 BasicIcfg [2019-11-28 18:12:48,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:48,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:48,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:48,584 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:48,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:33" (3/4) ... [2019-11-28 18:12:48,588 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:48,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= 0 |v_ULTIMATE.start_main_~#t905~0.offset_24|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t905~0.base_35|)) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t905~0.base_35| 4) |v_#length_15|) (= 0 v_~__unbuffered_p1_EAX~0_37) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t905~0.base_35| 1)) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t905~0.base_35|) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t905~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t905~0.base_35|) |v_ULTIMATE.start_main_~#t905~0.offset_24| 0)) |v_#memory_int_15|) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ULTIMATE.start_main_~#t905~0.offset=|v_ULTIMATE.start_main_~#t905~0.offset_24|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_~#t906~0.base=|v_ULTIMATE.start_main_~#t906~0.base_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ULTIMATE.start_main_~#t906~0.offset=|v_ULTIMATE.start_main_~#t906~0.offset_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, ULTIMATE.start_main_~#t905~0.base=|v_ULTIMATE.start_main_~#t905~0.base_35|, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t905~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t906~0.base, ~z$r_buff1_thd0~0, #length, ULTIMATE.start_main_~#t906~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t905~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:48,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t906~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t906~0.base_13|) |v_ULTIMATE.start_main_~#t906~0.offset_11| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t906~0.base_13| 4)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t906~0.base_13|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t906~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t906~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t906~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t906~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t906~0.base=|v_ULTIMATE.start_main_~#t906~0.base_13|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t906~0.offset=|v_ULTIMATE.start_main_~#t906~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t906~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t906~0.offset] because there is no mapped edge [2019-11-28 18:12:48,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork0_~arg.base_Out1805078436 |P0Thread1of1ForFork0_#in~arg.base_In1805078436|) (= ~z$w_buff1~0_Out1805078436 ~z$w_buff0~0_In1805078436) (= 1 ~z$w_buff0~0_Out1805078436) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1805078436| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1805078436) (= ~z$w_buff1_used~0_Out1805078436 ~z$w_buff0_used~0_In1805078436) (= P0Thread1of1ForFork0_~arg.offset_Out1805078436 |P0Thread1of1ForFork0_#in~arg.offset_In1805078436|) (= (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out1805078436 256))) (not (= 0 (mod ~z$w_buff0_used~0_Out1805078436 256))))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1805078436|) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1805078436)) (= 1 ~z$w_buff0_used~0_Out1805078436)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1805078436|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1805078436, ~z$w_buff0~0=~z$w_buff0~0_In1805078436, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1805078436|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1805078436|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1805078436, ~z$w_buff0~0=~z$w_buff0~0_Out1805078436, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1805078436, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1805078436, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1805078436|, ~z$w_buff1~0=~z$w_buff1~0_Out1805078436, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1805078436, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1805078436|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1805078436} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:48,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1515617671 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1515617671 256)))) (or (and (= 0 (mod ~z$r_buff1_thd2~0_In1515617671 256)) .cse0) (and (= (mod ~z$w_buff1_used~0_In1515617671 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In1515617671 256)))) (= |P1Thread1of1ForFork1_#t~ite23_Out1515617671| |P1Thread1of1ForFork1_#t~ite24_Out1515617671|) (= ~z$w_buff1_used~0_In1515617671 |P1Thread1of1ForFork1_#t~ite23_Out1515617671|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In1515617671| |P1Thread1of1ForFork1_#t~ite23_Out1515617671|) (= ~z$w_buff1_used~0_In1515617671 |P1Thread1of1ForFork1_#t~ite24_Out1515617671|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1515617671, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1515617671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1515617671, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1515617671|, ~weak$$choice2~0=~weak$$choice2~0_In1515617671, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1515617671} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1515617671, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1515617671, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1515617671|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1515617671, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1515617671|, ~weak$$choice2~0=~weak$$choice2~0_In1515617671, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1515617671} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:48,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:48,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:12:48,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In666206365 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In666206365 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out666206365|)) (and (= ~z$w_buff0_used~0_In666206365 |P0Thread1of1ForFork0_#t~ite5_Out666206365|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In666206365, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In666206365} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out666206365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In666206365, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In666206365} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:48,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1980935418 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1980935418 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1980935418 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1980935418 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1980935418| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1980935418 |P0Thread1of1ForFork0_#t~ite6_Out1980935418|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1980935418, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1980935418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1980935418, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1980935418} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1980935418|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1980935418, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1980935418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1980935418, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1980935418} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:48,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-6168499 256) 0)) (.cse2 (= ~z$r_buff0_thd1~0_In-6168499 ~z$r_buff0_thd1~0_Out-6168499)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-6168499 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-6168499) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-6168499, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-6168499} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-6168499, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-6168499|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-6168499} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:48,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1343733304 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1343733304 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1343733304 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1343733304 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1343733304|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In-1343733304 |P0Thread1of1ForFork0_#t~ite8_Out-1343733304|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1343733304, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1343733304, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1343733304, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1343733304} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1343733304, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1343733304|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1343733304, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1343733304, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1343733304} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:48,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out1951541807| |P1Thread1of1ForFork1_#t~ite33_Out1951541807|)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1951541807 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1951541807 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out1951541807| ~z$w_buff1~0_In1951541807) (not .cse0) (not .cse1) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1951541807| ~z~0_In1951541807) .cse2 (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1951541807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951541807, ~z$w_buff1~0=~z$w_buff1~0_In1951541807, ~z~0=~z~0_In1951541807} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1951541807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1951541807, ~z$w_buff1~0=~z$w_buff1~0_In1951541807, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1951541807|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1951541807|, ~z~0=~z~0_In1951541807} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:48,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In655318020 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In655318020 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out655318020| ~z$w_buff0_used~0_In655318020) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out655318020|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In655318020, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In655318020} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In655318020, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out655318020|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In655318020} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:48,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In1399147586 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1399147586 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1399147586 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1399147586 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1399147586| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out1399147586| ~z$w_buff1_used~0_In1399147586)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1399147586, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1399147586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1399147586, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1399147586} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1399147586, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1399147586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1399147586, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1399147586|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1399147586} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:48,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1319120644 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1319120644 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1319120644|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1319120644| ~z$r_buff0_thd2~0_In-1319120644) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1319120644, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1319120644} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1319120644, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1319120644, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1319120644|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:48,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-903027452 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-903027452 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-903027452 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-903027452 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-903027452|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-903027452 |P1Thread1of1ForFork1_#t~ite37_Out-903027452|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-903027452, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-903027452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-903027452, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-903027452} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-903027452, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-903027452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-903027452, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-903027452, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-903027452|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:48,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:48,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:48,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~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:12:48,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2007078672 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2007078672 256) 0))) (or (and (= ~z$w_buff1~0_In-2007078672 |ULTIMATE.start_main_#t~ite40_Out-2007078672|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-2007078672 |ULTIMATE.start_main_#t~ite40_Out-2007078672|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2007078672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2007078672, ~z$w_buff1~0=~z$w_buff1~0_In-2007078672, ~z~0=~z~0_In-2007078672} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2007078672|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2007078672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2007078672, ~z$w_buff1~0=~z$w_buff1~0_In-2007078672, ~z~0=~z~0_In-2007078672} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:48,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:12:48,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-694331655 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-694331655 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-694331655|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-694331655 |ULTIMATE.start_main_#t~ite42_Out-694331655|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-694331655, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-694331655} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-694331655, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-694331655, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-694331655|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:48,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1228464931 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1228464931 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1228464931 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1228464931 256) 0))) (or (and (= ~z$w_buff1_used~0_In1228464931 |ULTIMATE.start_main_#t~ite43_Out1228464931|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1228464931|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1228464931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1228464931, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1228464931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1228464931} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1228464931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1228464931, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1228464931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1228464931, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1228464931|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:48,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In683497456 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In683497456 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In683497456 |ULTIMATE.start_main_#t~ite44_Out683497456|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out683497456| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In683497456, ~z$w_buff0_used~0=~z$w_buff0_used~0_In683497456} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In683497456, ~z$w_buff0_used~0=~z$w_buff0_used~0_In683497456, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out683497456|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:48,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1015925250 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1015925250 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1015925250 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1015925250 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1015925250| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1015925250| ~z$r_buff1_thd0~0_In-1015925250) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1015925250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1015925250, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1015925250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1015925250} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1015925250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1015925250, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1015925250, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1015925250, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1015925250|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:48,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:48,701 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:48,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:48,703 INFO L168 Benchmark]: Toolchain (without parser) took 16943.58 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 479.2 MB). Free memory was 951.0 MB in the beginning and 748.8 MB in the end (delta: 202.2 MB). Peak memory consumption was 681.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,704 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:48,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:48,705 INFO L168 Benchmark]: Boogie Preprocessor took 58.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,706 INFO L168 Benchmark]: RCFGBuilder took 834.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,707 INFO L168 Benchmark]: TraceAbstraction took 15096.89 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 372.2 MB). Free memory was 1.0 GB in the beginning and 760.9 MB in the end (delta: 253.7 MB). Peak memory consumption was 625.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,708 INFO L168 Benchmark]: Witness Printer took 117.86 ms. Allocated memory is still 1.5 GB. Free memory was 760.9 MB in the beginning and 748.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,711 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 749.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 834.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15096.89 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 372.2 MB). Free memory was 1.0 GB in the beginning and 760.9 MB in the end (delta: 253.7 MB). Peak memory consumption was 625.9 MB. Max. memory is 11.5 GB. * Witness Printer took 117.86 ms. Allocated memory is still 1.5 GB. Free memory was 760.9 MB in the beginning and 748.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t905, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t906, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z 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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) 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, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) 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, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) 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, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z 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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1745 SDtfs, 1262 SDslu, 3160 SDs, 0 SdLazy, 1538 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13326occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 10967 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 39860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...