./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi000_pso.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/rfi000_pso.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 c3dc71537b9a4a93609d1b2b43dd9efd139178bf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21:15,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:21:15,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:21:15,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:21:15,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:21:15,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:21:15,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:21:15,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:21:15,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:21:15,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:21:15,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:21:15,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:21:15,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:21:15,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:21:15,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:21:15,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:21:15,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:21:15,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:21:15,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:21:15,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:21:15,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:21:15,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:21:15,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:21:15,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:21:15,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:21:15,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:21:15,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:21:15,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:21:15,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:21:15,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:21:15,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:21:15,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:21:15,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:21:15,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:21:15,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:21:15,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:21:15,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:21:15,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:21:15,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:21:15,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:21:15,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:21:15,523 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:21:15,537 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:21:15,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:21:15,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:21:15,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:21:15,540 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:21:15,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:21:15,540 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:21:15,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:21:15,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:21:15,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:21:15,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:21:15,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:21:15,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:21:15,542 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:21:15,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:21:15,543 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:21:15,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:21:15,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:21:15,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:21:15,544 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:21:15,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:21:15,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:21:15,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:21:15,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:21:15,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:21:15,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:21:15,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:21:15,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:21:15,546 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:21:15,546 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 -> c3dc71537b9a4a93609d1b2b43dd9efd139178bf [2019-11-28 18:21:15,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:21:15,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:21:15,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:21:15,867 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:21:15,867 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:21:15,868 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc.i [2019-11-28 18:21:15,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a416e1931/4d21a038a1384652b5e0b24442b839dc/FLAG57f00f6d1 [2019-11-28 18:21:16,483 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:21:16,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi000_pso.oepc.i [2019-11-28 18:21:16,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a416e1931/4d21a038a1384652b5e0b24442b839dc/FLAG57f00f6d1 [2019-11-28 18:21:16,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a416e1931/4d21a038a1384652b5e0b24442b839dc [2019-11-28 18:21:16,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:21:16,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:21:16,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:21:16,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:21:16,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:21:16,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:21:16" (1/1) ... [2019-11-28 18:21:16,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc9a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:16, skipping insertion in model container [2019-11-28 18:21:16,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:21:16" (1/1) ... [2019-11-28 18:21:16,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:21:16,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:21:17,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:21:17,345 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:21:17,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:21:17,497 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:21:17,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17 WrapperNode [2019-11-28 18:21:17,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:21:17,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:21:17,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:21:17,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:21:17,508 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:21:17" (1/1) ... [2019-11-28 18:21:17,534 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:21:17" (1/1) ... [2019-11-28 18:21:17,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:21:17,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:21:17,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:21:17,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:21:17,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (1/1) ... [2019-11-28 18:21:17,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:21:17,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:21:17,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:21:17,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:21:17,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (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:21:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:21:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:21:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:21:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:21:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:21:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:21:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:21:17,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:21:17,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:21:17,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:21:17,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:21:17,723 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:21:18,817 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:21:18,818 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:21:18,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:18 BoogieIcfgContainer [2019-11-28 18:21:18,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:21:18,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:21:18,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:21:18,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:21:18,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:21:16" (1/3) ... [2019-11-28 18:21:18,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497827dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:21:18, skipping insertion in model container [2019-11-28 18:21:18,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:17" (2/3) ... [2019-11-28 18:21:18,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497827dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:21:18, skipping insertion in model container [2019-11-28 18:21:18,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:18" (3/3) ... [2019-11-28 18:21:18,828 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_pso.oepc.i [2019-11-28 18:21:18,838 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:21:18,839 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:21:18,847 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:21:18,849 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:21:18,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,898 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,898 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,898 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,899 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,899 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,911 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,911 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:18,989 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:21:19,010 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:21:19,011 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:21:19,011 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:21:19,011 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:21:19,011 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:21:19,012 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:21:19,012 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:21:19,012 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:21:19,030 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-11-28 18:21:19,032 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-11-28 18:21:19,164 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-11-28 18:21:19,164 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:21:19,204 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-11-28 18:21:19,280 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-11-28 18:21:19,362 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-11-28 18:21:19,363 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:21:19,394 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1205 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-11-28 18:21:19,468 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 41414 [2019-11-28 18:21:19,470 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:21:22,731 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-11-28 18:21:25,517 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:21:25,677 INFO L206 etLargeBlockEncoding]: Checked pairs total: 238871 [2019-11-28 18:21:25,678 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-11-28 18:21:25,682 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 186 transitions [2019-11-28 18:21:30,586 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 55330 states. [2019-11-28 18:21:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 55330 states. [2019-11-28 18:21:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:21:30,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:30,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:21:30,595 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:21:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:30,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1316112, now seen corresponding path program 1 times [2019-11-28 18:21:30,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:30,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617384702] [2019-11-28 18:21:30,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:30,846 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:21:30,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617384702] [2019-11-28 18:21:30,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:30,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:21:30,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040879093] [2019-11-28 18:21:30,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:30,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:30,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:30,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:30,871 INFO L87 Difference]: Start difference. First operand 55330 states. Second operand 3 states. [2019-11-28 18:21:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:31,539 INFO L93 Difference]: Finished difference Result 55134 states and 195732 transitions. [2019-11-28 18:21:31,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:31,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:21:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:31,861 INFO L225 Difference]: With dead ends: 55134 [2019-11-28 18:21:31,861 INFO L226 Difference]: Without dead ends: 54186 [2019-11-28 18:21:31,863 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:21:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54186 states. [2019-11-28 18:21:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54186 to 54186. [2019-11-28 18:21:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54186 states. [2019-11-28 18:21:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54186 states to 54186 states and 192533 transitions. [2019-11-28 18:21:34,657 INFO L78 Accepts]: Start accepts. Automaton has 54186 states and 192533 transitions. Word has length 3 [2019-11-28 18:21:34,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:34,657 INFO L462 AbstractCegarLoop]: Abstraction has 54186 states and 192533 transitions. [2019-11-28 18:21:34,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 54186 states and 192533 transitions. [2019-11-28 18:21:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:21:34,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:34,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:34,661 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:21:34,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:34,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1209114037, now seen corresponding path program 1 times [2019-11-28 18:21:34,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:34,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468194455] [2019-11-28 18:21:34,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:34,781 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:21:34,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468194455] [2019-11-28 18:21:34,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:34,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:34,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549747365] [2019-11-28 18:21:34,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:21:34,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:34,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:21:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:21:34,785 INFO L87 Difference]: Start difference. First operand 54186 states and 192533 transitions. Second operand 4 states. [2019-11-28 18:21:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:34,872 INFO L93 Difference]: Finished difference Result 6606 states and 17259 transitions. [2019-11-28 18:21:34,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:21:34,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:21:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:34,892 INFO L225 Difference]: With dead ends: 6606 [2019-11-28 18:21:34,893 INFO L226 Difference]: Without dead ends: 5658 [2019-11-28 18:21:34,894 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:21:34,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2019-11-28 18:21:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5658. [2019-11-28 18:21:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5658 states. [2019-11-28 18:21:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5658 states to 5658 states and 14157 transitions. [2019-11-28 18:21:35,004 INFO L78 Accepts]: Start accepts. Automaton has 5658 states and 14157 transitions. Word has length 11 [2019-11-28 18:21:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:35,005 INFO L462 AbstractCegarLoop]: Abstraction has 5658 states and 14157 transitions. [2019-11-28 18:21:35,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:21:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5658 states and 14157 transitions. [2019-11-28 18:21:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:21:35,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:35,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:35,007 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:21:35,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:35,008 INFO L82 PathProgramCache]: Analyzing trace with hash 196484102, now seen corresponding path program 1 times [2019-11-28 18:21:35,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:35,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828689255] [2019-11-28 18:21:35,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:35,117 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:21:35,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828689255] [2019-11-28 18:21:35,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:35,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:35,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041259989] [2019-11-28 18:21:35,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:21:35,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:35,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:21:35,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:21:35,123 INFO L87 Difference]: Start difference. First operand 5658 states and 14157 transitions. Second operand 4 states. [2019-11-28 18:21:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:35,518 INFO L93 Difference]: Finished difference Result 7256 states and 17796 transitions. [2019-11-28 18:21:35,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:21:35,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:21:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:35,538 INFO L225 Difference]: With dead ends: 7256 [2019-11-28 18:21:35,539 INFO L226 Difference]: Without dead ends: 7256 [2019-11-28 18:21:35,539 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:21:35,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2019-11-28 18:21:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 7222. [2019-11-28 18:21:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7222 states. [2019-11-28 18:21:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 17730 transitions. [2019-11-28 18:21:35,714 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 17730 transitions. Word has length 14 [2019-11-28 18:21:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:35,715 INFO L462 AbstractCegarLoop]: Abstraction has 7222 states and 17730 transitions. [2019-11-28 18:21:35,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:21:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 17730 transitions. [2019-11-28 18:21:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:21:35,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:35,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:35,722 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:21:35,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1725930936, now seen corresponding path program 1 times [2019-11-28 18:21:35,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:35,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095291584] [2019-11-28 18:21:35,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:35,855 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:21:35,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095291584] [2019-11-28 18:21:35,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:35,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:35,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575859721] [2019-11-28 18:21:35,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:35,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:35,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:35,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:35,858 INFO L87 Difference]: Start difference. First operand 7222 states and 17730 transitions. Second operand 5 states. [2019-11-28 18:21:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:36,648 INFO L93 Difference]: Finished difference Result 8308 states and 20180 transitions. [2019-11-28 18:21:36,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:21:36,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 18:21:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:36,667 INFO L225 Difference]: With dead ends: 8308 [2019-11-28 18:21:36,668 INFO L226 Difference]: Without dead ends: 8308 [2019-11-28 18:21:36,668 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:21:36,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8308 states. [2019-11-28 18:21:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8308 to 8206. [2019-11-28 18:21:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-11-28 18:21:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 19982 transitions. [2019-11-28 18:21:36,835 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 19982 transitions. Word has length 30 [2019-11-28 18:21:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:36,836 INFO L462 AbstractCegarLoop]: Abstraction has 8206 states and 19982 transitions. [2019-11-28 18:21:36,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 19982 transitions. [2019-11-28 18:21:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 18:21:36,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:36,840 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:36,840 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:21:36,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1964223061, now seen corresponding path program 1 times [2019-11-28 18:21:36,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:36,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985165829] [2019-11-28 18:21:36,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:36,889 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:21:36,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985165829] [2019-11-28 18:21:36,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:36,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:36,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186881921] [2019-11-28 18:21:36,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:36,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:36,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:36,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:36,893 INFO L87 Difference]: Start difference. First operand 8206 states and 19982 transitions. Second operand 3 states. [2019-11-28 18:21:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:37,020 INFO L93 Difference]: Finished difference Result 12335 states and 28548 transitions. [2019-11-28 18:21:37,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:37,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 18:21:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:37,040 INFO L225 Difference]: With dead ends: 12335 [2019-11-28 18:21:37,040 INFO L226 Difference]: Without dead ends: 12335 [2019-11-28 18:21:37,041 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:21:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12335 states. [2019-11-28 18:21:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12335 to 11324. [2019-11-28 18:21:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11324 states. [2019-11-28 18:21:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11324 states to 11324 states and 26462 transitions. [2019-11-28 18:21:37,262 INFO L78 Accepts]: Start accepts. Automaton has 11324 states and 26462 transitions. Word has length 31 [2019-11-28 18:21:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:37,263 INFO L462 AbstractCegarLoop]: Abstraction has 11324 states and 26462 transitions. [2019-11-28 18:21:37,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 11324 states and 26462 transitions. [2019-11-28 18:21:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 18:21:37,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:37,271 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] [2019-11-28 18:21:37,271 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:21:37,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:37,272 INFO L82 PathProgramCache]: Analyzing trace with hash -71378589, now seen corresponding path program 1 times [2019-11-28 18:21:37,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:37,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911242461] [2019-11-28 18:21:37,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:37,467 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:21:37,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911242461] [2019-11-28 18:21:37,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:37,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:37,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351355179] [2019-11-28 18:21:37,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:37,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:37,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:37,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:37,475 INFO L87 Difference]: Start difference. First operand 11324 states and 26462 transitions. Second operand 5 states. [2019-11-28 18:21:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:37,965 INFO L93 Difference]: Finished difference Result 12877 states and 29790 transitions. [2019-11-28 18:21:37,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:21:37,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 18:21:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:37,981 INFO L225 Difference]: With dead ends: 12877 [2019-11-28 18:21:37,982 INFO L226 Difference]: Without dead ends: 12877 [2019-11-28 18:21:37,982 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:21:38,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-11-28 18:21:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 11566. [2019-11-28 18:21:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11566 states. [2019-11-28 18:21:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11566 states to 11566 states and 27002 transitions. [2019-11-28 18:21:38,210 INFO L78 Accepts]: Start accepts. Automaton has 11566 states and 27002 transitions. Word has length 33 [2019-11-28 18:21:38,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:38,211 INFO L462 AbstractCegarLoop]: Abstraction has 11566 states and 27002 transitions. [2019-11-28 18:21:38,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 11566 states and 27002 transitions. [2019-11-28 18:21:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:21:38,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:38,222 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] [2019-11-28 18:21:38,222 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:21:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:38,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1192698792, now seen corresponding path program 1 times [2019-11-28 18:21:38,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:38,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163653333] [2019-11-28 18:21:38,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:38,349 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:21:38,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163653333] [2019-11-28 18:21:38,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:38,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:21:38,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888879608] [2019-11-28 18:21:38,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:38,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:38,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:38,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:38,353 INFO L87 Difference]: Start difference. First operand 11566 states and 27002 transitions. Second operand 5 states. [2019-11-28 18:21:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:38,398 INFO L93 Difference]: Finished difference Result 2231 states and 4806 transitions. [2019-11-28 18:21:38,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:21:38,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-28 18:21:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:38,403 INFO L225 Difference]: With dead ends: 2231 [2019-11-28 18:21:38,403 INFO L226 Difference]: Without dead ends: 2067 [2019-11-28 18:21:38,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:21:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-11-28 18:21:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2029. [2019-11-28 18:21:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2019-11-28 18:21:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 4378 transitions. [2019-11-28 18:21:38,433 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 4378 transitions. Word has length 42 [2019-11-28 18:21:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:38,435 INFO L462 AbstractCegarLoop]: Abstraction has 2029 states and 4378 transitions. [2019-11-28 18:21:38,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 4378 transitions. [2019-11-28 18:21:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 18:21:38,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:38,440 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] [2019-11-28 18:21:38,440 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:21:38,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1557518893, now seen corresponding path program 1 times [2019-11-28 18:21:38,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:38,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760878647] [2019-11-28 18:21:38,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:38,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760878647] [2019-11-28 18:21:38,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:38,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:21:38,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517380737] [2019-11-28 18:21:38,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:21:38,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:38,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:21:38,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:21:38,598 INFO L87 Difference]: Start difference. First operand 2029 states and 4378 transitions. Second operand 6 states. [2019-11-28 18:21:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:38,932 INFO L93 Difference]: Finished difference Result 2332 states and 4945 transitions. [2019-11-28 18:21:38,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:21:38,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-28 18:21:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:38,936 INFO L225 Difference]: With dead ends: 2332 [2019-11-28 18:21:38,936 INFO L226 Difference]: Without dead ends: 2307 [2019-11-28 18:21:38,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:21:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-28 18:21:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2245. [2019-11-28 18:21:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-11-28 18:21:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 4780 transitions. [2019-11-28 18:21:38,974 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 4780 transitions. Word has length 43 [2019-11-28 18:21:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:38,975 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 4780 transitions. [2019-11-28 18:21:38,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:21:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 4780 transitions. [2019-11-28 18:21:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 18:21:38,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:38,986 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] [2019-11-28 18:21:38,986 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:21:38,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:38,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1777006862, now seen corresponding path program 1 times [2019-11-28 18:21:38,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:38,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417573507] [2019-11-28 18:21:38,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:39,056 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:21:39,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417573507] [2019-11-28 18:21:39,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:39,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:39,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042336599] [2019-11-28 18:21:39,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:39,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:39,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:39,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:39,058 INFO L87 Difference]: Start difference. First operand 2245 states and 4780 transitions. Second operand 3 states. [2019-11-28 18:21:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:39,129 INFO L93 Difference]: Finished difference Result 2436 states and 4911 transitions. [2019-11-28 18:21:39,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:39,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-28 18:21:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:39,134 INFO L225 Difference]: With dead ends: 2436 [2019-11-28 18:21:39,134 INFO L226 Difference]: Without dead ends: 2436 [2019-11-28 18:21:39,134 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:21:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2019-11-28 18:21:39,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2189. [2019-11-28 18:21:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2019-11-28 18:21:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 4433 transitions. [2019-11-28 18:21:39,165 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 4433 transitions. Word has length 46 [2019-11-28 18:21:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:39,166 INFO L462 AbstractCegarLoop]: Abstraction has 2189 states and 4433 transitions. [2019-11-28 18:21:39,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 4433 transitions. [2019-11-28 18:21:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 18:21:39,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:39,170 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] [2019-11-28 18:21:39,171 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:21:39,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:39,171 INFO L82 PathProgramCache]: Analyzing trace with hash -753849587, now seen corresponding path program 1 times [2019-11-28 18:21:39,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:39,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501644575] [2019-11-28 18:21:39,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:39,285 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:21:39,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501644575] [2019-11-28 18:21:39,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:39,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:21:39,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983924341] [2019-11-28 18:21:39,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:21:39,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:39,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:21:39,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:21:39,288 INFO L87 Difference]: Start difference. First operand 2189 states and 4433 transitions. Second operand 6 states. [2019-11-28 18:21:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:39,651 INFO L93 Difference]: Finished difference Result 2336 states and 4693 transitions. [2019-11-28 18:21:39,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:21:39,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-11-28 18:21:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:39,657 INFO L225 Difference]: With dead ends: 2336 [2019-11-28 18:21:39,657 INFO L226 Difference]: Without dead ends: 2268 [2019-11-28 18:21:39,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:21:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-11-28 18:21:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2036. [2019-11-28 18:21:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2036 states. [2019-11-28 18:21:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 4127 transitions. [2019-11-28 18:21:39,694 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 4127 transitions. Word has length 49 [2019-11-28 18:21:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:39,694 INFO L462 AbstractCegarLoop]: Abstraction has 2036 states and 4127 transitions. [2019-11-28 18:21:39,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:21:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 4127 transitions. [2019-11-28 18:21:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-28 18:21:39,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:39,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:39,701 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:21:39,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:39,701 INFO L82 PathProgramCache]: Analyzing trace with hash -253914571, now seen corresponding path program 1 times [2019-11-28 18:21:39,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:39,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711467154] [2019-11-28 18:21:39,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:39,877 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:21:39,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711467154] [2019-11-28 18:21:39,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:39,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:21:39,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300530489] [2019-11-28 18:21:39,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:39,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:39,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:39,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:39,882 INFO L87 Difference]: Start difference. First operand 2036 states and 4127 transitions. Second operand 5 states. [2019-11-28 18:21:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:40,077 INFO L93 Difference]: Finished difference Result 3209 states and 6530 transitions. [2019-11-28 18:21:40,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:21:40,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-28 18:21:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:40,081 INFO L225 Difference]: With dead ends: 3209 [2019-11-28 18:21:40,081 INFO L226 Difference]: Without dead ends: 3209 [2019-11-28 18:21:40,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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:21:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2019-11-28 18:21:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 2789. [2019-11-28 18:21:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2019-11-28 18:21:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 5726 transitions. [2019-11-28 18:21:40,114 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 5726 transitions. Word has length 85 [2019-11-28 18:21:40,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:40,115 INFO L462 AbstractCegarLoop]: Abstraction has 2789 states and 5726 transitions. [2019-11-28 18:21:40,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:40,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 5726 transitions. [2019-11-28 18:21:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-28 18:21:40,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:40,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:40,121 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:21:40,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:40,121 INFO L82 PathProgramCache]: Analyzing trace with hash -963574665, now seen corresponding path program 1 times [2019-11-28 18:21:40,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:40,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251773868] [2019-11-28 18:21:40,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:40,217 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:21:40,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251773868] [2019-11-28 18:21:40,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:40,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:40,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212178862] [2019-11-28 18:21:40,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:40,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:40,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:40,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:40,220 INFO L87 Difference]: Start difference. First operand 2789 states and 5726 transitions. Second operand 3 states. [2019-11-28 18:21:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:40,262 INFO L93 Difference]: Finished difference Result 2788 states and 5724 transitions. [2019-11-28 18:21:40,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:40,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-28 18:21:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:40,266 INFO L225 Difference]: With dead ends: 2788 [2019-11-28 18:21:40,266 INFO L226 Difference]: Without dead ends: 2788 [2019-11-28 18:21:40,267 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:21:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2019-11-28 18:21:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2565. [2019-11-28 18:21:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2019-11-28 18:21:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 5309 transitions. [2019-11-28 18:21:40,299 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 5309 transitions. Word has length 86 [2019-11-28 18:21:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:40,300 INFO L462 AbstractCegarLoop]: Abstraction has 2565 states and 5309 transitions. [2019-11-28 18:21:40,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 5309 transitions. [2019-11-28 18:21:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 18:21:40,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:40,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:40,305 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:21:40,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:40,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1762061429, now seen corresponding path program 1 times [2019-11-28 18:21:40,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:40,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497229138] [2019-11-28 18:21:40,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:40,679 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:21:40,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497229138] [2019-11-28 18:21:40,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:40,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:21:40,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327822557] [2019-11-28 18:21:40,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:21:40,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:40,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:21:40,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:21:40,682 INFO L87 Difference]: Start difference. First operand 2565 states and 5309 transitions. Second operand 9 states. [2019-11-28 18:21:41,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:41,693 INFO L93 Difference]: Finished difference Result 9555 states and 19716 transitions. [2019-11-28 18:21:41,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 18:21:41,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-11-28 18:21:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:41,702 INFO L225 Difference]: With dead ends: 9555 [2019-11-28 18:21:41,702 INFO L226 Difference]: Without dead ends: 7648 [2019-11-28 18:21:41,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-11-28 18:21:41,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7648 states. [2019-11-28 18:21:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7648 to 2692. [2019-11-28 18:21:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2019-11-28 18:21:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 5552 transitions. [2019-11-28 18:21:41,752 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 5552 transitions. Word has length 87 [2019-11-28 18:21:41,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:41,752 INFO L462 AbstractCegarLoop]: Abstraction has 2692 states and 5552 transitions. [2019-11-28 18:21:41,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:21:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 5552 transitions. [2019-11-28 18:21:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 18:21:41,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:41,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:41,759 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:21:41,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:41,759 INFO L82 PathProgramCache]: Analyzing trace with hash -339855243, now seen corresponding path program 2 times [2019-11-28 18:21:41,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:41,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930245484] [2019-11-28 18:21:41,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:41,966 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:21:41,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930245484] [2019-11-28 18:21:41,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:41,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:21:41,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795096323] [2019-11-28 18:21:41,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:21:41,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:41,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:21:41,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:21:41,969 INFO L87 Difference]: Start difference. First operand 2692 states and 5552 transitions. Second operand 9 states. [2019-11-28 18:21:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:42,860 INFO L93 Difference]: Finished difference Result 7970 states and 16363 transitions. [2019-11-28 18:21:42,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 18:21:42,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-11-28 18:21:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:42,867 INFO L225 Difference]: With dead ends: 7970 [2019-11-28 18:21:42,867 INFO L226 Difference]: Without dead ends: 6240 [2019-11-28 18:21:42,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-11-28 18:21:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6240 states. [2019-11-28 18:21:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6240 to 3005. [2019-11-28 18:21:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2019-11-28 18:21:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 6183 transitions. [2019-11-28 18:21:42,912 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 6183 transitions. Word has length 87 [2019-11-28 18:21:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:42,913 INFO L462 AbstractCegarLoop]: Abstraction has 3005 states and 6183 transitions. [2019-11-28 18:21:42,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:21:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 6183 transitions. [2019-11-28 18:21:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 18:21:42,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:42,918 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:42,919 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:21:42,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:42,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1343981707, now seen corresponding path program 3 times [2019-11-28 18:21:42,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:42,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15725543] [2019-11-28 18:21:42,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:43,041 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:21:43,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15725543] [2019-11-28 18:21:43,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:43,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:21:43,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289669901] [2019-11-28 18:21:43,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:43,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:43,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:43,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:43,043 INFO L87 Difference]: Start difference. First operand 3005 states and 6183 transitions. Second operand 5 states. [2019-11-28 18:21:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:43,127 INFO L93 Difference]: Finished difference Result 4793 states and 9844 transitions. [2019-11-28 18:21:43,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:21:43,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-11-28 18:21:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:43,130 INFO L225 Difference]: With dead ends: 4793 [2019-11-28 18:21:43,130 INFO L226 Difference]: Without dead ends: 1833 [2019-11-28 18:21:43,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:21:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2019-11-28 18:21:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1737. [2019-11-28 18:21:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2019-11-28 18:21:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 3558 transitions. [2019-11-28 18:21:43,155 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 3558 transitions. Word has length 87 [2019-11-28 18:21:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:43,156 INFO L462 AbstractCegarLoop]: Abstraction has 1737 states and 3558 transitions. [2019-11-28 18:21:43,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 3558 transitions. [2019-11-28 18:21:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 18:21:43,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:43,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:43,160 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:43,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash -768002551, now seen corresponding path program 4 times [2019-11-28 18:21:43,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:43,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716402204] [2019-11-28 18:21:43,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:43,534 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:21:43,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716402204] [2019-11-28 18:21:43,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:43,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-28 18:21:43,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134797017] [2019-11-28 18:21:43,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 18:21:43,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:43,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 18:21:43,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-28 18:21:43,536 INFO L87 Difference]: Start difference. First operand 1737 states and 3558 transitions. Second operand 18 states. [2019-11-28 18:21:44,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:44,626 INFO L93 Difference]: Finished difference Result 3976 states and 8093 transitions. [2019-11-28 18:21:44,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 18:21:44,627 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-11-28 18:21:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:44,631 INFO L225 Difference]: With dead ends: 3976 [2019-11-28 18:21:44,631 INFO L226 Difference]: Without dead ends: 3935 [2019-11-28 18:21:44,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=1183, Unknown=0, NotChecked=0, Total=1406 [2019-11-28 18:21:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3935 states. [2019-11-28 18:21:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3935 to 2921. [2019-11-28 18:21:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2921 states. [2019-11-28 18:21:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 6016 transitions. [2019-11-28 18:21:44,663 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 6016 transitions. Word has length 87 [2019-11-28 18:21:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:44,663 INFO L462 AbstractCegarLoop]: Abstraction has 2921 states and 6016 transitions. [2019-11-28 18:21:44,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 18:21:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 6016 transitions. [2019-11-28 18:21:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 18:21:44,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:44,667 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:44,667 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:44,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:44,668 INFO L82 PathProgramCache]: Analyzing trace with hash 927908343, now seen corresponding path program 5 times [2019-11-28 18:21:44,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:44,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691352145] [2019-11-28 18:21:44,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:21:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:21:44,830 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:21:44,830 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:21:44,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1301] [1301] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1589~0.base_22|) (= v_~y$r_buff0_thd0~0_332 0) (= 0 v_~x~0_194) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1~0_277 0) (= v_~__unbuffered_p1_EBX~0_58 0) (= v_~y$flush_delayed~0_268 0) (= v_~main$tmp_guard0~0_27 0) (= v_~y$r_buff0_thd1~0_239 0) (= 0 v_~weak$$choice0~0_149) (= v_~y$w_buff1_used~0_756 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_88) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1589~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1589~0.base_22|) |v_ULTIMATE.start_main_~#t1589~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff1_thd2~0_570) (= v_~y$r_buff1_thd0~0_410 0) (= 0 v_~y$r_buff0_thd2~0_605) (= 0 v_~__unbuffered_cnt~0_64) (= v_~weak$$choice2~0_244 0) (= 0 v_~y$w_buff0~0_330) (= (store .cse0 |v_ULTIMATE.start_main_~#t1589~0.base_22| 1) |v_#valid_52|) (= 0 |v_#NULL.base_7|) (= v_~y~0_435 0) (= v_~main$tmp_guard1~0_84 0) (= 0 |v_ULTIMATE.start_main_~#t1589~0.offset_16|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1589~0.base_22| 4)) (= 0 v_~y$read_delayed_var~0.offset_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1589~0.base_22|) 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff1_thd1~0_207 0) (= v_~y$w_buff0_used~0_1139 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_180|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_36|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_70|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_164|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_20|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_30|, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_63|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_268, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_80|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_68|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_74|, ULTIMATE.start_main_~#t1589~0.base=|v_ULTIMATE.start_main_~#t1589~0.base_22|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_393|, ~weak$$choice0~0=v_~weak$$choice0~0_149, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_227|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1590~0.base=|v_ULTIMATE.start_main_~#t1590~0.base_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_605, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~x~0=v_~x~0_194, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1139, ULTIMATE.start_main_~#t1590~0.offset=|v_ULTIMATE.start_main_~#t1590~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_26|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_61|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_44|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_30|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_48|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_24|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_151|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y~0=v_~y~0_435, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_58, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_164|, ULTIMATE.start_main_~#t1589~0.offset=|v_ULTIMATE.start_main_~#t1589~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_96|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_63|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_570, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_240|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_141|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_244, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_~#t1589~0.base, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1590~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1590~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ULTIMATE.start_main_~#t1589~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:21:44,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1590~0.base_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1590~0.base_10| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1590~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1590~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1590~0.base_10|) |v_ULTIMATE.start_main_~#t1590~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1590~0.base_10| 4) |v_#length_11|) (not (= |v_ULTIMATE.start_main_~#t1590~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1590~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1590~0.offset=|v_ULTIMATE.start_main_~#t1590~0.offset_9|, ULTIMATE.start_main_~#t1590~0.base=|v_ULTIMATE.start_main_~#t1590~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1590~0.offset, ULTIMATE.start_main_~#t1590~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-11-28 18:21:44,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_6|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_6|) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_208) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0_used~0_344 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$w_buff0~0_64 v_~y$w_buff1~0_60) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_344 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_208 256))))) 1 0)) (= 2 v_~y$w_buff0~0_63)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff0~0=v_~y$w_buff0~0_64, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:21:44,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1464778471 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1464778471| ~y~0_In-1464778471) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out-1464778471| ~y$mem_tmp~0_In-1464778471)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1464778471, ~y$flush_delayed~0=~y$flush_delayed~0_In-1464778471, ~y~0=~y~0_In-1464778471} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1464778471, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1464778471|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1464778471, ~y~0=~y~0_In-1464778471} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:21:44,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-929324418 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-929324418 |P1Thread1of1ForFork1_#t~ite54_Out-929324418|)) (and (= |P1Thread1of1ForFork1_#t~ite54_Out-929324418| ~y~0_In-929324418) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-929324418, ~y$flush_delayed~0=~y$flush_delayed~0_In-929324418, ~y~0=~y~0_In-929324418} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-929324418, ~y$flush_delayed~0=~y$flush_delayed~0_In-929324418, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-929324418|, ~y~0=~y~0_In-929324418} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-11-28 18:21:44,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1767852628 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1767852628 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1767852628| ~y$w_buff0_used~0_In1767852628)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1767852628| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1767852628, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1767852628} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1767852628|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1767852628, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1767852628} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:21:44,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In642013162 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In642013162 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In642013162 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In642013162 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out642013162| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out642013162| ~y$w_buff1_used~0_In642013162) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In642013162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In642013162, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In642013162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642013162} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out642013162|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In642013162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In642013162, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In642013162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642013162} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:21:44,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1782557371 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1782557371 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out1782557371 ~y$r_buff0_thd1~0_In1782557371))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out1782557371 0)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1782557371, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1782557371} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1782557371, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1782557371|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1782557371} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:21:44,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1654586917 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1654586917 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1654586917 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1654586917 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1654586917| ~y$r_buff1_thd1~0_In-1654586917) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1654586917| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1654586917, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1654586917, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1654586917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1654586917} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1654586917, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1654586917, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1654586917|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1654586917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1654586917} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:21:44,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L742-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_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:21:44,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In214938028 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In214938028 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite56_Out214938028| |P1Thread1of1ForFork1_#t~ite55_Out214938028|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In214938028 |P1Thread1of1ForFork1_#t~ite55_Out214938028|)) (and (or .cse0 .cse2) (= ~y~0_In214938028 |P1Thread1of1ForFork1_#t~ite55_Out214938028|) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In214938028, ~y$w_buff1~0=~y$w_buff1~0_In214938028, ~y~0=~y~0_In214938028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In214938028} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In214938028, ~y$w_buff1~0=~y$w_buff1~0_In214938028, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out214938028|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out214938028|, ~y~0=~y~0_In214938028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In214938028} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-11-28 18:21:44,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1804389558 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1804389558 256) 0))) (or (and (= ~y$w_buff0_used~0_In1804389558 |P1Thread1of1ForFork1_#t~ite57_Out1804389558|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite57_Out1804389558|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1804389558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1804389558} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1804389558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1804389558, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out1804389558|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-11-28 18:21:44,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1853705169 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1853705169 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1853705169 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1853705169 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite58_Out-1853705169| ~y$w_buff1_used~0_In-1853705169)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite58_Out-1853705169|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1853705169, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1853705169, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1853705169, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1853705169} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1853705169, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1853705169, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1853705169, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-1853705169|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1853705169} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-11-28 18:21:44,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1583210444 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1583210444 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite59_Out1583210444|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In1583210444 |P1Thread1of1ForFork1_#t~ite59_Out1583210444|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1583210444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1583210444} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1583210444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1583210444, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out1583210444|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-11-28 18:21:44,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1111793647 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1111793647 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1111793647 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1111793647 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1111793647 |P1Thread1of1ForFork1_#t~ite60_Out-1111793647|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite60_Out-1111793647|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1111793647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111793647, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1111793647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1111793647} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1111793647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111793647, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-1111793647|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1111793647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1111793647} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-11-28 18:21:44,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1271] [1271] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite60_38|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:21:44,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_104 256)) (= 0 (mod v_~y$w_buff0_used~0_277 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:21:44,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1284463884 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1284463884 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1284463884| ~y~0_In1284463884) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out1284463884| ~y$w_buff1~0_In1284463884) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1284463884, ~y~0=~y~0_In1284463884, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1284463884, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1284463884} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1284463884|, ~y$w_buff1~0=~y$w_buff1~0_In1284463884, ~y~0=~y~0_In1284463884, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1284463884, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1284463884} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-11-28 18:21:44,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_95 |v_ULTIMATE.start_main_#t~ite63_11|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~y~0=v_~y~0_95, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-11-28 18:21:44,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-144413270 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-144413270 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-144413270 |ULTIMATE.start_main_#t~ite65_Out-144413270|)) (and (= 0 |ULTIMATE.start_main_#t~ite65_Out-144413270|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-144413270, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-144413270} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-144413270, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-144413270, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-144413270|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-11-28 18:21:44,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-460201546 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-460201546 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-460201546 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-460201546 256)))) (or (and (= ~y$w_buff1_used~0_In-460201546 |ULTIMATE.start_main_#t~ite66_Out-460201546|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite66_Out-460201546|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-460201546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460201546, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460201546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460201546} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-460201546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460201546, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-460201546|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460201546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460201546} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-11-28 18:21:44,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In91950535 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In91950535 256)))) (or (and (= ~y$r_buff0_thd0~0_In91950535 |ULTIMATE.start_main_#t~ite67_Out91950535|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite67_Out91950535|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In91950535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In91950535} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In91950535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In91950535, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out91950535|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-11-28 18:21:44,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In862068172 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In862068172 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In862068172 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In862068172 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite68_Out862068172|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In862068172 |ULTIMATE.start_main_#t~ite68_Out862068172|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In862068172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In862068172, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In862068172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In862068172} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In862068172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In862068172, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out862068172|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In862068172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In862068172} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-11-28 18:21:44,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-86515109 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite91_Out-86515109| ~y$mem_tmp~0_In-86515109)) (and .cse0 (= |ULTIMATE.start_main_#t~ite91_Out-86515109| ~y~0_In-86515109)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-86515109, ~y$flush_delayed~0=~y$flush_delayed~0_In-86515109, ~y~0=~y~0_In-86515109} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-86515109, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out-86515109|, ~y$flush_delayed~0=~y$flush_delayed~0_In-86515109, ~y~0=~y~0_In-86515109} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-11-28 18:21:44,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_37 256)) (= v_~y~0_283 |v_ULTIMATE.start_main_#t~ite91_30|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y$flush_delayed~0_174 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~y~0=v_~y~0_283, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:21:45,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:21:45 BasicIcfg [2019-11-28 18:21:45,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:21:45,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:21:45,010 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:21:45,010 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:21:45,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:18" (3/4) ... [2019-11-28 18:21:45,013 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:21:45,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1301] [1301] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1589~0.base_22|) (= v_~y$r_buff0_thd0~0_332 0) (= 0 v_~x~0_194) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1~0_277 0) (= v_~__unbuffered_p1_EBX~0_58 0) (= v_~y$flush_delayed~0_268 0) (= v_~main$tmp_guard0~0_27 0) (= v_~y$r_buff0_thd1~0_239 0) (= 0 v_~weak$$choice0~0_149) (= v_~y$w_buff1_used~0_756 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_88) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1589~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1589~0.base_22|) |v_ULTIMATE.start_main_~#t1589~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff1_thd2~0_570) (= v_~y$r_buff1_thd0~0_410 0) (= 0 v_~y$r_buff0_thd2~0_605) (= 0 v_~__unbuffered_cnt~0_64) (= v_~weak$$choice2~0_244 0) (= 0 v_~y$w_buff0~0_330) (= (store .cse0 |v_ULTIMATE.start_main_~#t1589~0.base_22| 1) |v_#valid_52|) (= 0 |v_#NULL.base_7|) (= v_~y~0_435 0) (= v_~main$tmp_guard1~0_84 0) (= 0 |v_ULTIMATE.start_main_~#t1589~0.offset_16|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1589~0.base_22| 4)) (= 0 v_~y$read_delayed_var~0.offset_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1589~0.base_22|) 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff1_thd1~0_207 0) (= v_~y$w_buff0_used~0_1139 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_180|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_36|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_70|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_164|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_20|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_30|, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_63|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_268, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_80|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_68|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_74|, ULTIMATE.start_main_~#t1589~0.base=|v_ULTIMATE.start_main_~#t1589~0.base_22|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_393|, ~weak$$choice0~0=v_~weak$$choice0~0_149, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_227|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1590~0.base=|v_ULTIMATE.start_main_~#t1590~0.base_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_605, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~x~0=v_~x~0_194, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1139, ULTIMATE.start_main_~#t1590~0.offset=|v_ULTIMATE.start_main_~#t1590~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_26|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_61|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_44|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_30|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_48|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_24|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_151|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y~0=v_~y~0_435, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_58, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_164|, ULTIMATE.start_main_~#t1589~0.offset=|v_ULTIMATE.start_main_~#t1589~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_96|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_63|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_570, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_240|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_141|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_244, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_~#t1589~0.base, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1590~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1590~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ULTIMATE.start_main_~#t1589~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:21:45,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1590~0.base_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1590~0.base_10| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1590~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1590~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1590~0.base_10|) |v_ULTIMATE.start_main_~#t1590~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1590~0.base_10| 4) |v_#length_11|) (not (= |v_ULTIMATE.start_main_~#t1590~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1590~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1590~0.offset=|v_ULTIMATE.start_main_~#t1590~0.offset_9|, ULTIMATE.start_main_~#t1590~0.base=|v_ULTIMATE.start_main_~#t1590~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1590~0.offset, ULTIMATE.start_main_~#t1590~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-11-28 18:21:45,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_6|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_6|) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_208) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0_used~0_344 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$w_buff0~0_64 v_~y$w_buff1~0_60) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_344 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_208 256))))) 1 0)) (= 2 v_~y$w_buff0~0_63)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff0~0=v_~y$w_buff0~0_64, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:21:45,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1464778471 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1464778471| ~y~0_In-1464778471) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out-1464778471| ~y$mem_tmp~0_In-1464778471)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1464778471, ~y$flush_delayed~0=~y$flush_delayed~0_In-1464778471, ~y~0=~y~0_In-1464778471} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1464778471, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1464778471|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1464778471, ~y~0=~y~0_In-1464778471} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:21:45,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-929324418 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-929324418 |P1Thread1of1ForFork1_#t~ite54_Out-929324418|)) (and (= |P1Thread1of1ForFork1_#t~ite54_Out-929324418| ~y~0_In-929324418) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-929324418, ~y$flush_delayed~0=~y$flush_delayed~0_In-929324418, ~y~0=~y~0_In-929324418} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-929324418, ~y$flush_delayed~0=~y$flush_delayed~0_In-929324418, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-929324418|, ~y~0=~y~0_In-929324418} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-11-28 18:21:45,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1767852628 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1767852628 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1767852628| ~y$w_buff0_used~0_In1767852628)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1767852628| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1767852628, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1767852628} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1767852628|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1767852628, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1767852628} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:21:45,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In642013162 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In642013162 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In642013162 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In642013162 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out642013162| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out642013162| ~y$w_buff1_used~0_In642013162) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In642013162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In642013162, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In642013162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642013162} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out642013162|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In642013162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In642013162, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In642013162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642013162} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:21:45,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1782557371 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1782557371 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out1782557371 ~y$r_buff0_thd1~0_In1782557371))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out1782557371 0)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1782557371, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1782557371} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1782557371, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1782557371|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1782557371} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:21:45,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1654586917 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1654586917 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1654586917 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1654586917 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1654586917| ~y$r_buff1_thd1~0_In-1654586917) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1654586917| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1654586917, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1654586917, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1654586917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1654586917} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1654586917, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1654586917, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1654586917|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1654586917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1654586917} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:21:45,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L742-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_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:21:45,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In214938028 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In214938028 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite56_Out214938028| |P1Thread1of1ForFork1_#t~ite55_Out214938028|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In214938028 |P1Thread1of1ForFork1_#t~ite55_Out214938028|)) (and (or .cse0 .cse2) (= ~y~0_In214938028 |P1Thread1of1ForFork1_#t~ite55_Out214938028|) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In214938028, ~y$w_buff1~0=~y$w_buff1~0_In214938028, ~y~0=~y~0_In214938028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In214938028} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In214938028, ~y$w_buff1~0=~y$w_buff1~0_In214938028, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out214938028|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out214938028|, ~y~0=~y~0_In214938028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In214938028} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-11-28 18:21:45,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1804389558 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1804389558 256) 0))) (or (and (= ~y$w_buff0_used~0_In1804389558 |P1Thread1of1ForFork1_#t~ite57_Out1804389558|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite57_Out1804389558|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1804389558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1804389558} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1804389558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1804389558, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out1804389558|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-11-28 18:21:45,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1853705169 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1853705169 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1853705169 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1853705169 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite58_Out-1853705169| ~y$w_buff1_used~0_In-1853705169)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite58_Out-1853705169|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1853705169, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1853705169, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1853705169, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1853705169} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1853705169, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1853705169, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1853705169, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-1853705169|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1853705169} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-11-28 18:21:45,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1583210444 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1583210444 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite59_Out1583210444|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In1583210444 |P1Thread1of1ForFork1_#t~ite59_Out1583210444|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1583210444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1583210444} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1583210444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1583210444, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out1583210444|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-11-28 18:21:45,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1111793647 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1111793647 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1111793647 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1111793647 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1111793647 |P1Thread1of1ForFork1_#t~ite60_Out-1111793647|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite60_Out-1111793647|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1111793647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111793647, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1111793647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1111793647} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1111793647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111793647, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-1111793647|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1111793647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1111793647} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-11-28 18:21:45,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1271] [1271] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite60_38|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:21:45,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_104 256)) (= 0 (mod v_~y$w_buff0_used~0_277 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:21:45,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1284463884 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1284463884 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1284463884| ~y~0_In1284463884) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out1284463884| ~y$w_buff1~0_In1284463884) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1284463884, ~y~0=~y~0_In1284463884, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1284463884, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1284463884} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1284463884|, ~y$w_buff1~0=~y$w_buff1~0_In1284463884, ~y~0=~y~0_In1284463884, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1284463884, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1284463884} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-11-28 18:21:45,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_95 |v_ULTIMATE.start_main_#t~ite63_11|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~y~0=v_~y~0_95, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-11-28 18:21:45,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-144413270 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-144413270 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-144413270 |ULTIMATE.start_main_#t~ite65_Out-144413270|)) (and (= 0 |ULTIMATE.start_main_#t~ite65_Out-144413270|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-144413270, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-144413270} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-144413270, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-144413270, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-144413270|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-11-28 18:21:45,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-460201546 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-460201546 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-460201546 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-460201546 256)))) (or (and (= ~y$w_buff1_used~0_In-460201546 |ULTIMATE.start_main_#t~ite66_Out-460201546|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite66_Out-460201546|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-460201546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460201546, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460201546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460201546} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-460201546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460201546, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-460201546|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460201546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460201546} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-11-28 18:21:45,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In91950535 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In91950535 256)))) (or (and (= ~y$r_buff0_thd0~0_In91950535 |ULTIMATE.start_main_#t~ite67_Out91950535|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite67_Out91950535|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In91950535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In91950535} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In91950535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In91950535, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out91950535|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-11-28 18:21:45,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In862068172 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In862068172 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In862068172 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In862068172 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite68_Out862068172|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In862068172 |ULTIMATE.start_main_#t~ite68_Out862068172|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In862068172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In862068172, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In862068172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In862068172} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In862068172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In862068172, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out862068172|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In862068172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In862068172} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-11-28 18:21:45,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-86515109 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite91_Out-86515109| ~y$mem_tmp~0_In-86515109)) (and .cse0 (= |ULTIMATE.start_main_#t~ite91_Out-86515109| ~y~0_In-86515109)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-86515109, ~y$flush_delayed~0=~y$flush_delayed~0_In-86515109, ~y~0=~y~0_In-86515109} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-86515109, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out-86515109|, ~y$flush_delayed~0=~y$flush_delayed~0_In-86515109, ~y~0=~y~0_In-86515109} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-11-28 18:21:45,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_37 256)) (= v_~y~0_283 |v_ULTIMATE.start_main_#t~ite91_30|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y$flush_delayed~0_174 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~y~0=v_~y~0_283, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:21:45,183 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:21:45,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:21:45,185 INFO L168 Benchmark]: Toolchain (without parser) took 28438.85 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -54.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-28 18:21:45,187 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:21:45,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:45,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:21:45,190 INFO L168 Benchmark]: Boogie Preprocessor took 49.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:45,190 INFO L168 Benchmark]: RCFGBuilder took 1195.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:45,190 INFO L168 Benchmark]: TraceAbstraction took 26188.71 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -27.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-28 18:21:45,191 INFO L168 Benchmark]: Witness Printer took 174.41 ms. Allocated memory is still 2.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:45,193 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 751.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1195.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26188.71 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -27.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 174.41 ms. Allocated memory is still 2.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.6s, 231 ProgramPointsBefore, 150 ProgramPointsAfterwards, 307 TransitionsBefore, 186 TransitionsAfterwards, 41414 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 69 ConcurrentYvCompositions, 43 ChoiceCompositions, 14826 VarBasedMoverChecksPositive, 421 VarBasedMoverChecksNegative, 121 SemBasedMoverChecksPositive, 422 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 238871 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=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=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5172 SDtfs, 4106 SDslu, 16950 SDs, 0 SdLazy, 4431 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55330occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 12981 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 908 NumberOfCodeBlocks, 908 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 805 ConstructedInterpolants, 0 QuantifiedInterpolants, 260609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...