/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:49:34,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:49:34,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:49:34,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:49:34,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:49:34,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:49:34,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:49:34,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:49:34,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:49:34,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:49:34,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:49:34,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:49:34,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:49:34,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:49:34,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:49:34,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:49:34,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:49:34,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:49:34,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:49:34,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:49:34,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:49:34,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:49:34,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:49:34,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:49:34,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:49:34,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:49:34,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:49:34,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:49:34,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:49:34,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:49:34,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:49:34,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:49:34,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:49:34,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:49:34,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:49:34,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:49:34,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:49:34,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:49:34,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:49:34,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:49:34,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:49:34,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:49:34,551 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:49:34,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:49:34,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:49:34,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:49:34,553 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:49:34,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:49:34,554 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:49:34,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:49:34,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:49:34,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:49:34,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:49:34,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:49:34,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:49:34,555 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:49:34,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:49:34,555 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:49:34,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:49:34,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:49:34,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:49:34,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:49:34,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:49:34,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:49:34,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:49:34,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:49:34,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:49:34,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:49:34,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:49:34,559 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:49:34,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:49:34,560 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:49:34,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:49:34,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:49:34,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:49:34,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:49:34,840 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:49:34,841 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:49:34,842 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i [2019-12-27 17:49:34,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ee10e56/0913a8c1139a43dfa6a069531fd27fb9/FLAG4f5c11654 [2019-12-27 17:49:35,552 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:49:35,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i [2019-12-27 17:49:35,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ee10e56/0913a8c1139a43dfa6a069531fd27fb9/FLAG4f5c11654 [2019-12-27 17:49:35,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ee10e56/0913a8c1139a43dfa6a069531fd27fb9 [2019-12-27 17:49:35,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:49:35,781 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:49:35,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:49:35,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:49:35,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:49:35,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:49:35" (1/1) ... [2019-12-27 17:49:35,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24328a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:35, skipping insertion in model container [2019-12-27 17:49:35,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:49:35" (1/1) ... [2019-12-27 17:49:35,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:49:35,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:49:36,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:49:36,390 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:49:36,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:49:36,556 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:49:36,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36 WrapperNode [2019-12-27 17:49:36,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:49:36,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:49:36,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:49:36,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:49:36,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36" (1/1) ... [2019-12-27 17:49:36,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36" (1/1) ... [2019-12-27 17:49:36,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:49:36,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:49:36,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:49:36,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:49:36,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36" (1/1) ... [2019-12-27 17:49:36,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36" (1/1) ... [2019-12-27 17:49:36,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36" (1/1) ... [2019-12-27 17:49:36,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36" (1/1) ... [2019-12-27 17:49:36,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36" (1/1) ... [2019-12-27 17:49:36,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36" (1/1) ... [2019-12-27 17:49:36,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36" (1/1) ... [2019-12-27 17:49:36,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:49:36,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:49:36,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:49:36,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:49:36,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36" (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 17:49:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:49:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:49:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:49:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:49:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:49:36,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:49:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:49:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:49:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:49:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:49:36,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:49:36,772 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 17:49:37,519 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:49:37,519 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:49:37,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:49:37 BoogieIcfgContainer [2019-12-27 17:49:37,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:49:37,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:49:37,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:49:37,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:49:37,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:49:35" (1/3) ... [2019-12-27 17:49:37,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e3b8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:49:37, skipping insertion in model container [2019-12-27 17:49:37,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:49:36" (2/3) ... [2019-12-27 17:49:37,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e3b8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:49:37, skipping insertion in model container [2019-12-27 17:49:37,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:49:37" (3/3) ... [2019-12-27 17:49:37,529 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_tso.opt.i [2019-12-27 17:49:37,540 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:49:37,540 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:49:37,548 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:49:37,549 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:49:37,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,618 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,618 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,627 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,627 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,627 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,628 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,628 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,661 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,666 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:49:37,682 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:49:37,703 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:49:37,703 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:49:37,703 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:49:37,703 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:49:37,704 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:49:37,704 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:49:37,704 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:49:37,704 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:49:37,724 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-27 17:49:37,726 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-27 17:49:37,867 INFO L132 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-27 17:49:37,868 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:49:37,886 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 17:49:37,916 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-27 17:49:37,977 INFO L132 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-27 17:49:37,978 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:49:37,988 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 17:49:38,016 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-27 17:49:38,018 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:49:43,614 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 17:49:43,717 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 17:49:43,751 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142511 [2019-12-27 17:49:43,752 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 17:49:43,755 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 137 transitions [2019-12-27 17:49:45,229 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27484 states. [2019-12-27 17:49:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states. [2019-12-27 17:49:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:49:45,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:45,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:49:45,239 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:45,245 INFO L82 PathProgramCache]: Analyzing trace with hash 979333444, now seen corresponding path program 1 times [2019-12-27 17:49:45,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:45,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164541505] [2019-12-27 17:49:45,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:45,557 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 17:49:45,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164541505] [2019-12-27 17:49:45,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:45,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:49:45,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [848416047] [2019-12-27 17:49:45,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:45,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:45,590 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:49:45,590 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:45,594 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:45,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:49:45,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:45,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:49:45,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:49:45,612 INFO L87 Difference]: Start difference. First operand 27484 states. Second operand 3 states. [2019-12-27 17:49:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:46,915 INFO L93 Difference]: Finished difference Result 27436 states and 97226 transitions. [2019-12-27 17:49:46,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:49:46,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:49:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:47,166 INFO L225 Difference]: With dead ends: 27436 [2019-12-27 17:49:47,166 INFO L226 Difference]: Without dead ends: 26890 [2019-12-27 17:49:47,168 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 17:49:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-12-27 17:49:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 26890. [2019-12-27 17:49:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26890 states. [2019-12-27 17:49:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26890 states to 26890 states and 95406 transitions. [2019-12-27 17:49:48,617 INFO L78 Accepts]: Start accepts. Automaton has 26890 states and 95406 transitions. Word has length 5 [2019-12-27 17:49:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:48,618 INFO L462 AbstractCegarLoop]: Abstraction has 26890 states and 95406 transitions. [2019-12-27 17:49:48,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:49:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 26890 states and 95406 transitions. [2019-12-27 17:49:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:49:48,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:48,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:48,625 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:48,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1135413059, now seen corresponding path program 1 times [2019-12-27 17:49:48,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:48,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735681656] [2019-12-27 17:49:48,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:48,760 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 17:49:48,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735681656] [2019-12-27 17:49:48,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:48,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:49:48,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339866422] [2019-12-27 17:49:48,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:48,763 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:48,768 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:49:48,768 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:48,805 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:49:48,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:49:48,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:48,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:49:48,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:49:48,807 INFO L87 Difference]: Start difference. First operand 26890 states and 95406 transitions. Second operand 5 states. [2019-12-27 17:49:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:49,828 INFO L93 Difference]: Finished difference Result 43282 states and 146547 transitions. [2019-12-27 17:49:49,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:49:49,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 17:49:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:50,004 INFO L225 Difference]: With dead ends: 43282 [2019-12-27 17:49:50,004 INFO L226 Difference]: Without dead ends: 43275 [2019-12-27 17:49:50,005 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 17:49:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2019-12-27 17:49:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 41962. [2019-12-27 17:49:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41962 states. [2019-12-27 17:49:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41962 states to 41962 states and 143055 transitions. [2019-12-27 17:49:53,102 INFO L78 Accepts]: Start accepts. Automaton has 41962 states and 143055 transitions. Word has length 11 [2019-12-27 17:49:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:53,102 INFO L462 AbstractCegarLoop]: Abstraction has 41962 states and 143055 transitions. [2019-12-27 17:49:53,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:49:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 41962 states and 143055 transitions. [2019-12-27 17:49:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:49:53,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:53,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:49:53,106 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:53,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash -217981421, now seen corresponding path program 1 times [2019-12-27 17:49:53,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:53,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900035489] [2019-12-27 17:49:53,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:53,166 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 17:49:53,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900035489] [2019-12-27 17:49:53,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:53,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:49:53,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [652446310] [2019-12-27 17:49:53,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:53,169 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:53,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:49:53,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:53,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:49:53,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:49:53,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:53,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:49:53,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:49:53,171 INFO L87 Difference]: Start difference. First operand 41962 states and 143055 transitions. Second operand 4 states. [2019-12-27 17:49:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:53,685 INFO L93 Difference]: Finished difference Result 53078 states and 178895 transitions. [2019-12-27 17:49:53,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:49:53,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:49:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:53,858 INFO L225 Difference]: With dead ends: 53078 [2019-12-27 17:49:53,859 INFO L226 Difference]: Without dead ends: 53078 [2019-12-27 17:49:53,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:49:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53078 states. [2019-12-27 17:49:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53078 to 47600. [2019-12-27 17:49:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47600 states. [2019-12-27 17:49:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47600 states to 47600 states and 161707 transitions. [2019-12-27 17:49:58,235 INFO L78 Accepts]: Start accepts. Automaton has 47600 states and 161707 transitions. Word has length 11 [2019-12-27 17:49:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:49:58,235 INFO L462 AbstractCegarLoop]: Abstraction has 47600 states and 161707 transitions. [2019-12-27 17:49:58,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:49:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 47600 states and 161707 transitions. [2019-12-27 17:49:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:49:58,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:49:58,241 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 17:49:58,241 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:49:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:49:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1239203888, now seen corresponding path program 1 times [2019-12-27 17:49:58,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:49:58,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444359773] [2019-12-27 17:49:58,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:49:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:49:58,345 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 17:49:58,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444359773] [2019-12-27 17:49:58,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:49:58,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:49:58,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1539409852] [2019-12-27 17:49:58,349 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:49:58,352 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:49:58,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 53 transitions. [2019-12-27 17:49:58,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:49:58,387 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:49:58,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:49:58,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:49:58,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:49:58,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:49:58,388 INFO L87 Difference]: Start difference. First operand 47600 states and 161707 transitions. Second operand 6 states. [2019-12-27 17:49:59,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:49:59,344 INFO L93 Difference]: Finished difference Result 63010 states and 210076 transitions. [2019-12-27 17:49:59,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:49:59,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 17:49:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:49:59,450 INFO L225 Difference]: With dead ends: 63010 [2019-12-27 17:49:59,451 INFO L226 Difference]: Without dead ends: 63003 [2019-12-27 17:49:59,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:50:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63003 states. [2019-12-27 17:50:00,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63003 to 47611. [2019-12-27 17:50:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47611 states. [2019-12-27 17:50:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 161609 transitions. [2019-12-27 17:50:00,991 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 161609 transitions. Word has length 17 [2019-12-27 17:50:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:00,991 INFO L462 AbstractCegarLoop]: Abstraction has 47611 states and 161609 transitions. [2019-12-27 17:50:00,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:50:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 161609 transitions. [2019-12-27 17:50:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:50:01,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:01,015 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] [2019-12-27 17:50:01,015 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1918132910, now seen corresponding path program 1 times [2019-12-27 17:50:01,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:01,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797711057] [2019-12-27 17:50:01,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:01,355 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2019-12-27 17:50:01,357 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 17:50:01,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797711057] [2019-12-27 17:50:01,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:01,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:01,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1492117450] [2019-12-27 17:50:01,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:01,362 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:01,366 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:50:01,366 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:01,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:01,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:50:01,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:01,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:50:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:50:01,368 INFO L87 Difference]: Start difference. First operand 47611 states and 161609 transitions. Second operand 4 states. [2019-12-27 17:50:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:01,412 INFO L93 Difference]: Finished difference Result 5620 states and 14074 transitions. [2019-12-27 17:50:01,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:50:01,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 17:50:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:01,419 INFO L225 Difference]: With dead ends: 5620 [2019-12-27 17:50:01,419 INFO L226 Difference]: Without dead ends: 4725 [2019-12-27 17:50:01,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-12-27 17:50:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4725. [2019-12-27 17:50:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-27 17:50:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 11319 transitions. [2019-12-27 17:50:01,484 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 11319 transitions. Word has length 25 [2019-12-27 17:50:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:01,484 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 11319 transitions. [2019-12-27 17:50:01,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:50:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 11319 transitions. [2019-12-27 17:50:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 17:50:01,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:01,489 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] [2019-12-27 17:50:01,489 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:01,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:01,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2102045766, now seen corresponding path program 1 times [2019-12-27 17:50:01,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:01,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955141251] [2019-12-27 17:50:01,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:01,598 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 17:50:01,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955141251] [2019-12-27 17:50:01,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:01,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:50:01,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369453693] [2019-12-27 17:50:01,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:01,608 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:01,623 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 85 transitions. [2019-12-27 17:50:01,624 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:01,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:50:01,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:50:01,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:01,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:50:01,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:50:01,642 INFO L87 Difference]: Start difference. First operand 4725 states and 11319 transitions. Second operand 6 states. [2019-12-27 17:50:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:01,689 INFO L93 Difference]: Finished difference Result 1095 states and 2326 transitions. [2019-12-27 17:50:01,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:50:01,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 17:50:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:01,691 INFO L225 Difference]: With dead ends: 1095 [2019-12-27 17:50:01,691 INFO L226 Difference]: Without dead ends: 991 [2019-12-27 17:50:01,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:50:01,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-27 17:50:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-12-27 17:50:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-12-27 17:50:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2023 transitions. [2019-12-27 17:50:01,702 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2023 transitions. Word has length 37 [2019-12-27 17:50:01,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:01,703 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2023 transitions. [2019-12-27 17:50:01,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:50:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2023 transitions. [2019-12-27 17:50:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 17:50:01,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:01,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:01,706 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:01,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:01,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1081276424, now seen corresponding path program 1 times [2019-12-27 17:50:01,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:01,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657807058] [2019-12-27 17:50:01,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:01,871 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 17:50:01,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657807058] [2019-12-27 17:50:01,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:01,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:50:01,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [801030188] [2019-12-27 17:50:01,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:01,894 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:01,963 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 184 transitions. [2019-12-27 17:50:01,963 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:02,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:50:02,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:50:02,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:02,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:50:02,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:50:02,002 INFO L87 Difference]: Start difference. First operand 949 states and 2023 transitions. Second operand 6 states. [2019-12-27 17:50:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:02,604 INFO L93 Difference]: Finished difference Result 1405 states and 2968 transitions. [2019-12-27 17:50:02,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:50:02,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 17:50:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:02,606 INFO L225 Difference]: With dead ends: 1405 [2019-12-27 17:50:02,606 INFO L226 Difference]: Without dead ends: 1405 [2019-12-27 17:50:02,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:50:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-27 17:50:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1132. [2019-12-27 17:50:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-27 17:50:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2413 transitions. [2019-12-27 17:50:02,622 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2413 transitions. Word has length 68 [2019-12-27 17:50:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:02,625 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 2413 transitions. [2019-12-27 17:50:02,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:50:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2413 transitions. [2019-12-27 17:50:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 17:50:02,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:02,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:02,628 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:02,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash 188736084, now seen corresponding path program 2 times [2019-12-27 17:50:02,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:02,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074906789] [2019-12-27 17:50:02,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:02,748 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 17:50:02,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074906789] [2019-12-27 17:50:02,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:02,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:50:02,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1618004521] [2019-12-27 17:50:02,751 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:02,772 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:02,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 127 transitions. [2019-12-27 17:50:02,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:02,816 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:02,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:02,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:02,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:02,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:02,817 INFO L87 Difference]: Start difference. First operand 1132 states and 2413 transitions. Second operand 3 states. [2019-12-27 17:50:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:02,834 INFO L93 Difference]: Finished difference Result 963 states and 2007 transitions. [2019-12-27 17:50:02,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:02,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-27 17:50:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:02,836 INFO L225 Difference]: With dead ends: 963 [2019-12-27 17:50:02,836 INFO L226 Difference]: Without dead ends: 963 [2019-12-27 17:50:02,836 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 17:50:02,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-27 17:50:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2019-12-27 17:50:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-27 17:50:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2007 transitions. [2019-12-27 17:50:02,845 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2007 transitions. Word has length 68 [2019-12-27 17:50:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:02,845 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 2007 transitions. [2019-12-27 17:50:02,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:50:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2007 transitions. [2019-12-27 17:50:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 17:50:02,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:02,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:02,847 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash 788994926, now seen corresponding path program 1 times [2019-12-27 17:50:02,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:02,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814429296] [2019-12-27 17:50:02,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:02,946 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 17:50:02,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814429296] [2019-12-27 17:50:02,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:02,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:50:02,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153031667] [2019-12-27 17:50:02,948 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:02,971 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:03,074 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 185 transitions. [2019-12-27 17:50:03,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:03,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:50:03,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:50:03,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:03,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:50:03,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:03,077 INFO L87 Difference]: Start difference. First operand 963 states and 2007 transitions. Second operand 5 states. [2019-12-27 17:50:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:03,277 INFO L93 Difference]: Finished difference Result 1101 states and 2255 transitions. [2019-12-27 17:50:03,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:50:03,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 17:50:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:03,279 INFO L225 Difference]: With dead ends: 1101 [2019-12-27 17:50:03,279 INFO L226 Difference]: Without dead ends: 1101 [2019-12-27 17:50:03,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:50:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-12-27 17:50:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1048. [2019-12-27 17:50:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-12-27 17:50:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2161 transitions. [2019-12-27 17:50:03,289 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2161 transitions. Word has length 69 [2019-12-27 17:50:03,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:03,289 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 2161 transitions. [2019-12-27 17:50:03,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:50:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2161 transitions. [2019-12-27 17:50:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 17:50:03,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:03,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:03,291 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:03,292 INFO L82 PathProgramCache]: Analyzing trace with hash -103545414, now seen corresponding path program 2 times [2019-12-27 17:50:03,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:03,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420733467] [2019-12-27 17:50:03,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:03,370 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 17:50:03,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420733467] [2019-12-27 17:50:03,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:03,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:50:03,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258395751] [2019-12-27 17:50:03,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:03,394 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:03,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 128 transitions. [2019-12-27 17:50:03,455 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:03,456 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:03,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:03,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:03,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:03,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:03,457 INFO L87 Difference]: Start difference. First operand 1048 states and 2161 transitions. Second operand 3 states. [2019-12-27 17:50:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:03,501 INFO L93 Difference]: Finished difference Result 1047 states and 2159 transitions. [2019-12-27 17:50:03,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:03,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-27 17:50:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:03,503 INFO L225 Difference]: With dead ends: 1047 [2019-12-27 17:50:03,503 INFO L226 Difference]: Without dead ends: 1047 [2019-12-27 17:50:03,504 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 17:50:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-12-27 17:50:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 962. [2019-12-27 17:50:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-12-27 17:50:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2005 transitions. [2019-12-27 17:50:03,515 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2005 transitions. Word has length 69 [2019-12-27 17:50:03,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:03,516 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 2005 transitions. [2019-12-27 17:50:03,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:50:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2005 transitions. [2019-12-27 17:50:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 17:50:03,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:03,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:03,518 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:03,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:03,519 INFO L82 PathProgramCache]: Analyzing trace with hash -8712508, now seen corresponding path program 1 times [2019-12-27 17:50:03,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:03,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464115367] [2019-12-27 17:50:03,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:03,674 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 17:50:03,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464115367] [2019-12-27 17:50:03,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:03,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:50:03,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1756204585] [2019-12-27 17:50:03,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:03,709 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:03,807 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 186 transitions. [2019-12-27 17:50:03,808 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:03,828 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:50:03,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:50:03,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:03,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:50:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:50:03,829 INFO L87 Difference]: Start difference. First operand 962 states and 2005 transitions. Second operand 8 states. [2019-12-27 17:50:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:04,312 INFO L93 Difference]: Finished difference Result 1541 states and 3164 transitions. [2019-12-27 17:50:04,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:50:04,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-12-27 17:50:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:04,314 INFO L225 Difference]: With dead ends: 1541 [2019-12-27 17:50:04,314 INFO L226 Difference]: Without dead ends: 1541 [2019-12-27 17:50:04,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:50:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2019-12-27 17:50:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1250. [2019-12-27 17:50:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-12-27 17:50:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 2585 transitions. [2019-12-27 17:50:04,332 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 2585 transitions. Word has length 70 [2019-12-27 17:50:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:04,332 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 2585 transitions. [2019-12-27 17:50:04,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:50:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 2585 transitions. [2019-12-27 17:50:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 17:50:04,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:04,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:04,335 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:04,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1101243862, now seen corresponding path program 2 times [2019-12-27 17:50:04,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:04,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197332527] [2019-12-27 17:50:04,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:04,460 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 17:50:04,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197332527] [2019-12-27 17:50:04,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:04,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:50:04,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2002627065] [2019-12-27 17:50:04,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:04,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:04,598 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 188 transitions. [2019-12-27 17:50:04,598 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:04,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:50:04,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:50:04,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:04,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:50:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:50:04,615 INFO L87 Difference]: Start difference. First operand 1250 states and 2585 transitions. Second operand 7 states. [2019-12-27 17:50:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:04,739 INFO L93 Difference]: Finished difference Result 1531 states and 3128 transitions. [2019-12-27 17:50:04,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:50:04,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-27 17:50:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:04,740 INFO L225 Difference]: With dead ends: 1531 [2019-12-27 17:50:04,741 INFO L226 Difference]: Without dead ends: 248 [2019-12-27 17:50:04,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:50:04,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-27 17:50:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2019-12-27 17:50:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-27 17:50:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 377 transitions. [2019-12-27 17:50:04,744 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 377 transitions. Word has length 70 [2019-12-27 17:50:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:04,745 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 377 transitions. [2019-12-27 17:50:04,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:50:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 377 transitions. [2019-12-27 17:50:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 17:50:04,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:04,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:04,746 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash -642215500, now seen corresponding path program 1 times [2019-12-27 17:50:04,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:04,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688836867] [2019-12-27 17:50:04,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:50:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:50:04,864 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:50:04,864 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:50:04,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_155) (= v_~y~0_275 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30|) |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_174 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_865 0) (= 0 v_~y$w_buff0~0_221) (= v_~y$w_buff1~0_203 0) (= v_~y$r_buff0_thd0~0_374 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1719~0.base_30|) (= v_~y$r_buff1_thd0~0_352 0) (= v_~__unbuffered_p1_EBX~0_37 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1719~0.base_30| 4)) (= v_~y$mem_tmp~0_168 0) (= v_~y$w_buff1_used~0_515 0) (= 0 v_~y$r_buff1_thd2~0_343) (= 0 v_~__unbuffered_p1_EAX~0_60) (= 0 v_~y$r_buff0_thd2~0_460) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_236 0) (= v_~main$tmp_guard0~0_33 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_25 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30|) 0) (= v_~y$r_buff0_thd1~0_98 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_cnt~0_42) (= |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30| 1)) (= v_~main$tmp_guard1~0_40 0) (= v_~y$flush_delayed~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_125|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_59|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_33|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_168, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_98, ~y$flush_delayed~0=v_~y$flush_delayed~0_204, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_155, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_83|, ~y$w_buff1~0=v_~y$w_buff1~0_203, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_460, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~x~0=v_~x~0_25, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_865, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_22|, ~y$w_buff0~0=v_~y$w_buff0~0_221, ~y~0=v_~y~0_275, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_37, ULTIMATE.start_main_~#t1719~0.base=|v_ULTIMATE.start_main_~#t1719~0.base_30|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_~#t1719~0.offset=|v_ULTIMATE.start_main_~#t1719~0.offset_22|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_343, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_162|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_374, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_515} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1720~0.offset, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1720~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1719~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1719~0.offset, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:50:04,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13|) |v_ULTIMATE.start_main_~#t1720~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1720~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1720~0.base_13| 4)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1720~0.base_13|) (= (store |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13| 1) |v_#valid_26|) (= 0 |v_ULTIMATE.start_main_~#t1720~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_11|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1720~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1720~0.base] because there is no mapped edge [2019-12-27 17:50:04,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= 0 (mod v_~y$w_buff1_used~0_77 256)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= v_~y$w_buff0_used~0_156 1) (= v_~y$w_buff0~0_36 v_~y$w_buff1~0_27) (= 2 v_~y$w_buff0~0_35) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= v_~y$w_buff1_used~0_77 v_~y$w_buff0_used~0_157)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_27, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~y$w_buff0~0=v_~y$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:50:04,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L759-2-->L759-5: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1708726418 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1708726418 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite12_Out-1708726418| |P1Thread1of1ForFork1_#t~ite11_Out-1708726418|))) (or (and (not .cse0) (= ~y$w_buff0~0_In-1708726418 |P1Thread1of1ForFork1_#t~ite11_Out-1708726418|) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~y$w_buff1~0_In-1708726418 |P1Thread1of1ForFork1_#t~ite11_Out-1708726418|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1708726418, ~y$w_buff1~0=~y$w_buff1~0_In-1708726418, ~y$w_buff0~0=~y$w_buff0~0_In-1708726418, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1708726418} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1708726418, ~y$w_buff1~0=~y$w_buff1~0_In-1708726418, ~y$w_buff0~0=~y$w_buff0~0_In-1708726418, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1708726418, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1708726418|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1708726418|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:50:04,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_138 v_~y$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 17:50:04,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-2048850859 256)))) (or (and .cse0 (= ~y~0_In-2048850859 |P1Thread1of1ForFork1_#t~ite31_Out-2048850859|)) (and (= ~y$mem_tmp~0_In-2048850859 |P1Thread1of1ForFork1_#t~ite31_Out-2048850859|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2048850859, ~y$flush_delayed~0=~y$flush_delayed~0_In-2048850859, ~y~0=~y~0_In-2048850859} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2048850859, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-2048850859|, ~y$flush_delayed~0=~y$flush_delayed~0_In-2048850859, ~y~0=~y~0_In-2048850859} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 17:50:04,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In2002193646 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2002193646 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out2002193646| |P0Thread1of1ForFork0_#t~ite4_Out2002193646|))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out2002193646| ~y~0_In2002193646) .cse2) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out2002193646| ~y$w_buff1~0_In2002193646) (not .cse0) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2002193646, ~y$w_buff1~0=~y$w_buff1~0_In2002193646, ~y~0=~y~0_In2002193646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2002193646} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2002193646, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out2002193646|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out2002193646|, ~y$w_buff1~0=~y$w_buff1~0_In2002193646, ~y~0=~y~0_In2002193646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2002193646} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 17:50:04,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1652736214 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1652736214 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1652736214| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1652736214| ~y$w_buff0_used~0_In-1652736214) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1652736214, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1652736214} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1652736214|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1652736214, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1652736214} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:50:04,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L732-->L732-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-90503280 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-90503280 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-90503280 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-90503280 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-90503280|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-90503280 |P0Thread1of1ForFork0_#t~ite6_Out-90503280|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-90503280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-90503280, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-90503280, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-90503280} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-90503280|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-90503280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-90503280, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-90503280, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-90503280} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:50:04,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1315666651 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1315666651 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out1315666651| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1315666651 |P0Thread1of1ForFork0_#t~ite7_Out1315666651|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1315666651, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1315666651} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1315666651, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1315666651|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1315666651} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:50:04,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In2099938500 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In2099938500 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2099938500 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In2099938500 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out2099938500| ~y$r_buff1_thd1~0_In2099938500) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out2099938500| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2099938500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2099938500, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2099938500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2099938500} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2099938500, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2099938500, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2099938500|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2099938500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2099938500} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:50:04,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_141 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_141, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:50:04,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1851318649 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1851318649 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1851318649| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1851318649| ~y$w_buff0_used~0_In1851318649)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1851318649, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851318649} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1851318649, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851318649, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1851318649|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 17:50:04,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1835024096 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1835024096 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1835024096 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1835024096 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1835024096|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1835024096 |P1Thread1of1ForFork1_#t~ite35_Out1835024096|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1835024096, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1835024096, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1835024096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835024096} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1835024096, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1835024096, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1835024096, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1835024096|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835024096} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 17:50:04,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L777-->L778: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-991502460 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-991502460 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-991502460 ~y$r_buff0_thd2~0_Out-991502460)) (and (not .cse1) (= ~y$r_buff0_thd2~0_Out-991502460 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-991502460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-991502460} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-991502460, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-991502460, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-991502460|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 17:50:04,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-1524427063 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1524427063 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1524427063 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1524427063 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1524427063| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-1524427063 |P1Thread1of1ForFork1_#t~ite37_Out-1524427063|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1524427063, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1524427063, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1524427063, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1524427063} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1524427063, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1524427063, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1524427063, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1524427063|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1524427063} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:50:04,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_155 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_155, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:50:04,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_55 256)) (= (mod v_~y$w_buff0_used~0_124 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:50:04,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1154445002 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1154445002 256) 0))) (or (and (= ~y$w_buff1~0_In-1154445002 |ULTIMATE.start_main_#t~ite40_Out-1154445002|) (not .cse0) (not .cse1)) (and (= ~y~0_In-1154445002 |ULTIMATE.start_main_#t~ite40_Out-1154445002|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1154445002, ~y~0=~y~0_In-1154445002, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1154445002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1154445002} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1154445002|, ~y$w_buff1~0=~y$w_buff1~0_In-1154445002, ~y~0=~y~0_In-1154445002, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1154445002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1154445002} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:50:04,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 17:50:04,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1533704248 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1533704248 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1533704248 |ULTIMATE.start_main_#t~ite42_Out-1533704248|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1533704248|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1533704248, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1533704248} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1533704248, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1533704248, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1533704248|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:50:04,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2039445078 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2039445078 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In2039445078 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2039445078 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out2039445078| ~y$w_buff1_used~0_In2039445078) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out2039445078| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2039445078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2039445078, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2039445078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2039445078} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2039445078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2039445078, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2039445078|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2039445078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2039445078} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 17:50:04,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In142156890 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In142156890 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In142156890 |ULTIMATE.start_main_#t~ite44_Out142156890|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out142156890|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In142156890, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In142156890} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In142156890, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In142156890, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out142156890|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:50:04,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-2097358670 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-2097358670 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2097358670 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2097358670 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-2097358670| ~y$r_buff1_thd0~0_In-2097358670) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-2097358670|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2097358670, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2097358670, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2097358670, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2097358670} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2097358670, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2097358670, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2097358670, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2097358670|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2097358670} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:50:04,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1267318363 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite68_Out-1267318363| ~y~0_In-1267318363)) (and (not .cse0) (= ~y$mem_tmp~0_In-1267318363 |ULTIMATE.start_main_#t~ite68_Out-1267318363|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1267318363, ~y$flush_delayed~0=~y$flush_delayed~0_In-1267318363, ~y~0=~y~0_In-1267318363} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1267318363, ~y$flush_delayed~0=~y$flush_delayed~0_In-1267318363, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1267318363|, ~y~0=~y~0_In-1267318363} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 17:50:04,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_262 |v_ULTIMATE.start_main_#t~ite68_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_189 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_189, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ~y~0=v_~y~0_262, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:50:04,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:50:04 BasicIcfg [2019-12-27 17:50:04,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:50:05,002 INFO L168 Benchmark]: Toolchain (without parser) took 29221.21 ms. Allocated memory was 145.8 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 100.5 MB in the beginning and 1.0 GB in the end (delta: -917.5 MB). Peak memory consumption was 559.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:05,004 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 17:50:05,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.00 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 156.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:05,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.44 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 153.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:05,007 INFO L168 Benchmark]: Boogie Preprocessor took 51.74 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:05,008 INFO L168 Benchmark]: RCFGBuilder took 837.79 ms. Allocated memory is still 203.9 MB. Free memory was 150.9 MB in the beginning and 94.6 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:05,009 INFO L168 Benchmark]: TraceAbstraction took 27477.64 ms. Allocated memory was 203.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 94.0 MB in the beginning and 1.0 GB in the end (delta: -924.0 MB). Peak memory consumption was 495.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:05,018 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.18 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.00 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 156.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.44 ms. Allocated memory is still 203.9 MB. Free memory was 156.8 MB in the beginning and 153.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.74 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.79 ms. Allocated memory is still 203.9 MB. Free memory was 150.9 MB in the beginning and 94.6 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27477.64 ms. Allocated memory was 203.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 94.0 MB in the beginning and 1.0 GB in the end (delta: -924.0 MB). Peak memory consumption was 495.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 189 ProgramPointsBefore, 112 ProgramPointsAfterwards, 244 TransitionsBefore, 137 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 55 ConcurrentYvCompositions, 33 ChoiceCompositions, 10314 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 142511 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1719, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t1720, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 x = 1 [L727] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 y$flush_delayed = weak$$choice2 [L815] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L817] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L818] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L819] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2479 SDtfs, 2109 SDslu, 4624 SDs, 0 SdLazy, 2252 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 35 SyntacticMatches, 13 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47611occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 22951 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 71757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...