/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:11:27,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:11:27,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:11:27,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:11:27,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:11:27,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:11:27,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:11:27,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:11:27,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:11:27,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:11:27,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:11:27,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:11:27,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:11:27,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:11:27,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:11:27,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:11:27,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:11:27,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:11:27,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:11:27,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:11:27,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:11:27,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:11:27,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:11:27,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:11:27,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:11:27,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:11:27,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:11:27,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:11:27,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:11:27,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:11:27,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:11:27,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:11:27,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:11:27,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:11:27,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:11:27,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:11:27,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:11:27,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:11:27,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:11:27,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:11:27,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:11:27,590 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-VariableLbe-MCR.epf [2019-12-27 21:11:27,608 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:11:27,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:11:27,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:11:27,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:11:27,611 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:11:27,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:11:27,612 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:11:27,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:11:27,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:11:27,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:11:27,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:11:27,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:11:27,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:11:27,614 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:11:27,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:11:27,615 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:11:27,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:11:27,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:11:27,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:11:27,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:11:27,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:11:27,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:11:27,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:11:27,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:11:27,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:11:27,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:11:27,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:11:27,617 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:11:27,617 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:11:27,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:11:27,619 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:11:27,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:11:27,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:11:27,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:11:27,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:11:27,910 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:11:27,911 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:11:27,912 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.opt.i [2019-12-27 21:11:27,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d97c44d3/8e6809667a4344d1a4fe8dfce5d4aaab/FLAGf48ce7d91 [2019-12-27 21:11:28,511 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:11:28,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.opt.i [2019-12-27 21:11:28,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d97c44d3/8e6809667a4344d1a4fe8dfce5d4aaab/FLAGf48ce7d91 [2019-12-27 21:11:28,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d97c44d3/8e6809667a4344d1a4fe8dfce5d4aaab [2019-12-27 21:11:28,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:11:28,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:11:28,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:11:28,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:11:28,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:11:28,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:11:28" (1/1) ... [2019-12-27 21:11:28,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@adea97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:28, skipping insertion in model container [2019-12-27 21:11:28,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:11:28" (1/1) ... [2019-12-27 21:11:28,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:11:28,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:11:29,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:11:29,429 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:11:29,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:11:29,609 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:11:29,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29 WrapperNode [2019-12-27 21:11:29,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:11:29,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:11:29,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:11:29,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:11:29,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29" (1/1) ... [2019-12-27 21:11:29,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29" (1/1) ... [2019-12-27 21:11:29,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:11:29,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:11:29,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:11:29,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:11:29,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29" (1/1) ... [2019-12-27 21:11:29,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29" (1/1) ... [2019-12-27 21:11:29,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29" (1/1) ... [2019-12-27 21:11:29,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29" (1/1) ... [2019-12-27 21:11:29,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29" (1/1) ... [2019-12-27 21:11:29,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29" (1/1) ... [2019-12-27 21:11:29,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29" (1/1) ... [2019-12-27 21:11:29,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:11:29,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:11:29,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:11:29,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:11:29,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29" (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 21:11:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:11:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:11:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:11:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:11:29,775 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:11:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:11:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:11:29,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:11:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:11:29,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:11:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:11:29,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:11:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:11:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:11:29,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:11:29,780 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 21:11:30,513 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:11:30,514 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:11:30,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:11:30 BoogieIcfgContainer [2019-12-27 21:11:30,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:11:30,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:11:30,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:11:30,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:11:30,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:11:28" (1/3) ... [2019-12-27 21:11:30,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bffdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:11:30, skipping insertion in model container [2019-12-27 21:11:30,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:11:29" (2/3) ... [2019-12-27 21:11:30,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bffdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:11:30, skipping insertion in model container [2019-12-27 21:11:30,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:11:30" (3/3) ... [2019-12-27 21:11:30,526 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_tso.opt.i [2019-12-27 21:11:30,537 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:11:30,538 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:11:30,546 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:11:30,547 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:11:30,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,589 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,590 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,592 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,592 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,595 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,638 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,638 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,638 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,639 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,639 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,650 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,651 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,656 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,658 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,658 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,661 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,664 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,665 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:11:30,681 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:11:30,702 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:11:30,702 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:11:30,703 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:11:30,703 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:11:30,703 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:11:30,703 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:11:30,703 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:11:30,703 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:11:30,721 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-27 21:11:30,723 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-27 21:11:30,815 INFO L132 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-27 21:11:30,815 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:11:30,831 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:11:30,852 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-27 21:11:30,942 INFO L132 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-27 21:11:30,942 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:11:30,951 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:11:30,971 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 21:11:30,972 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:11:34,533 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:11:34,675 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:11:34,968 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 21:11:35,102 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 21:11:35,119 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50510 [2019-12-27 21:11:35,119 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 21:11:35,122 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 88 transitions [2019-12-27 21:11:37,173 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 30990 states. [2019-12-27 21:11:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 30990 states. [2019-12-27 21:11:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:11:37,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:37,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:11:37,184 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:37,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1670049475, now seen corresponding path program 1 times [2019-12-27 21:11:37,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:37,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812802902] [2019-12-27 21:11:37,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:37,457 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 21:11:37,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812802902] [2019-12-27 21:11:37,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:37,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:11:37,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [877962280] [2019-12-27 21:11:37,461 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:37,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:37,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:11:37,483 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:37,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:11:37,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:11:37,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:37,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:11:37,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:11:37,506 INFO L87 Difference]: Start difference. First operand 30990 states. Second operand 3 states. [2019-12-27 21:11:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:39,088 INFO L93 Difference]: Finished difference Result 29806 states and 128112 transitions. [2019-12-27 21:11:39,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:11:39,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:11:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:39,466 INFO L225 Difference]: With dead ends: 29806 [2019-12-27 21:11:39,467 INFO L226 Difference]: Without dead ends: 28014 [2019-12-27 21:11:39,471 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 21:11:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28014 states. [2019-12-27 21:11:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28014 to 28014. [2019-12-27 21:11:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28014 states. [2019-12-27 21:11:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28014 states to 28014 states and 120256 transitions. [2019-12-27 21:11:41,268 INFO L78 Accepts]: Start accepts. Automaton has 28014 states and 120256 transitions. Word has length 9 [2019-12-27 21:11:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:41,269 INFO L462 AbstractCegarLoop]: Abstraction has 28014 states and 120256 transitions. [2019-12-27 21:11:41,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:11:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 28014 states and 120256 transitions. [2019-12-27 21:11:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:11:41,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:41,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:11:41,277 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:41,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:41,278 INFO L82 PathProgramCache]: Analyzing trace with hash 165441832, now seen corresponding path program 1 times [2019-12-27 21:11:41,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:41,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047170201] [2019-12-27 21:11:41,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:41,372 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 21:11:41,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047170201] [2019-12-27 21:11:41,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:41,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:11:41,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [214492343] [2019-12-27 21:11:41,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:41,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:41,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:11:41,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:41,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:11:41,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:11:41,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:41,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:11:41,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:11:41,383 INFO L87 Difference]: Start difference. First operand 28014 states and 120256 transitions. Second operand 3 states. [2019-12-27 21:11:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:41,847 INFO L93 Difference]: Finished difference Result 22347 states and 89103 transitions. [2019-12-27 21:11:41,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:11:41,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:11:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:41,970 INFO L225 Difference]: With dead ends: 22347 [2019-12-27 21:11:41,970 INFO L226 Difference]: Without dead ends: 22347 [2019-12-27 21:11:41,973 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 21:11:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22347 states. [2019-12-27 21:11:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22347 to 22347. [2019-12-27 21:11:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22347 states. [2019-12-27 21:11:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22347 states to 22347 states and 89103 transitions. [2019-12-27 21:11:44,168 INFO L78 Accepts]: Start accepts. Automaton has 22347 states and 89103 transitions. Word has length 15 [2019-12-27 21:11:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:44,169 INFO L462 AbstractCegarLoop]: Abstraction has 22347 states and 89103 transitions. [2019-12-27 21:11:44,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:11:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 22347 states and 89103 transitions. [2019-12-27 21:11:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:11:44,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:44,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:11:44,173 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:44,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1942943562, now seen corresponding path program 1 times [2019-12-27 21:11:44,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:44,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172863868] [2019-12-27 21:11:44,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:44,283 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 21:11:44,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172863868] [2019-12-27 21:11:44,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:44,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:11:44,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5571266] [2019-12-27 21:11:44,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:44,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:44,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:11:44,293 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:44,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:11:44,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:11:44,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:44,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:11:44,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:11:44,369 INFO L87 Difference]: Start difference. First operand 22347 states and 89103 transitions. Second operand 6 states. [2019-12-27 21:11:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:44,496 INFO L93 Difference]: Finished difference Result 10229 states and 34571 transitions. [2019-12-27 21:11:44,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:11:44,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-27 21:11:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:44,536 INFO L225 Difference]: With dead ends: 10229 [2019-12-27 21:11:44,537 INFO L226 Difference]: Without dead ends: 10229 [2019-12-27 21:11:44,538 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 21:11:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10229 states. [2019-12-27 21:11:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10229 to 10229. [2019-12-27 21:11:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2019-12-27 21:11:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 34571 transitions. [2019-12-27 21:11:45,169 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 34571 transitions. Word has length 16 [2019-12-27 21:11:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:45,170 INFO L462 AbstractCegarLoop]: Abstraction has 10229 states and 34571 transitions. [2019-12-27 21:11:45,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:11:45,170 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 34571 transitions. [2019-12-27 21:11:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:11:45,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:45,173 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 21:11:45,173 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:45,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1127389089, now seen corresponding path program 1 times [2019-12-27 21:11:45,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:45,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13448471] [2019-12-27 21:11:45,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:45,267 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 21:11:45,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13448471] [2019-12-27 21:11:45,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:45,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:11:45,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1184119680] [2019-12-27 21:11:45,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:45,278 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:45,281 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:11:45,282 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:45,392 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:11:45,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:11:45,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:45,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:11:45,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:11:45,393 INFO L87 Difference]: Start difference. First operand 10229 states and 34571 transitions. Second operand 9 states. [2019-12-27 21:11:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:45,497 INFO L93 Difference]: Finished difference Result 2968 states and 9107 transitions. [2019-12-27 21:11:45,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:11:45,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-12-27 21:11:45,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:45,511 INFO L225 Difference]: With dead ends: 2968 [2019-12-27 21:11:45,511 INFO L226 Difference]: Without dead ends: 2968 [2019-12-27 21:11:45,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:11:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2019-12-27 21:11:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2019-12-27 21:11:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2019-12-27 21:11:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 9107 transitions. [2019-12-27 21:11:45,573 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 9107 transitions. Word has length 17 [2019-12-27 21:11:45,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:45,573 INFO L462 AbstractCegarLoop]: Abstraction has 2968 states and 9107 transitions. [2019-12-27 21:11:45,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:11:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 9107 transitions. [2019-12-27 21:11:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:11:45,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:45,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:11:45,576 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash 506293938, now seen corresponding path program 1 times [2019-12-27 21:11:45,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:45,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393356525] [2019-12-27 21:11:45,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:45,634 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 21:11:45,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393356525] [2019-12-27 21:11:45,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:45,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:11:45,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1181355900] [2019-12-27 21:11:45,636 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:45,639 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:45,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:11:45,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:45,659 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:11:45,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:11:45,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:45,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:11:45,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:11:45,660 INFO L87 Difference]: Start difference. First operand 2968 states and 9107 transitions. Second operand 5 states. [2019-12-27 21:11:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:45,866 INFO L93 Difference]: Finished difference Result 3751 states and 11312 transitions. [2019-12-27 21:11:45,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:11:45,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:11:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:45,876 INFO L225 Difference]: With dead ends: 3751 [2019-12-27 21:11:45,876 INFO L226 Difference]: Without dead ends: 3751 [2019-12-27 21:11:45,876 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 21:11:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2019-12-27 21:11:45,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3583. [2019-12-27 21:11:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3583 states. [2019-12-27 21:11:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 10934 transitions. [2019-12-27 21:11:45,959 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 10934 transitions. Word has length 18 [2019-12-27 21:11:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:45,959 INFO L462 AbstractCegarLoop]: Abstraction has 3583 states and 10934 transitions. [2019-12-27 21:11:45,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:11:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 10934 transitions. [2019-12-27 21:11:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:11:45,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:45,969 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] [2019-12-27 21:11:45,970 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:45,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:45,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1112111079, now seen corresponding path program 1 times [2019-12-27 21:11:45,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:45,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546432931] [2019-12-27 21:11:45,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:46,047 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 21:11:46,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546432931] [2019-12-27 21:11:46,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:46,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:11:46,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2044157085] [2019-12-27 21:11:46,048 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:46,055 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:46,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 46 transitions. [2019-12-27 21:11:46,067 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:46,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:11:46,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:11:46,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:11:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:11:46,106 INFO L87 Difference]: Start difference. First operand 3583 states and 10934 transitions. Second operand 6 states. [2019-12-27 21:11:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:46,153 INFO L93 Difference]: Finished difference Result 5481 states and 15973 transitions. [2019-12-27 21:11:46,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:11:46,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 21:11:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:46,162 INFO L225 Difference]: With dead ends: 5481 [2019-12-27 21:11:46,162 INFO L226 Difference]: Without dead ends: 3607 [2019-12-27 21:11:46,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:11:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-27 21:11:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3575. [2019-12-27 21:11:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3575 states. [2019-12-27 21:11:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 3575 states and 10798 transitions. [2019-12-27 21:11:46,236 INFO L78 Accepts]: Start accepts. Automaton has 3575 states and 10798 transitions. Word has length 32 [2019-12-27 21:11:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:46,236 INFO L462 AbstractCegarLoop]: Abstraction has 3575 states and 10798 transitions. [2019-12-27 21:11:46,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:11:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 10798 transitions. [2019-12-27 21:11:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:11:46,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:46,244 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] [2019-12-27 21:11:46,245 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:46,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:46,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1047758670, now seen corresponding path program 1 times [2019-12-27 21:11:46,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:46,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648216012] [2019-12-27 21:11:46,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:46,313 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 21:11:46,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648216012] [2019-12-27 21:11:46,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:46,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:11:46,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1256849468] [2019-12-27 21:11:46,315 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:46,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:46,382 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 21:11:46,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:46,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:11:46,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:11:46,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:46,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:11:46,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:11:46,426 INFO L87 Difference]: Start difference. First operand 3575 states and 10798 transitions. Second operand 5 states. [2019-12-27 21:11:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:46,639 INFO L93 Difference]: Finished difference Result 5225 states and 15665 transitions. [2019-12-27 21:11:46,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:11:46,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 21:11:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:46,650 INFO L225 Difference]: With dead ends: 5225 [2019-12-27 21:11:46,650 INFO L226 Difference]: Without dead ends: 5225 [2019-12-27 21:11:46,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:11:46,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-12-27 21:11:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4249. [2019-12-27 21:11:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4249 states. [2019-12-27 21:11:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 12995 transitions. [2019-12-27 21:11:46,737 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 12995 transitions. Word has length 32 [2019-12-27 21:11:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:46,738 INFO L462 AbstractCegarLoop]: Abstraction has 4249 states and 12995 transitions. [2019-12-27 21:11:46,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:11:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 12995 transitions. [2019-12-27 21:11:46,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:11:46,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:46,748 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] [2019-12-27 21:11:46,749 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:46,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:46,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1443701580, now seen corresponding path program 1 times [2019-12-27 21:11:46,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:46,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738325141] [2019-12-27 21:11:46,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:46,792 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 21:11:46,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738325141] [2019-12-27 21:11:46,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:46,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:11:46,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1496875357] [2019-12-27 21:11:46,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:46,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:46,857 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 21:11:46,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:46,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:11:46,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:11:46,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:46,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:11:46,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:11:46,893 INFO L87 Difference]: Start difference. First operand 4249 states and 12995 transitions. Second operand 5 states. [2019-12-27 21:11:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:46,988 INFO L93 Difference]: Finished difference Result 5225 states and 15251 transitions. [2019-12-27 21:11:46,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:11:46,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 21:11:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:46,998 INFO L225 Difference]: With dead ends: 5225 [2019-12-27 21:11:46,999 INFO L226 Difference]: Without dead ends: 5225 [2019-12-27 21:11:46,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:11:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-12-27 21:11:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4213. [2019-12-27 21:11:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4213 states. [2019-12-27 21:11:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 12512 transitions. [2019-12-27 21:11:47,084 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 12512 transitions. Word has length 32 [2019-12-27 21:11:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:47,084 INFO L462 AbstractCegarLoop]: Abstraction has 4213 states and 12512 transitions. [2019-12-27 21:11:47,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:11:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 12512 transitions. [2019-12-27 21:11:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:11:47,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:47,092 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] [2019-12-27 21:11:47,093 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:47,093 INFO L82 PathProgramCache]: Analyzing trace with hash 121864036, now seen corresponding path program 1 times [2019-12-27 21:11:47,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:47,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789586485] [2019-12-27 21:11:47,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:47,162 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 21:11:47,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789586485] [2019-12-27 21:11:47,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:47,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:11:47,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2109706286] [2019-12-27 21:11:47,163 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:47,169 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:47,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 21:11:47,222 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:47,379 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:11:47,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:11:47,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:47,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:11:47,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:11:47,380 INFO L87 Difference]: Start difference. First operand 4213 states and 12512 transitions. Second operand 11 states. [2019-12-27 21:11:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:47,494 INFO L93 Difference]: Finished difference Result 3178 states and 9948 transitions. [2019-12-27 21:11:47,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:11:47,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-12-27 21:11:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:47,499 INFO L225 Difference]: With dead ends: 3178 [2019-12-27 21:11:47,499 INFO L226 Difference]: Without dead ends: 2924 [2019-12-27 21:11:47,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:11:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2019-12-27 21:11:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2744. [2019-12-27 21:11:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2019-12-27 21:11:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 8606 transitions. [2019-12-27 21:11:47,546 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 8606 transitions. Word has length 32 [2019-12-27 21:11:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:47,546 INFO L462 AbstractCegarLoop]: Abstraction has 2744 states and 8606 transitions. [2019-12-27 21:11:47,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:11:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 8606 transitions. [2019-12-27 21:11:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:11:47,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:47,552 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] [2019-12-27 21:11:47,553 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:47,553 INFO L82 PathProgramCache]: Analyzing trace with hash 992352402, now seen corresponding path program 1 times [2019-12-27 21:11:47,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:47,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129155159] [2019-12-27 21:11:47,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:47,614 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 21:11:47,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129155159] [2019-12-27 21:11:47,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:47,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:11:47,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019000707] [2019-12-27 21:11:47,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:47,630 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:47,864 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 246 transitions. [2019-12-27 21:11:47,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:47,865 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:11:47,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:11:47,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:47,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:11:47,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:11:47,866 INFO L87 Difference]: Start difference. First operand 2744 states and 8606 transitions. Second operand 3 states. [2019-12-27 21:11:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:47,891 INFO L93 Difference]: Finished difference Result 4096 states and 12179 transitions. [2019-12-27 21:11:47,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:11:47,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 21:11:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:47,894 INFO L225 Difference]: With dead ends: 4096 [2019-12-27 21:11:47,894 INFO L226 Difference]: Without dead ends: 1418 [2019-12-27 21:11:47,895 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 21:11:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2019-12-27 21:11:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1418. [2019-12-27 21:11:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-27 21:11:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 3722 transitions. [2019-12-27 21:11:47,914 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 3722 transitions. Word has length 47 [2019-12-27 21:11:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:47,914 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 3722 transitions. [2019-12-27 21:11:47,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:11:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 3722 transitions. [2019-12-27 21:11:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:11:47,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:47,917 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] [2019-12-27 21:11:47,917 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:47,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:47,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2081953324, now seen corresponding path program 2 times [2019-12-27 21:11:47,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:47,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325661846] [2019-12-27 21:11:47,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:48,003 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 21:11:48,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325661846] [2019-12-27 21:11:48,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:48,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:11:48,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [688099205] [2019-12-27 21:11:48,004 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:48,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:48,101 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 233 transitions. [2019-12-27 21:11:48,101 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:48,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:11:48,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:11:48,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:48,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:11:48,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:11:48,104 INFO L87 Difference]: Start difference. First operand 1418 states and 3722 transitions. Second operand 7 states. [2019-12-27 21:11:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:48,400 INFO L93 Difference]: Finished difference Result 3765 states and 9849 transitions. [2019-12-27 21:11:48,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:11:48,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 21:11:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:48,407 INFO L225 Difference]: With dead ends: 3765 [2019-12-27 21:11:48,407 INFO L226 Difference]: Without dead ends: 2471 [2019-12-27 21:11:48,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:11:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-12-27 21:11:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 1595. [2019-12-27 21:11:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-27 21:11:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 4164 transitions. [2019-12-27 21:11:48,443 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 4164 transitions. Word has length 47 [2019-12-27 21:11:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:48,443 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 4164 transitions. [2019-12-27 21:11:48,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:11:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 4164 transitions. [2019-12-27 21:11:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:11:48,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:48,448 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] [2019-12-27 21:11:48,448 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1032275112, now seen corresponding path program 3 times [2019-12-27 21:11:48,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:48,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150780765] [2019-12-27 21:11:48,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:48,664 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 21:11:48,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150780765] [2019-12-27 21:11:48,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:48,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:11:48,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [803591022] [2019-12-27 21:11:48,665 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:48,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:48,868 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 369 transitions. [2019-12-27 21:11:48,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:48,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:11:48,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:11:48,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:48,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:11:48,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:11:48,921 INFO L87 Difference]: Start difference. First operand 1595 states and 4164 transitions. Second operand 11 states. [2019-12-27 21:11:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:51,321 INFO L93 Difference]: Finished difference Result 3594 states and 8903 transitions. [2019-12-27 21:11:51,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 21:11:51,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2019-12-27 21:11:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:51,329 INFO L225 Difference]: With dead ends: 3594 [2019-12-27 21:11:51,329 INFO L226 Difference]: Without dead ends: 3558 [2019-12-27 21:11:51,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=377, Invalid=1183, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 21:11:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-12-27 21:11:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 1777. [2019-12-27 21:11:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1777 states. [2019-12-27 21:11:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 4504 transitions. [2019-12-27 21:11:51,379 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 4504 transitions. Word has length 47 [2019-12-27 21:11:51,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:51,380 INFO L462 AbstractCegarLoop]: Abstraction has 1777 states and 4504 transitions. [2019-12-27 21:11:51,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:11:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 4504 transitions. [2019-12-27 21:11:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:11:51,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:51,384 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] [2019-12-27 21:11:51,384 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:51,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:51,385 INFO L82 PathProgramCache]: Analyzing trace with hash 650117112, now seen corresponding path program 4 times [2019-12-27 21:11:51,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:51,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427595700] [2019-12-27 21:11:51,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:51,532 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 21:11:51,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427595700] [2019-12-27 21:11:51,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:51,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:11:51,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811339653] [2019-12-27 21:11:51,534 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:51,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:51,689 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 270 transitions. [2019-12-27 21:11:51,689 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:51,783 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:11:51,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:11:51,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:51,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:11:51,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:11:51,785 INFO L87 Difference]: Start difference. First operand 1777 states and 4504 transitions. Second operand 8 states. [2019-12-27 21:11:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:53,192 INFO L93 Difference]: Finished difference Result 3768 states and 9500 transitions. [2019-12-27 21:11:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:11:53,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-12-27 21:11:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:53,198 INFO L225 Difference]: With dead ends: 3768 [2019-12-27 21:11:53,199 INFO L226 Difference]: Without dead ends: 3768 [2019-12-27 21:11:53,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:11:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2019-12-27 21:11:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 1879. [2019-12-27 21:11:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2019-12-27 21:11:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 4801 transitions. [2019-12-27 21:11:53,235 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 4801 transitions. Word has length 47 [2019-12-27 21:11:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:53,235 INFO L462 AbstractCegarLoop]: Abstraction has 1879 states and 4801 transitions. [2019-12-27 21:11:53,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:11:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 4801 transitions. [2019-12-27 21:11:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:11:53,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:53,239 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] [2019-12-27 21:11:53,239 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:53,240 INFO L82 PathProgramCache]: Analyzing trace with hash 88691356, now seen corresponding path program 5 times [2019-12-27 21:11:53,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:53,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684828630] [2019-12-27 21:11:53,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:11:53,310 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 21:11:53,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684828630] [2019-12-27 21:11:53,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:11:53,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:11:53,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [382067307] [2019-12-27 21:11:53,311 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:11:53,324 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:11:53,476 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 330 transitions. [2019-12-27 21:11:53,476 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:11:53,477 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:11:53,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:11:53,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:11:53,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:11:53,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:11:53,478 INFO L87 Difference]: Start difference. First operand 1879 states and 4801 transitions. Second operand 3 states. [2019-12-27 21:11:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:11:53,492 INFO L93 Difference]: Finished difference Result 1877 states and 4796 transitions. [2019-12-27 21:11:53,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:11:53,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 21:11:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:11:53,495 INFO L225 Difference]: With dead ends: 1877 [2019-12-27 21:11:53,495 INFO L226 Difference]: Without dead ends: 1877 [2019-12-27 21:11:53,496 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 21:11:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-12-27 21:11:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1511. [2019-12-27 21:11:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2019-12-27 21:11:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 3867 transitions. [2019-12-27 21:11:53,522 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 3867 transitions. Word has length 47 [2019-12-27 21:11:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:11:53,523 INFO L462 AbstractCegarLoop]: Abstraction has 1511 states and 3867 transitions. [2019-12-27 21:11:53,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:11:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 3867 transitions. [2019-12-27 21:11:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:11:53,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:11:53,526 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] [2019-12-27 21:11:53,526 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:11:53,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:11:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash 378110637, now seen corresponding path program 1 times [2019-12-27 21:11:53,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:11:53,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953540940] [2019-12-27 21:11:53,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:11:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:11:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:11:53,675 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:11:53,675 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:11:53,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a~0_9) (= 0 v_~z$r_buff1_thd3~0_41) (= v_~y~0_18 0) (= 0 v_~z$r_buff1_thd1~0_10) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~weak$$choice0~0_9) (= v_~z$r_buff0_thd1~0_10 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd3~0_63 0) (= v_~z$mem_tmp~0_11 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1085~0.base_28|)) (= |v_ULTIMATE.start_main_~#t1085~0.offset_22| 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_21 0) (= v_~b~0_11 0) (= 0 v_~z$w_buff1~0_22) (= 0 v_~__unbuffered_p3_EAX~0_17) (= v_~x~0_17 0) (= v_~z$read_delayed_var~0.base_6 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t1085~0.base_28| 4) |v_#length_31|) (= v_~z$r_buff0_thd4~0_26 0) (= 0 v_~__unbuffered_p2_EAX~0_17) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1085~0.base_28|) (= 0 v_~z$flush_delayed~0_14) (= 0 v_~z$r_buff1_thd2~0_10) (= v_~z~0_23 0) (= v_~z$w_buff0_used~0_91 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff1_thd0~0_22) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff1_thd4~0_17) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_4| 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z$w_buff0~0_25) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t1085~0.base_28| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t1085~0.base_28|) |v_ULTIMATE.start_main_~#t1085~0.offset_22| 0)) |v_#memory_int_29|) (= 0 v_~z$w_buff1_used~0_57) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1085~0.base_28| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1087~0.base=|v_ULTIMATE.start_main_~#t1087~0.base_27|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_~#t1086~0.offset=|v_ULTIMATE.start_main_~#t1086~0.offset_21|, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_17, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ULTIMATE.start_main_~#t1085~0.offset=|v_ULTIMATE.start_main_~#t1085~0.offset_22|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ULTIMATE.start_main_~#t1086~0.base=|v_ULTIMATE.start_main_~#t1086~0.base_27|, ~x~0=v_~x~0_17, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1085~0.base=|v_ULTIMATE.start_main_~#t1085~0.base_28|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ~y~0=v_~y~0_18, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1088~0.offset=|v_ULTIMATE.start_main_~#t1088~0.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_25, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_~#t1088~0.base=|v_ULTIMATE.start_main_~#t1088~0.base_20|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_~#t1087~0.offset=|v_ULTIMATE.start_main_~#t1087~0.offset_21|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1087~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t1086~0.offset, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1085~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1086~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1085~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1088~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1088~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1087~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:11:53,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1086~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1086~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1086~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1086~0.base_13|) |v_ULTIMATE.start_main_~#t1086~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1086~0.base_13| 0)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1086~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1086~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1086~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1086~0.offset=|v_ULTIMATE.start_main_~#t1086~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1086~0.base=|v_ULTIMATE.start_main_~#t1086~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1086~0.offset, #length, ULTIMATE.start_main_~#t1086~0.base] because there is no mapped edge [2019-12-27 21:11:53,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L843-1-->L845: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1087~0.base_13|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1087~0.base_13| 4) |v_#length_21|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1087~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1087~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1087~0.base_13|) |v_ULTIMATE.start_main_~#t1087~0.offset_11| 2)) |v_#memory_int_19|) (= |v_ULTIMATE.start_main_~#t1087~0.offset_11| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1087~0.base_13|) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1087~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1087~0.base=|v_ULTIMATE.start_main_~#t1087~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1087~0.offset=|v_ULTIMATE.start_main_~#t1087~0.offset_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1087~0.base, ULTIMATE.start_main_~#t1087~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 21:11:53,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= |v_ULTIMATE.start_main_~#t1088~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1088~0.base_11|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1088~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1088~0.base_11|) |v_ULTIMATE.start_main_~#t1088~0.offset_10| 3)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1088~0.base_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1088~0.base_11| 4)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1088~0.base_11| 1) |v_#valid_42|) (not (= |v_ULTIMATE.start_main_~#t1088~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1088~0.offset=|v_ULTIMATE.start_main_~#t1088~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1088~0.base=|v_ULTIMATE.start_main_~#t1088~0.base_11|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1088~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1088~0.base, #length] because there is no mapped edge [2019-12-27 21:11:53,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= (mod v_~z$w_buff1_used~0_38 256) 0) (= v_P3Thread1of1ForFork1_~arg.base_4 |v_P3Thread1of1ForFork1_#in~arg.base_4|) (= v_~z$w_buff0_used~0_61 v_~z$w_buff1_used~0_38) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6) (= v_~z$w_buff0_used~0_60 1) (= v_~z$w_buff0~0_14 v_~z$w_buff1~0_12) (= |v_P3Thread1of1ForFork1_#in~arg.offset_4| v_P3Thread1of1ForFork1_~arg.offset_4) (= 1 v_~z$w_buff0~0_13)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_61, ~z$w_buff0~0=v_~z$w_buff0~0_14, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_4|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_4|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_60, ~z$w_buff0~0=v_~z$w_buff0~0_13, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_4|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_38, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, ~z$w_buff1~0=v_~z$w_buff1~0_12, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_4, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_4|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 21:11:53,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~x~0_7) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= 1 v_~b~0_6)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~b~0=v_~b~0_6, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 21:11:53,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 2 v_~x~0_8) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= 1 v_~y~0_8) (= v_P1Thread1of1ForFork3_~arg.offset_4 |v_P1Thread1of1ForFork3_#in~arg.offset_4|) (= v_P1Thread1of1ForFork3_~arg.base_4 |v_P1Thread1of1ForFork3_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_4, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_4|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_4, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_4|, ~y~0=v_~y~0_8, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-27 21:11:53,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L776-->L776-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1415087621 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite9_Out-1415087621| |P2Thread1of1ForFork0_#t~ite8_Out-1415087621|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1415087621 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-1415087621 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In-1415087621 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-1415087621 256)) .cse0))) .cse1 (= ~z$w_buff0~0_In-1415087621 |P2Thread1of1ForFork0_#t~ite8_Out-1415087621|)) (and (= ~z$w_buff0~0_In-1415087621 |P2Thread1of1ForFork0_#t~ite9_Out-1415087621|) (= |P2Thread1of1ForFork0_#t~ite8_In-1415087621| |P2Thread1of1ForFork0_#t~ite8_Out-1415087621|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In-1415087621|, ~z$w_buff0~0=~z$w_buff0~0_In-1415087621, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1415087621, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1415087621, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1415087621, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1415087621, ~weak$$choice2~0=~weak$$choice2~0_In-1415087621} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out-1415087621|, ~z$w_buff0~0=~z$w_buff0~0_In-1415087621, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1415087621, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1415087621, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1415087621, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1415087621, ~weak$$choice2~0=~weak$$choice2~0_In-1415087621, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out-1415087621|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 21:11:53,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2143450336 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out2143450336| ~z$w_buff1~0_In2143450336) (= |P2Thread1of1ForFork0_#t~ite11_In2143450336| |P2Thread1of1ForFork0_#t~ite11_Out2143450336|)) (and (= |P2Thread1of1ForFork0_#t~ite11_Out2143450336| ~z$w_buff1~0_In2143450336) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2143450336 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In2143450336 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In2143450336 256) 0)) (= (mod ~z$w_buff0_used~0_In2143450336 256) 0))) .cse0 (= |P2Thread1of1ForFork0_#t~ite11_Out2143450336| |P2Thread1of1ForFork0_#t~ite12_Out2143450336|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2143450336, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In2143450336|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2143450336, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2143450336, ~z$w_buff1~0=~z$w_buff1~0_In2143450336, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2143450336, ~weak$$choice2~0=~weak$$choice2~0_In2143450336} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out2143450336|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2143450336, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out2143450336|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2143450336, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2143450336, ~z$w_buff1~0=~z$w_buff1~0_In2143450336, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2143450336, ~weak$$choice2~0=~weak$$choice2~0_In2143450336} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 21:11:53,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1475523796 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite14_In1475523796| |P2Thread1of1ForFork0_#t~ite14_Out1475523796|) (= |P2Thread1of1ForFork0_#t~ite15_Out1475523796| ~z$w_buff0_used~0_In1475523796)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1475523796 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1475523796 256))) (= 0 (mod ~z$w_buff0_used~0_In1475523796 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1475523796 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite14_Out1475523796| ~z$w_buff0_used~0_In1475523796) .cse0 (= |P2Thread1of1ForFork0_#t~ite15_Out1475523796| |P2Thread1of1ForFork0_#t~ite14_Out1475523796|)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In1475523796|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1475523796, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1475523796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1475523796, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1475523796, ~weak$$choice2~0=~weak$$choice2~0_In1475523796} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1475523796|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out1475523796|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1475523796, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1475523796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1475523796, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1475523796, ~weak$$choice2~0=~weak$$choice2~0_In1475523796} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-27 21:11:53,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (= v_~z$r_buff0_thd3~0_43 v_~z$r_buff0_thd3~0_42) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 21:11:53,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1067314807 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1067314807 256) 0))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite28_Out1067314807|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1067314807 |P3Thread1of1ForFork1_#t~ite28_Out1067314807|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1067314807, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1067314807} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1067314807, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1067314807|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1067314807} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:11:53,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_12 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:11:53,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In2018443175 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2018443175 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In2018443175 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2018443175 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite29_Out2018443175| ~z$w_buff1_used~0_In2018443175)) (and (= |P3Thread1of1ForFork1_#t~ite29_Out2018443175| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2018443175, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2018443175, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2018443175, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2018443175} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2018443175, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out2018443175|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2018443175, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2018443175, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2018443175} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 21:11:53,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1646683094 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1646683094 256)))) (or (and (= ~z$r_buff0_thd4~0_Out-1646683094 ~z$r_buff0_thd4~0_In-1646683094) (or .cse0 .cse1)) (and (not .cse1) (= ~z$r_buff0_thd4~0_Out-1646683094 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1646683094, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1646683094} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1646683094, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1646683094, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1646683094|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 21:11:53,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1180447400 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1180447400 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1180447400 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1180447400 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite31_Out1180447400| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite31_Out1180447400| ~z$r_buff1_thd4~0_In1180447400)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1180447400, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1180447400, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1180447400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1180447400} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1180447400, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1180447400, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1180447400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1180447400, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1180447400|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 21:11:53,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd4~0_12 |v_P3Thread1of1ForFork1_#t~ite31_8|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_8|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 21:11:53,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:11:53,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1664370193 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1664370193 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-1664370193| ~z~0_In-1664370193) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1664370193| ~z$w_buff1~0_In-1664370193) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1664370193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1664370193, ~z$w_buff1~0=~z$w_buff1~0_In-1664370193, ~z~0=~z~0_In-1664370193} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1664370193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1664370193, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1664370193|, ~z$w_buff1~0=~z$w_buff1~0_In-1664370193, ~z~0=~z~0_In-1664370193} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 21:11:53,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_14 |v_ULTIMATE.start_main_#t~ite36_8|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_8|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 21:11:53,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In27355850 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In27355850 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out27355850| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out27355850| ~z$w_buff0_used~0_In27355850) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In27355850, ~z$w_buff0_used~0=~z$w_buff0_used~0_In27355850} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In27355850, ~z$w_buff0_used~0=~z$w_buff0_used~0_In27355850, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out27355850|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:11:53,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-440715404 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-440715404 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-440715404 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-440715404 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out-440715404| ~z$w_buff1_used~0_In-440715404)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-440715404|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-440715404, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-440715404, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-440715404, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-440715404} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-440715404, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-440715404|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-440715404, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-440715404, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-440715404} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:11:53,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1905485817 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1905485817 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out-1905485817|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1905485817 |ULTIMATE.start_main_#t~ite40_Out-1905485817|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1905485817, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1905485817} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1905485817, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1905485817|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1905485817} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:11:53,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In200090674 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In200090674 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In200090674 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In200090674 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out200090674|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite41_Out200090674| ~z$r_buff1_thd0~0_In200090674) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In200090674, ~z$w_buff0_used~0=~z$w_buff0_used~0_In200090674, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In200090674, ~z$w_buff1_used~0=~z$w_buff1_used~0_In200090674} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out200090674|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In200090674, ~z$w_buff0_used~0=~z$w_buff0_used~0_In200090674, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In200090674, ~z$w_buff1_used~0=~z$w_buff1_used~0_In200090674} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 21:11:53,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= v_~main$tmp_guard1~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~x~0_10 2) (= v_~y~0_10 2) (= 1 v_~__unbuffered_p3_EAX~0_9) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= |v_ULTIMATE.start_main_#t~ite41_13| v_~z$r_buff1_thd0~0_14) (= 0 v_~__unbuffered_p3_EBX~0_8)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:11:53,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:11:53 BasicIcfg [2019-12-27 21:11:53,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:11:53,821 INFO L168 Benchmark]: Toolchain (without parser) took 25051.59 ms. Allocated memory was 146.8 MB in the beginning and 1.1 GB in the end (delta: 995.1 MB). Free memory was 103.2 MB in the beginning and 394.4 MB in the end (delta: -291.2 MB). Peak memory consumption was 703.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:11:53,821 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 21:11:53,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.00 ms. Allocated memory was 146.8 MB in the beginning and 206.0 MB in the end (delta: 59.2 MB). Free memory was 102.8 MB in the beginning and 159.7 MB in the end (delta: -56.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:11:53,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.82 ms. Allocated memory is still 206.0 MB. Free memory was 159.7 MB in the beginning and 156.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:11:53,823 INFO L168 Benchmark]: Boogie Preprocessor took 38.17 ms. Allocated memory is still 206.0 MB. Free memory was 156.9 MB in the beginning and 155.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:11:53,824 INFO L168 Benchmark]: RCFGBuilder took 804.53 ms. Allocated memory is still 206.0 MB. Free memory was 155.0 MB in the beginning and 108.6 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:11:53,824 INFO L168 Benchmark]: TraceAbstraction took 23300.24 ms. Allocated memory was 206.0 MB in the beginning and 1.1 GB in the end (delta: 935.9 MB). Free memory was 108.6 MB in the beginning and 394.4 MB in the end (delta: -285.7 MB). Peak memory consumption was 650.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:11:53,828 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.20 ms. Allocated memory is still 146.8 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 839.00 ms. Allocated memory was 146.8 MB in the beginning and 206.0 MB in the end (delta: 59.2 MB). Free memory was 102.8 MB in the beginning and 159.7 MB in the end (delta: -56.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.82 ms. Allocated memory is still 206.0 MB. Free memory was 159.7 MB in the beginning and 156.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.17 ms. Allocated memory is still 206.0 MB. Free memory was 156.9 MB in the beginning and 155.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 804.53 ms. Allocated memory is still 206.0 MB. Free memory was 155.0 MB in the beginning and 108.6 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23300.24 ms. Allocated memory was 206.0 MB in the beginning and 1.1 GB in the end (delta: 935.9 MB). Free memory was 108.6 MB in the beginning and 394.4 MB in the end (delta: -285.7 MB). Peak memory consumption was 650.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 169 ProgramPointsBefore, 82 ProgramPointsAfterwards, 191 TransitionsBefore, 88 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 21 ChoiceCompositions, 5425 VarBasedMoverChecksPositive, 133 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50510 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1085, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1086, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1087, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1088, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1859 SDtfs, 2909 SDslu, 4369 SDs, 0 SdLazy, 2510 SolverSat, 256 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30990occurred 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 7280 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 48667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...