/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:39:59,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:39:59,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:39:59,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:39:59,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:39:59,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:39:59,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:39:59,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:39:59,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:39:59,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:39:59,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:39:59,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:39:59,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:39:59,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:39:59,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:39:59,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:39:59,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:39:59,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:39:59,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:39:59,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:39:59,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:39:59,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:39:59,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:39:59,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:39:59,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:39:59,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:39:59,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:39:59,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:39:59,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:39:59,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:39:59,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:39:59,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:39:59,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:39:59,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:39:59,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:39:59,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:39:59,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:39:59,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:39:59,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:39:59,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:39:59,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:39:59,572 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:39:59,586 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:39:59,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:39:59,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:39:59,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:39:59,588 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:39:59,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:39:59,588 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:39:59,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:39:59,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:39:59,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:39:59,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:39:59,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:39:59,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:39:59,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:39:59,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:39:59,590 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:39:59,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:39:59,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:39:59,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:39:59,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:39:59,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:39:59,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:39:59,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:39:59,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:39:59,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:39:59,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:39:59,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:39:59,593 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:39:59,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:39:59,593 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:39:59,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:39:59,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:39:59,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:39:59,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:39:59,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:39:59,876 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:39:59,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.opt.i [2019-12-27 15:39:59,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b152610db/3499357945f14749a559a7efbcbf3da9/FLAG6bbd3bb72 [2019-12-27 15:40:00,505 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:40:00,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.opt.i [2019-12-27 15:40:00,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b152610db/3499357945f14749a559a7efbcbf3da9/FLAG6bbd3bb72 [2019-12-27 15:40:00,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b152610db/3499357945f14749a559a7efbcbf3da9 [2019-12-27 15:40:00,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:40:00,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:40:00,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:40:00,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:40:00,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:40:00,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:40:00" (1/1) ... [2019-12-27 15:40:00,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78428862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:00, skipping insertion in model container [2019-12-27 15:40:00,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:40:00" (1/1) ... [2019-12-27 15:40:00,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:40:00,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:40:01,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:40:01,396 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:40:01,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:40:01,562 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:40:01,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01 WrapperNode [2019-12-27 15:40:01,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:40:01,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:40:01,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:40:01,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:40:01,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01" (1/1) ... [2019-12-27 15:40:01,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01" (1/1) ... [2019-12-27 15:40:01,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:40:01,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:40:01,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:40:01,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:40:01,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01" (1/1) ... [2019-12-27 15:40:01,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01" (1/1) ... [2019-12-27 15:40:01,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01" (1/1) ... [2019-12-27 15:40:01,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01" (1/1) ... [2019-12-27 15:40:01,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01" (1/1) ... [2019-12-27 15:40:01,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01" (1/1) ... [2019-12-27 15:40:01,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01" (1/1) ... [2019-12-27 15:40:01,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:40:01,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:40:01,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:40:01,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:40:01,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01" (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-12-27 15:40:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:40:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:40:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:40:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:40:01,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:40:01,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:40:01,755 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:40:01,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:40:01,756 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:40:01,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:40:01,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:40:01,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:40:01,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:40:01,758 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:40:02,646 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:40:02,646 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:40:02,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:40:02 BoogieIcfgContainer [2019-12-27 15:40:02,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:40:02,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:40:02,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:40:02,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:40:02,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:40:00" (1/3) ... [2019-12-27 15:40:02,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae50cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:40:02, skipping insertion in model container [2019-12-27 15:40:02,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:01" (2/3) ... [2019-12-27 15:40:02,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae50cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:40:02, skipping insertion in model container [2019-12-27 15:40:02,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:40:02" (3/3) ... [2019-12-27 15:40:02,657 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_power.opt.i [2019-12-27 15:40:02,668 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:40:02,669 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:40:02,677 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:40:02,678 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:40:02,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,762 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,797 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,797 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,798 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,798 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,798 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,825 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,826 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,828 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,838 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:02,857 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:40:02,878 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:40:02,878 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:40:02,878 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:40:02,878 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:40:02,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:40:02,879 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:40:02,879 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:40:02,879 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:40:02,895 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-27 15:40:02,898 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-27 15:40:03,027 INFO L132 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-27 15:40:03,028 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:40:03,048 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 566 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 15:40:03,082 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-27 15:40:03,147 INFO L132 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-27 15:40:03,147 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:40:03,158 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 566 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 15:40:03,191 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 15:40:03,193 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:40:08,752 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-27 15:40:09,030 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 15:40:09,147 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 15:40:09,220 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128241 [2019-12-27 15:40:09,221 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 15:40:09,224 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 133 transitions [2019-12-27 15:40:13,387 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47186 states. [2019-12-27 15:40:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 47186 states. [2019-12-27 15:40:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 15:40:13,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:13,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:13,398 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:13,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash -137140126, now seen corresponding path program 1 times [2019-12-27 15:40:13,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:13,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526645431] [2019-12-27 15:40:13,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:13,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526645431] [2019-12-27 15:40:13,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:13,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:40:13,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1506940303] [2019-12-27 15:40:13,723 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:13,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:13,739 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 15:40:13,739 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:13,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:13,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:40:13,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:40:13,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:13,761 INFO L87 Difference]: Start difference. First operand 47186 states. Second operand 3 states. [2019-12-27 15:40:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:14,692 INFO L93 Difference]: Finished difference Result 46894 states and 192684 transitions. [2019-12-27 15:40:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:40:14,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 15:40:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:15,057 INFO L225 Difference]: With dead ends: 46894 [2019-12-27 15:40:15,058 INFO L226 Difference]: Without dead ends: 43674 [2019-12-27 15:40:15,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43674 states. [2019-12-27 15:40:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43674 to 43674. [2019-12-27 15:40:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43674 states. [2019-12-27 15:40:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43674 states to 43674 states and 179330 transitions. [2019-12-27 15:40:18,686 INFO L78 Accepts]: Start accepts. Automaton has 43674 states and 179330 transitions. Word has length 7 [2019-12-27 15:40:18,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:18,687 INFO L462 AbstractCegarLoop]: Abstraction has 43674 states and 179330 transitions. [2019-12-27 15:40:18,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:40:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 43674 states and 179330 transitions. [2019-12-27 15:40:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:40:18,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:18,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:18,695 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:18,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1070314357, now seen corresponding path program 1 times [2019-12-27 15:40:18,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:18,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44856196] [2019-12-27 15:40:18,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:18,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44856196] [2019-12-27 15:40:18,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:18,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:40:18,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [526811980] [2019-12-27 15:40:18,779 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:18,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:18,786 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:40:18,787 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:18,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:18,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:40:18,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:18,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:40:18,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:18,789 INFO L87 Difference]: Start difference. First operand 43674 states and 179330 transitions. Second operand 3 states. [2019-12-27 15:40:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:20,760 INFO L93 Difference]: Finished difference Result 24545 states and 88296 transitions. [2019-12-27 15:40:20,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:40:20,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:40:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:20,921 INFO L225 Difference]: With dead ends: 24545 [2019-12-27 15:40:20,921 INFO L226 Difference]: Without dead ends: 24545 [2019-12-27 15:40:20,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24545 states. [2019-12-27 15:40:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24545 to 24545. [2019-12-27 15:40:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24545 states. [2019-12-27 15:40:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24545 states to 24545 states and 88296 transitions. [2019-12-27 15:40:21,880 INFO L78 Accepts]: Start accepts. Automaton has 24545 states and 88296 transitions. Word has length 13 [2019-12-27 15:40:21,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:21,880 INFO L462 AbstractCegarLoop]: Abstraction has 24545 states and 88296 transitions. [2019-12-27 15:40:21,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:40:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 24545 states and 88296 transitions. [2019-12-27 15:40:21,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:40:21,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:21,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:21,883 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash -933049582, now seen corresponding path program 1 times [2019-12-27 15:40:21,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:21,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310767278] [2019-12-27 15:40:21,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:21,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310767278] [2019-12-27 15:40:21,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:21,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:40:21,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080458212] [2019-12-27 15:40:21,981 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:21,983 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:21,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 15:40:21,985 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:21,985 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:21,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:40:21,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:21,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:40:21,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:40:21,986 INFO L87 Difference]: Start difference. First operand 24545 states and 88296 transitions. Second operand 4 states. [2019-12-27 15:40:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:22,032 INFO L93 Difference]: Finished difference Result 4442 states and 13065 transitions. [2019-12-27 15:40:22,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:40:22,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 15:40:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:22,053 INFO L225 Difference]: With dead ends: 4442 [2019-12-27 15:40:22,053 INFO L226 Difference]: Without dead ends: 4442 [2019-12-27 15:40:22,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:40:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2019-12-27 15:40:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4442. [2019-12-27 15:40:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4442 states. [2019-12-27 15:40:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 13065 transitions. [2019-12-27 15:40:22,145 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 13065 transitions. Word has length 14 [2019-12-27 15:40:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:22,145 INFO L462 AbstractCegarLoop]: Abstraction has 4442 states and 13065 transitions. [2019-12-27 15:40:22,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:40:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 13065 transitions. [2019-12-27 15:40:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:40:22,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:22,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:22,147 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:22,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:22,147 INFO L82 PathProgramCache]: Analyzing trace with hash 484016506, now seen corresponding path program 1 times [2019-12-27 15:40:22,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:22,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978515688] [2019-12-27 15:40:22,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:22,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978515688] [2019-12-27 15:40:22,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:22,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:40:22,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [839883392] [2019-12-27 15:40:22,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:22,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:22,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 15:40:22,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:22,300 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:40:22,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:40:22,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:22,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:40:22,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:40:22,301 INFO L87 Difference]: Start difference. First operand 4442 states and 13065 transitions. Second operand 5 states. [2019-12-27 15:40:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:22,689 INFO L93 Difference]: Finished difference Result 6211 states and 17740 transitions. [2019-12-27 15:40:22,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:40:22,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 15:40:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:22,710 INFO L225 Difference]: With dead ends: 6211 [2019-12-27 15:40:22,710 INFO L226 Difference]: Without dead ends: 6211 [2019-12-27 15:40:22,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:40:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6211 states. [2019-12-27 15:40:22,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6211 to 6115. [2019-12-27 15:40:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6115 states. [2019-12-27 15:40:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 17563 transitions. [2019-12-27 15:40:22,871 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 17563 transitions. Word has length 16 [2019-12-27 15:40:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:22,872 INFO L462 AbstractCegarLoop]: Abstraction has 6115 states and 17563 transitions. [2019-12-27 15:40:22,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:40:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 17563 transitions. [2019-12-27 15:40:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:40:22,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:22,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:22,874 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2119638279, now seen corresponding path program 1 times [2019-12-27 15:40:22,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:22,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58965873] [2019-12-27 15:40:22,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:22,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58965873] [2019-12-27 15:40:22,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:22,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:40:22,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1060868565] [2019-12-27 15:40:22,941 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:22,944 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:22,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 57 transitions. [2019-12-27 15:40:22,949 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:22,963 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:40:22,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:40:22,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:22,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:40:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:40:22,964 INFO L87 Difference]: Start difference. First operand 6115 states and 17563 transitions. Second operand 4 states. [2019-12-27 15:40:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:23,204 INFO L93 Difference]: Finished difference Result 10427 states and 28313 transitions. [2019-12-27 15:40:23,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:40:23,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 15:40:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:23,225 INFO L225 Difference]: With dead ends: 10427 [2019-12-27 15:40:23,226 INFO L226 Difference]: Without dead ends: 10427 [2019-12-27 15:40:23,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:40:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10427 states. [2019-12-27 15:40:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10427 to 9508. [2019-12-27 15:40:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9508 states. [2019-12-27 15:40:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9508 states to 9508 states and 26249 transitions. [2019-12-27 15:40:23,455 INFO L78 Accepts]: Start accepts. Automaton has 9508 states and 26249 transitions. Word has length 17 [2019-12-27 15:40:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:23,455 INFO L462 AbstractCegarLoop]: Abstraction has 9508 states and 26249 transitions. [2019-12-27 15:40:23,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:40:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 9508 states and 26249 transitions. [2019-12-27 15:40:23,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 15:40:23,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:23,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:23,459 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:23,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:23,459 INFO L82 PathProgramCache]: Analyzing trace with hash -249657895, now seen corresponding path program 1 times [2019-12-27 15:40:23,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:23,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717669050] [2019-12-27 15:40:23,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:23,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717669050] [2019-12-27 15:40:23,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:23,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:40:23,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [712557960] [2019-12-27 15:40:23,514 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:23,516 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:23,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 67 transitions. [2019-12-27 15:40:23,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:23,541 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:40:23,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:40:23,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:23,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:40:23,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:40:23,542 INFO L87 Difference]: Start difference. First operand 9508 states and 26249 transitions. Second operand 5 states. [2019-12-27 15:40:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:23,887 INFO L93 Difference]: Finished difference Result 11972 states and 32474 transitions. [2019-12-27 15:40:23,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:40:23,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 15:40:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:23,909 INFO L225 Difference]: With dead ends: 11972 [2019-12-27 15:40:23,909 INFO L226 Difference]: Without dead ends: 11972 [2019-12-27 15:40:23,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:40:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11972 states. [2019-12-27 15:40:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11972 to 9557. [2019-12-27 15:40:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9557 states. [2019-12-27 15:40:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9557 states to 9557 states and 26379 transitions. [2019-12-27 15:40:24,117 INFO L78 Accepts]: Start accepts. Automaton has 9557 states and 26379 transitions. Word has length 19 [2019-12-27 15:40:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:24,117 INFO L462 AbstractCegarLoop]: Abstraction has 9557 states and 26379 transitions. [2019-12-27 15:40:24,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:40:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 9557 states and 26379 transitions. [2019-12-27 15:40:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 15:40:24,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:24,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:24,131 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:24,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:24,132 INFO L82 PathProgramCache]: Analyzing trace with hash -798739535, now seen corresponding path program 1 times [2019-12-27 15:40:24,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:24,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182080991] [2019-12-27 15:40:24,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:24,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182080991] [2019-12-27 15:40:24,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:24,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:40:24,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [349827502] [2019-12-27 15:40:24,188 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:24,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:24,225 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 235 transitions. [2019-12-27 15:40:24,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:24,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:40:24,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:40:24,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:24,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:40:24,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:40:24,258 INFO L87 Difference]: Start difference. First operand 9557 states and 26379 transitions. Second operand 6 states. [2019-12-27 15:40:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:24,322 INFO L93 Difference]: Finished difference Result 7539 states and 21591 transitions. [2019-12-27 15:40:24,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:40:24,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 15:40:24,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:24,337 INFO L225 Difference]: With dead ends: 7539 [2019-12-27 15:40:24,338 INFO L226 Difference]: Without dead ends: 7539 [2019-12-27 15:40:24,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:40:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-27 15:40:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 7181. [2019-12-27 15:40:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7181 states. [2019-12-27 15:40:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7181 states to 7181 states and 20738 transitions. [2019-12-27 15:40:24,599 INFO L78 Accepts]: Start accepts. Automaton has 7181 states and 20738 transitions. Word has length 31 [2019-12-27 15:40:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:24,600 INFO L462 AbstractCegarLoop]: Abstraction has 7181 states and 20738 transitions. [2019-12-27 15:40:24,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:40:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7181 states and 20738 transitions. [2019-12-27 15:40:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 15:40:24,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:24,622 INFO L411 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] [2019-12-27 15:40:24,622 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:24,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:24,623 INFO L82 PathProgramCache]: Analyzing trace with hash 29406577, now seen corresponding path program 1 times [2019-12-27 15:40:24,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:24,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928281514] [2019-12-27 15:40:24,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:24,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928281514] [2019-12-27 15:40:24,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:24,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:40:24,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1633586548] [2019-12-27 15:40:24,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:24,757 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:24,851 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 164 transitions. [2019-12-27 15:40:24,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:24,852 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:24,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:40:24,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:24,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:40:24,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:40:24,853 INFO L87 Difference]: Start difference. First operand 7181 states and 20738 transitions. Second operand 6 states. [2019-12-27 15:40:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:25,193 INFO L93 Difference]: Finished difference Result 16245 states and 46934 transitions. [2019-12-27 15:40:25,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:40:25,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-27 15:40:25,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:25,216 INFO L225 Difference]: With dead ends: 16245 [2019-12-27 15:40:25,216 INFO L226 Difference]: Without dead ends: 12749 [2019-12-27 15:40:25,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:40:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12749 states. [2019-12-27 15:40:25,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12749 to 11407. [2019-12-27 15:40:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11407 states. [2019-12-27 15:40:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11407 states to 11407 states and 33239 transitions. [2019-12-27 15:40:25,413 INFO L78 Accepts]: Start accepts. Automaton has 11407 states and 33239 transitions. Word has length 61 [2019-12-27 15:40:25,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:25,414 INFO L462 AbstractCegarLoop]: Abstraction has 11407 states and 33239 transitions. [2019-12-27 15:40:25,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:40:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 11407 states and 33239 transitions. [2019-12-27 15:40:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 15:40:25,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:25,440 INFO L411 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] [2019-12-27 15:40:25,440 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:25,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1009585525, now seen corresponding path program 2 times [2019-12-27 15:40:25,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:25,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63074429] [2019-12-27 15:40:25,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:25,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63074429] [2019-12-27 15:40:25,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:25,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:40:25,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [629097134] [2019-12-27 15:40:25,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:25,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:25,764 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 172 transitions. [2019-12-27 15:40:25,764 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:25,765 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:25,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:40:25,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:25,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:40:25,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:40:25,766 INFO L87 Difference]: Start difference. First operand 11407 states and 33239 transitions. Second operand 4 states. [2019-12-27 15:40:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:25,834 INFO L93 Difference]: Finished difference Result 12393 states and 35429 transitions. [2019-12-27 15:40:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:40:25,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-27 15:40:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:25,845 INFO L225 Difference]: With dead ends: 12393 [2019-12-27 15:40:25,846 INFO L226 Difference]: Without dead ends: 6685 [2019-12-27 15:40:25,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:40:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6685 states. [2019-12-27 15:40:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6685 to 6685. [2019-12-27 15:40:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6685 states. [2019-12-27 15:40:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6685 states to 6685 states and 16930 transitions. [2019-12-27 15:40:25,938 INFO L78 Accepts]: Start accepts. Automaton has 6685 states and 16930 transitions. Word has length 61 [2019-12-27 15:40:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:25,938 INFO L462 AbstractCegarLoop]: Abstraction has 6685 states and 16930 transitions. [2019-12-27 15:40:25,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:40:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 6685 states and 16930 transitions. [2019-12-27 15:40:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 15:40:25,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:25,948 INFO L411 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] [2019-12-27 15:40:25,948 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:25,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1993425715, now seen corresponding path program 3 times [2019-12-27 15:40:25,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:25,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57800965] [2019-12-27 15:40:25,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:26,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57800965] [2019-12-27 15:40:26,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:26,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:40:26,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [239602124] [2019-12-27 15:40:26,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:26,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:26,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 124 transitions. [2019-12-27 15:40:26,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:26,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:26,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:40:26,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:26,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:40:26,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:26,125 INFO L87 Difference]: Start difference. First operand 6685 states and 16930 transitions. Second operand 3 states. [2019-12-27 15:40:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:26,152 INFO L93 Difference]: Finished difference Result 7176 states and 18046 transitions. [2019-12-27 15:40:26,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:40:26,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-27 15:40:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:26,153 INFO L225 Difference]: With dead ends: 7176 [2019-12-27 15:40:26,153 INFO L226 Difference]: Without dead ends: 563 [2019-12-27 15:40:26,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-12-27 15:40:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-12-27 15:40:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-12-27 15:40:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1224 transitions. [2019-12-27 15:40:26,159 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1224 transitions. Word has length 61 [2019-12-27 15:40:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:26,160 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 1224 transitions. [2019-12-27 15:40:26,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:40:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1224 transitions. [2019-12-27 15:40:26,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 15:40:26,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:26,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:26,161 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2073942420, now seen corresponding path program 1 times [2019-12-27 15:40:26,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:26,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964680028] [2019-12-27 15:40:26,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:26,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964680028] [2019-12-27 15:40:26,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:26,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:40:26,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2052254725] [2019-12-27 15:40:26,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:26,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:26,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 165 transitions. [2019-12-27 15:40:26,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:26,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 15:40:26,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:40:26,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:26,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:40:26,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:40:26,613 INFO L87 Difference]: Start difference. First operand 563 states and 1224 transitions. Second operand 11 states. [2019-12-27 15:40:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:28,661 INFO L93 Difference]: Finished difference Result 2980 states and 6435 transitions. [2019-12-27 15:40:28,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 15:40:28,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-12-27 15:40:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:28,665 INFO L225 Difference]: With dead ends: 2980 [2019-12-27 15:40:28,665 INFO L226 Difference]: Without dead ends: 2076 [2019-12-27 15:40:28,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 15:40:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2019-12-27 15:40:28,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 857. [2019-12-27 15:40:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-12-27 15:40:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1810 transitions. [2019-12-27 15:40:28,678 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1810 transitions. Word has length 62 [2019-12-27 15:40:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:28,678 INFO L462 AbstractCegarLoop]: Abstraction has 857 states and 1810 transitions. [2019-12-27 15:40:28,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:40:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1810 transitions. [2019-12-27 15:40:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 15:40:28,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:28,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:28,680 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:28,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash 960866040, now seen corresponding path program 2 times [2019-12-27 15:40:28,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:28,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120334307] [2019-12-27 15:40:28,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:28,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120334307] [2019-12-27 15:40:28,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:28,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:40:28,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [213953391] [2019-12-27 15:40:28,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:28,908 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:29,174 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 283 transitions. [2019-12-27 15:40:29,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:29,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 15:40:29,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 15:40:29,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:29,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 15:40:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:40:29,383 INFO L87 Difference]: Start difference. First operand 857 states and 1810 transitions. Second operand 16 states. [2019-12-27 15:40:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:31,340 INFO L93 Difference]: Finished difference Result 1763 states and 3486 transitions. [2019-12-27 15:40:31,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 15:40:31,341 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2019-12-27 15:40:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:31,343 INFO L225 Difference]: With dead ends: 1763 [2019-12-27 15:40:31,344 INFO L226 Difference]: Without dead ends: 1763 [2019-12-27 15:40:31,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2019-12-27 15:40:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-27 15:40:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 940. [2019-12-27 15:40:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-12-27 15:40:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1863 transitions. [2019-12-27 15:40:31,357 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1863 transitions. Word has length 62 [2019-12-27 15:40:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:31,357 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1863 transitions. [2019-12-27 15:40:31,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 15:40:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1863 transitions. [2019-12-27 15:40:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 15:40:31,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:31,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:31,358 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:31,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:31,359 INFO L82 PathProgramCache]: Analyzing trace with hash -187536922, now seen corresponding path program 3 times [2019-12-27 15:40:31,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:31,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000919467] [2019-12-27 15:40:31,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:31,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000919467] [2019-12-27 15:40:31,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:31,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:40:31,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [43018030] [2019-12-27 15:40:31,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:31,479 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:31,625 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 115 states and 140 transitions. [2019-12-27 15:40:31,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:31,656 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:40:31,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:40:31,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:31,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:40:31,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:40:31,657 INFO L87 Difference]: Start difference. First operand 940 states and 1863 transitions. Second operand 10 states. [2019-12-27 15:40:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:32,203 INFO L93 Difference]: Finished difference Result 1881 states and 3650 transitions. [2019-12-27 15:40:32,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:40:32,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-27 15:40:32,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:32,206 INFO L225 Difference]: With dead ends: 1881 [2019-12-27 15:40:32,206 INFO L226 Difference]: Without dead ends: 1711 [2019-12-27 15:40:32,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:40:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-12-27 15:40:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 930. [2019-12-27 15:40:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-12-27 15:40:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1843 transitions. [2019-12-27 15:40:32,218 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1843 transitions. Word has length 62 [2019-12-27 15:40:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:32,218 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1843 transitions. [2019-12-27 15:40:32,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:40:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1843 transitions. [2019-12-27 15:40:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 15:40:32,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:32,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:32,220 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1980493894, now seen corresponding path program 4 times [2019-12-27 15:40:32,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:32,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36736485] [2019-12-27 15:40:32,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:32,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36736485] [2019-12-27 15:40:32,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:32,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:40:32,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1839065769] [2019-12-27 15:40:32,309 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:32,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:32,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 277 transitions. [2019-12-27 15:40:32,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:32,570 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:40:32,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:40:32,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:32,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:40:32,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:40:32,571 INFO L87 Difference]: Start difference. First operand 930 states and 1843 transitions. Second operand 7 states. [2019-12-27 15:40:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:33,236 INFO L93 Difference]: Finished difference Result 1732 states and 3446 transitions. [2019-12-27 15:40:33,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:40:33,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-27 15:40:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:33,238 INFO L225 Difference]: With dead ends: 1732 [2019-12-27 15:40:33,238 INFO L226 Difference]: Without dead ends: 1732 [2019-12-27 15:40:33,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:40:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2019-12-27 15:40:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1046. [2019-12-27 15:40:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-12-27 15:40:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 2105 transitions. [2019-12-27 15:40:33,251 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 2105 transitions. Word has length 62 [2019-12-27 15:40:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:33,251 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 2105 transitions. [2019-12-27 15:40:33,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:40:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 2105 transitions. [2019-12-27 15:40:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 15:40:33,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:33,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:33,253 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:33,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:33,253 INFO L82 PathProgramCache]: Analyzing trace with hash -10651334, now seen corresponding path program 5 times [2019-12-27 15:40:33,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:33,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516144547] [2019-12-27 15:40:33,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:33,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516144547] [2019-12-27 15:40:33,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:33,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:40:33,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1325817656] [2019-12-27 15:40:33,327 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:33,345 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:33,531 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 157 transitions. [2019-12-27 15:40:33,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:33,532 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:33,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:40:33,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:33,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:40:33,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:33,533 INFO L87 Difference]: Start difference. First operand 1046 states and 2105 transitions. Second operand 3 states. [2019-12-27 15:40:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:33,546 INFO L93 Difference]: Finished difference Result 1046 states and 2104 transitions. [2019-12-27 15:40:33,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:40:33,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-27 15:40:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:33,548 INFO L225 Difference]: With dead ends: 1046 [2019-12-27 15:40:33,548 INFO L226 Difference]: Without dead ends: 1046 [2019-12-27 15:40:33,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-12-27 15:40:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 903. [2019-12-27 15:40:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-12-27 15:40:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1841 transitions. [2019-12-27 15:40:33,559 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1841 transitions. Word has length 62 [2019-12-27 15:40:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:33,559 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1841 transitions. [2019-12-27 15:40:33,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:40:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1841 transitions. [2019-12-27 15:40:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 15:40:33,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:33,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:33,561 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:33,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash 279364820, now seen corresponding path program 1 times [2019-12-27 15:40:33,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:33,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140450801] [2019-12-27 15:40:33,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:40:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:40:33,680 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:40:33,680 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:40:33,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t156~0.base_25|)) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= v_~y$w_buff0_used~0_960 0) (= |v_ULTIMATE.start_main_~#t156~0.offset_18| 0) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t156~0.base_25| 1) |v_#valid_62|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t156~0.base_25| 4) |v_#length_23|) (= v_~y~0_332 0) (= v_~main$tmp_guard0~0_26 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t156~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t156~0.base_25|) |v_ULTIMATE.start_main_~#t156~0.offset_18| 0))) (= 0 v_~y$w_buff0~0_491) (= v_~weak$$choice2~0_259 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t156~0.base_25|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t157~0.offset=|v_ULTIMATE.start_main_~#t157~0.offset_19|, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ULTIMATE.start_main_~#t156~0.offset=|v_ULTIMATE.start_main_~#t156~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ULTIMATE.start_main_~#t158~0.base=|v_ULTIMATE.start_main_~#t158~0.base_22|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t158~0.offset=|v_ULTIMATE.start_main_~#t158~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ~y~0=v_~y~0_332, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t156~0.base=|v_ULTIMATE.start_main_~#t156~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_~#t157~0.base=|v_ULTIMATE.start_main_~#t157~0.base_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ULTIMATE.start_main_~#t157~0.offset, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t156~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t158~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t158~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t156~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t157~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 15:40:33,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t157~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t157~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t157~0.base_13|) |v_ULTIMATE.start_main_~#t157~0.offset_11| 1)) |v_#memory_int_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t157~0.base_13| 1) |v_#valid_34|) (= |v_ULTIMATE.start_main_~#t157~0.offset_11| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t157~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t157~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t157~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t157~0.offset=|v_ULTIMATE.start_main_~#t157~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t157~0.base=|v_ULTIMATE.start_main_~#t157~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t157~0.offset, ULTIMATE.start_main_~#t157~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 15:40:33,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t158~0.base_12| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t158~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t158~0.base_12|) |v_ULTIMATE.start_main_~#t158~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t158~0.base_12|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t158~0.base_12| 1) |v_#valid_32|) (= |v_ULTIMATE.start_main_~#t158~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t158~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t158~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t158~0.base=|v_ULTIMATE.start_main_~#t158~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t158~0.offset=|v_ULTIMATE.start_main_~#t158~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t158~0.base, ULTIMATE.start_main_~#t158~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-27 15:40:33,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet27_34| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_46)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= |v_P2Thread1of1ForFork0_#t~nondet26_34| v_~weak$$choice0~0_28) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_34|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_34|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_46} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_33|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_33|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_46, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-27 15:40:33,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2052604881 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2052604881 256)))) (or (and (= ~y$w_buff1~0_In-2052604881 |P2Thread1of1ForFork0_#t~ite28_Out-2052604881|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-2052604881| ~y$w_buff0~0_In-2052604881) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2052604881, ~y$w_buff1~0=~y$w_buff1~0_In-2052604881, ~y$w_buff0~0=~y$w_buff0~0_In-2052604881, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2052604881} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-2052604881|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2052604881, ~y$w_buff1~0=~y$w_buff1~0_In-2052604881, ~y$w_buff0~0=~y$w_buff0~0_In-2052604881, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2052604881} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 15:40:33,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_12|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_12|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_11|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-27 15:40:33,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_11|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_8|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 15:40:33,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1070489487 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out1070489487| ~y$mem_tmp~0_In1070489487)) (and (= ~y~0_In1070489487 |P2Thread1of1ForFork0_#t~ite48_Out1070489487|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1070489487, ~y$flush_delayed~0=~y$flush_delayed~0_In1070489487, ~y~0=~y~0_In1070489487} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1070489487|, ~y$mem_tmp~0=~y$mem_tmp~0_In1070489487, ~y$flush_delayed~0=~y$flush_delayed~0_In1070489487, ~y~0=~y~0_In1070489487} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 15:40:33,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.base_9 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~x~0_40 1) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_9|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 15:40:33,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-2115188501 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-2115188501| ~y$mem_tmp~0_In-2115188501) (not .cse0)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out-2115188501| ~y~0_In-2115188501) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2115188501, ~y$flush_delayed~0=~y$flush_delayed~0_In-2115188501, ~y~0=~y~0_In-2115188501} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2115188501, ~y$flush_delayed~0=~y$flush_delayed~0_In-2115188501, ~y~0=~y~0_In-2115188501, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-2115188501|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 15:40:33,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_68|) (= v_~y$flush_delayed~0_118 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_68|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_67|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 15:40:33,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1088274121 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1088274121 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out1088274121| 0)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out1088274121| ~y$w_buff0_used~0_In1088274121) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1088274121, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1088274121} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1088274121, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1088274121, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1088274121|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 15:40:33,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1454000107 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1454000107 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1454000107 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1454000107 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1454000107| ~y$w_buff1_used~0_In-1454000107) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-1454000107|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1454000107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1454000107, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1454000107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1454000107} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1454000107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1454000107, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1454000107, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1454000107|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1454000107} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 15:40:33,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1075932713 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1075932713 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out1075932713 ~y$r_buff0_thd3~0_In1075932713)) (and (not .cse0) (= ~y$r_buff0_thd3~0_Out1075932713 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1075932713, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1075932713} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1075932713, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1075932713, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1075932713|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 15:40:33,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1154723041 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1154723041 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1154723041 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1154723041 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-1154723041 |P2Thread1of1ForFork0_#t~ite54_Out-1154723041|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1154723041|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1154723041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154723041, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1154723041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1154723041} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1154723041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154723041, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1154723041|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1154723041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1154723041} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 15:40:33,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_36|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 15:40:33,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 15:40:33,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2090201687 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-2090201687 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-2090201687| |ULTIMATE.start_main_#t~ite58_Out-2090201687|))) (or (and .cse0 (not .cse1) (= ~y$w_buff1~0_In-2090201687 |ULTIMATE.start_main_#t~ite58_Out-2090201687|) (not .cse2)) (and (or .cse2 .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite58_Out-2090201687| ~y~0_In-2090201687)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2090201687, ~y~0=~y~0_In-2090201687, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2090201687, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2090201687} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2090201687, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-2090201687|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2090201687|, ~y~0=~y~0_In-2090201687, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2090201687, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2090201687} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 15:40:33,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In177521274 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In177521274 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out177521274| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In177521274 |ULTIMATE.start_main_#t~ite60_Out177521274|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In177521274, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In177521274} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out177521274|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In177521274, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In177521274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 15:40:33,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-415861533 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-415861533 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-415861533 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-415861533 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-415861533| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out-415861533| ~y$w_buff1_used~0_In-415861533) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-415861533, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-415861533, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-415861533, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-415861533} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-415861533|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-415861533, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-415861533, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-415861533, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-415861533} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 15:40:33,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2005529568 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2005529568 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In2005529568 |ULTIMATE.start_main_#t~ite62_Out2005529568|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out2005529568|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2005529568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2005529568} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2005529568|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2005529568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2005529568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 15:40:33,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-366284155 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-366284155 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-366284155 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-366284155 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-366284155| ~y$r_buff1_thd0~0_In-366284155) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-366284155|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-366284155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-366284155, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-366284155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-366284155} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-366284155|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-366284155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-366284155, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-366284155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-366284155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 15:40:33,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~main$tmp_guard1~0_25 0) (= v_~__unbuffered_p1_EBX~0_35 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:40:33,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:40:33 BasicIcfg [2019-12-27 15:40:33,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:40:33,856 INFO L168 Benchmark]: Toolchain (without parser) took 33055.34 ms. Allocated memory was 138.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 102.1 MB in the beginning and 714.1 MB in the end (delta: -612.0 MB). Peak memory consumption was 519.9 MB. Max. memory is 7.1 GB. [2019-12-27 15:40:33,857 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 15:40:33,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.67 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 156.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 15:40:33,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.83 ms. Allocated memory is still 203.9 MB. Free memory was 156.5 MB in the beginning and 153.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 15:40:33,859 INFO L168 Benchmark]: Boogie Preprocessor took 46.09 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:40:33,860 INFO L168 Benchmark]: RCFGBuilder took 969.52 ms. Allocated memory is still 203.9 MB. Free memory was 150.6 MB in the beginning and 95.6 MB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:40:33,861 INFO L168 Benchmark]: TraceAbstraction took 31205.64 ms. Allocated memory was 203.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 95.6 MB in the beginning and 714.1 MB in the end (delta: -618.5 MB). Peak memory consumption was 448.5 MB. Max. memory is 7.1 GB. [2019-12-27 15:40:33,864 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.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.67 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 156.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.83 ms. Allocated memory is still 203.9 MB. Free memory was 156.5 MB in the beginning and 153.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.09 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 969.52 ms. Allocated memory is still 203.9 MB. Free memory was 150.6 MB in the beginning and 95.6 MB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31205.64 ms. Allocated memory was 203.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 95.6 MB in the beginning and 714.1 MB in the end (delta: -618.5 MB). Peak memory consumption was 448.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 195 ProgramPointsBefore, 110 ProgramPointsAfterwards, 241 TransitionsBefore, 133 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 27 ChoiceCompositions, 9977 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 79 SemBasedMoverChecksPositive, 323 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 128241 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L795] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L797] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L798] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y = y$flush_delayed ? y$mem_tmp : y [L804] 3 y$flush_delayed = (_Bool)0 [L807] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 2 [L751] 2 __unbuffered_p1_EAX = x [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 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) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 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)) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 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)) [L761] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 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)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 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)) [L763] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 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)) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 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)) [L765] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 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 [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2815 SDtfs, 4665 SDslu, 6509 SDs, 0 SdLazy, 3703 SolverSat, 356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47186occurred 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: 5.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 8782 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 673 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 101769 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...