/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:37:21,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:37:21,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:37:21,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:37:21,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:37:21,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:37:21,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:37:21,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:37:21,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:37:21,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:37:21,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:37:21,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:37:21,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:37:21,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:37:21,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:37:21,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:37:21,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:37:21,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:37:21,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:37:21,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:37:21,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:37:21,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:37:21,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:37:21,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:37:21,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:37:21,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:37:21,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:37:21,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:37:21,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:37:21,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:37:21,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:37:21,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:37:21,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:37:21,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:37:21,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:37:21,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:37:21,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:37:21,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:37:21,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:37:21,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:37:21,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:37:21,652 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:37:21,672 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:37:21,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:37:21,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:37:21,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:37:21,674 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:37:21,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:37:21,675 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:37:21,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:37:21,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:37:21,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:37:21,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:37:21,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:37:21,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:37:21,676 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:37:21,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:37:21,676 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:37:21,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:37:21,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:37:21,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:37:21,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:37:21,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:37:21,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:37:21,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:37:21,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:37:21,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:37:21,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:37:21,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:37:21,679 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:37:21,679 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:37:21,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:37:21,679 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:37:21,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:37:21,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:37:21,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:37:21,985 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:37:21,985 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:37:21,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.oepc.i [2020-10-22 00:37:22,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de42e09db/9326e34110544c389d152a242ab393c0/FLAGf795b5c04 [2020-10-22 00:37:22,578 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:37:22,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.oepc.i [2020-10-22 00:37:22,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de42e09db/9326e34110544c389d152a242ab393c0/FLAGf795b5c04 [2020-10-22 00:37:22,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de42e09db/9326e34110544c389d152a242ab393c0 [2020-10-22 00:37:22,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:37:22,882 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:37:22,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:37:22,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:37:22,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:37:22,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:37:22" (1/1) ... [2020-10-22 00:37:22,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207f4874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:22, skipping insertion in model container [2020-10-22 00:37:22,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:37:22" (1/1) ... [2020-10-22 00:37:22,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:37:22,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:37:23,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:37:23,457 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:37:23,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:37:23,633 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:37:23,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23 WrapperNode [2020-10-22 00:37:23,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:37:23,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:37:23,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:37:23,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:37:23,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23" (1/1) ... [2020-10-22 00:37:23,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23" (1/1) ... [2020-10-22 00:37:23,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:37:23,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:37:23,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:37:23,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:37:23,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23" (1/1) ... [2020-10-22 00:37:23,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23" (1/1) ... [2020-10-22 00:37:23,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23" (1/1) ... [2020-10-22 00:37:23,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23" (1/1) ... [2020-10-22 00:37:23,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23" (1/1) ... [2020-10-22 00:37:23,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23" (1/1) ... [2020-10-22 00:37:23,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23" (1/1) ... [2020-10-22 00:37:23,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:37:23,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:37:23,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:37:23,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:37:23,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23" (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 [2020-10-22 00:37:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-22 00:37:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:37:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:37:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:37:23,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:37:23,867 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:37:23,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:37:23,868 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:37:23,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:37:23,868 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:37:23,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:37:23,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:37:23,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:37:23,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:37:23,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:37:23,872 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:37:26,730 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:37:26,731 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-22 00:37:26,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:37:26 BoogieIcfgContainer [2020-10-22 00:37:26,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:37:26,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:37:26,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:37:26,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:37:26,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:37:22" (1/3) ... [2020-10-22 00:37:26,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29322712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:37:26, skipping insertion in model container [2020-10-22 00:37:26,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:37:23" (2/3) ... [2020-10-22 00:37:26,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29322712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:37:26, skipping insertion in model container [2020-10-22 00:37:26,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:37:26" (3/3) ... [2020-10-22 00:37:26,753 INFO L111 eAbstractionObserver]: Analyzing ICFG safe020_rmo.oepc.i [2020-10-22 00:37:26,766 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:37:26,766 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:37:26,777 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-22 00:37:26,778 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:37:26,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,836 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,837 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,851 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,851 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,854 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,855 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,879 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,879 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,887 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,888 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,896 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,897 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:37:26,903 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:37:26,919 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-22 00:37:26,943 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:37:26,943 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:37:26,943 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:37:26,943 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:37:26,943 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:37:26,943 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:37:26,944 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:37:26,944 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:37:26,966 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:37:26,967 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 116 transitions, 247 flow [2020-10-22 00:37:26,970 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 116 transitions, 247 flow [2020-10-22 00:37:26,972 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 247 flow [2020-10-22 00:37:27,062 INFO L129 PetriNetUnfolder]: 3/113 cut-off events. [2020-10-22 00:37:27,063 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:37:27,076 INFO L80 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-22 00:37:27,083 INFO L116 LiptonReduction]: Number of co-enabled transitions 1562 [2020-10-22 00:37:29,288 WARN L193 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-10-22 00:37:29,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-22 00:37:29,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:37:30,027 WARN L193 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-22 00:37:30,453 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-22 00:37:30,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-22 00:37:30,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:37:30,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 00:37:30,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:37:30,571 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-22 00:37:32,773 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-22 00:37:32,971 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 00:37:33,683 WARN L193 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 157 [2020-10-22 00:37:34,044 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2020-10-22 00:37:34,052 INFO L131 LiptonReduction]: Checked pairs total: 4218 [2020-10-22 00:37:34,052 INFO L133 LiptonReduction]: Total number of compositions: 106 [2020-10-22 00:37:34,060 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 65 flow [2020-10-22 00:37:34,098 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 522 states. [2020-10-22 00:37:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states. [2020-10-22 00:37:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:37:34,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:34,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:34,111 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:34,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:34,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1856140590, now seen corresponding path program 1 times [2020-10-22 00:37:34,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:34,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911194077] [2020-10-22 00:37:34,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:37:34,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911194077] [2020-10-22 00:37:34,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:34,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:37:34,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1868375639] [2020-10-22 00:37:34,363 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:34,367 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:34,393 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:37:34,393 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:34,397 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:37:34,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-22 00:37:34,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:34,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-22 00:37:34,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-22 00:37:34,411 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 2 states. [2020-10-22 00:37:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:34,438 INFO L93 Difference]: Finished difference Result 522 states and 1600 transitions. [2020-10-22 00:37:34,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-22 00:37:34,439 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-10-22 00:37:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:34,459 INFO L225 Difference]: With dead ends: 522 [2020-10-22 00:37:34,460 INFO L226 Difference]: Without dead ends: 442 [2020-10-22 00:37:34,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-22 00:37:34,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-22 00:37:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-22 00:37:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-22 00:37:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1336 transitions. [2020-10-22 00:37:34,579 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1336 transitions. Word has length 9 [2020-10-22 00:37:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:34,580 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1336 transitions. [2020-10-22 00:37:34,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-22 00:37:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1336 transitions. [2020-10-22 00:37:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:37:34,583 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:34,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:34,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:37:34,584 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:34,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1705201291, now seen corresponding path program 1 times [2020-10-22 00:37:34,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:34,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491090549] [2020-10-22 00:37:34,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:37:34,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491090549] [2020-10-22 00:37:34,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:34,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:37:34,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [820619629] [2020-10-22 00:37:34,799 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:34,801 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:34,803 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 00:37:34,803 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:34,804 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:37:34,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:37:34,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:34,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:37:34,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:37:34,806 INFO L87 Difference]: Start difference. First operand 442 states and 1336 transitions. Second operand 5 states. [2020-10-22 00:37:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:34,866 INFO L93 Difference]: Finished difference Result 490 states and 1424 transitions. [2020-10-22 00:37:34,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:37:34,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-22 00:37:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:34,871 INFO L225 Difference]: With dead ends: 490 [2020-10-22 00:37:34,871 INFO L226 Difference]: Without dead ends: 410 [2020-10-22 00:37:34,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:37:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-10-22 00:37:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2020-10-22 00:37:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-22 00:37:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1224 transitions. [2020-10-22 00:37:34,899 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1224 transitions. Word has length 10 [2020-10-22 00:37:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:34,900 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1224 transitions. [2020-10-22 00:37:34,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:37:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1224 transitions. [2020-10-22 00:37:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:37:34,902 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:34,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:34,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:37:34,903 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:34,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1321648060, now seen corresponding path program 1 times [2020-10-22 00:37:34,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:34,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864828441] [2020-10-22 00:37:34,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:37:35,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864828441] [2020-10-22 00:37:35,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:35,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:37:35,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1157837335] [2020-10-22 00:37:35,012 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:35,014 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:35,016 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 00:37:35,016 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:35,017 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:37:35,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:37:35,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:35,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:37:35,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:37:35,018 INFO L87 Difference]: Start difference. First operand 410 states and 1224 transitions. Second operand 4 states. [2020-10-22 00:37:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:35,044 INFO L93 Difference]: Finished difference Result 466 states and 1342 transitions. [2020-10-22 00:37:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:37:35,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 00:37:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:35,048 INFO L225 Difference]: With dead ends: 466 [2020-10-22 00:37:35,049 INFO L226 Difference]: Without dead ends: 402 [2020-10-22 00:37:35,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:37:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-10-22 00:37:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2020-10-22 00:37:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-10-22 00:37:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1194 transitions. [2020-10-22 00:37:35,066 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1194 transitions. Word has length 11 [2020-10-22 00:37:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:35,067 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 1194 transitions. [2020-10-22 00:37:35,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:37:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1194 transitions. [2020-10-22 00:37:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:37:35,069 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:35,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:35,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:37:35,070 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:35,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1199301264, now seen corresponding path program 1 times [2020-10-22 00:37:35,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:35,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954066588] [2020-10-22 00:37:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:37:35,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954066588] [2020-10-22 00:37:35,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:35,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:37:35,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [454007101] [2020-10-22 00:37:35,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:35,438 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:35,443 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 26 transitions. [2020-10-22 00:37:35,443 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:35,870 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:37:35,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:37:35,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:35,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:37:35,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:37:35,874 INFO L87 Difference]: Start difference. First operand 402 states and 1194 transitions. Second operand 7 states. [2020-10-22 00:37:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:36,188 INFO L93 Difference]: Finished difference Result 432 states and 1238 transitions. [2020-10-22 00:37:36,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:37:36,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-22 00:37:36,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:36,193 INFO L225 Difference]: With dead ends: 432 [2020-10-22 00:37:36,193 INFO L226 Difference]: Without dead ends: 372 [2020-10-22 00:37:36,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:37:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-10-22 00:37:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2020-10-22 00:37:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-10-22 00:37:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1090 transitions. [2020-10-22 00:37:36,208 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1090 transitions. Word has length 12 [2020-10-22 00:37:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:36,209 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 1090 transitions. [2020-10-22 00:37:36,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:37:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1090 transitions. [2020-10-22 00:37:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:37:36,214 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:36,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:36,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:37:36,218 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:36,218 INFO L82 PathProgramCache]: Analyzing trace with hash -932428959, now seen corresponding path program 1 times [2020-10-22 00:37:36,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:36,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469028883] [2020-10-22 00:37:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:37:36,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469028883] [2020-10-22 00:37:36,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:36,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:37:36,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [84531917] [2020-10-22 00:37:36,381 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:36,383 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:36,387 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-10-22 00:37:36,387 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:36,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:37:36,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:37:36,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:36,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:37:36,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:37:36,501 INFO L87 Difference]: Start difference. First operand 372 states and 1090 transitions. Second operand 4 states. [2020-10-22 00:37:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:36,554 INFO L93 Difference]: Finished difference Result 348 states and 894 transitions. [2020-10-22 00:37:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:37:36,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-22 00:37:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:36,556 INFO L225 Difference]: With dead ends: 348 [2020-10-22 00:37:36,557 INFO L226 Difference]: Without dead ends: 268 [2020-10-22 00:37:36,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:37:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-10-22 00:37:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2020-10-22 00:37:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-10-22 00:37:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 674 transitions. [2020-10-22 00:37:36,602 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 674 transitions. Word has length 13 [2020-10-22 00:37:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:36,602 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 674 transitions. [2020-10-22 00:37:36,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:37:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 674 transitions. [2020-10-22 00:37:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:37:36,604 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:36,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:36,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:37:36,604 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:36,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:36,605 INFO L82 PathProgramCache]: Analyzing trace with hash -401761040, now seen corresponding path program 1 times [2020-10-22 00:37:36,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:36,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954058943] [2020-10-22 00:37:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:37:36,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954058943] [2020-10-22 00:37:36,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:36,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:37:36,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1013856359] [2020-10-22 00:37:36,779 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:36,782 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:36,788 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 25 transitions. [2020-10-22 00:37:36,788 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:36,864 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7253#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:37:36,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:37:36,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:36,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:37:36,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:37:36,865 INFO L87 Difference]: Start difference. First operand 268 states and 674 transitions. Second operand 6 states. [2020-10-22 00:37:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:36,922 INFO L93 Difference]: Finished difference Result 206 states and 465 transitions. [2020-10-22 00:37:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:37:36,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 00:37:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:36,923 INFO L225 Difference]: With dead ends: 206 [2020-10-22 00:37:36,924 INFO L226 Difference]: Without dead ends: 162 [2020-10-22 00:37:36,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:37:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-22 00:37:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-22 00:37:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-22 00:37:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 356 transitions. [2020-10-22 00:37:36,930 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 356 transitions. Word has length 15 [2020-10-22 00:37:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:36,930 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 356 transitions. [2020-10-22 00:37:36,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:37:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 356 transitions. [2020-10-22 00:37:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 00:37:36,931 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:36,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:36,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:37:36,932 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:36,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1254100355, now seen corresponding path program 1 times [2020-10-22 00:37:36,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:36,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622052185] [2020-10-22 00:37:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:37:37,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622052185] [2020-10-22 00:37:37,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:37,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:37:37,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [138886796] [2020-10-22 00:37:37,070 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:37,076 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:37,090 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 33 transitions. [2020-10-22 00:37:37,091 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:37,189 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7792#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:37:37,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:37:37,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:37,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:37:37,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:37:37,191 INFO L87 Difference]: Start difference. First operand 162 states and 356 transitions. Second operand 7 states. [2020-10-22 00:37:37,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:37,252 INFO L93 Difference]: Finished difference Result 137 states and 304 transitions. [2020-10-22 00:37:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:37:37,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-22 00:37:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:37,254 INFO L225 Difference]: With dead ends: 137 [2020-10-22 00:37:37,254 INFO L226 Difference]: Without dead ends: 126 [2020-10-22 00:37:37,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:37:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-22 00:37:37,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2020-10-22 00:37:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-22 00:37:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 284 transitions. [2020-10-22 00:37:37,259 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 284 transitions. Word has length 17 [2020-10-22 00:37:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:37,259 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 284 transitions. [2020-10-22 00:37:37,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:37:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 284 transitions. [2020-10-22 00:37:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:37:37,260 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:37,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:37,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:37:37,261 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:37,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:37,261 INFO L82 PathProgramCache]: Analyzing trace with hash -55948414, now seen corresponding path program 1 times [2020-10-22 00:37:37,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:37,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344248691] [2020-10-22 00:37:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:37:37,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344248691] [2020-10-22 00:37:37,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:37,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:37:37,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [34844788] [2020-10-22 00:37:37,335 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:37,340 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:37,353 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2020-10-22 00:37:37,353 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:37,419 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:37:37,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:37:37,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:37,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:37:37,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:37:37,421 INFO L87 Difference]: Start difference. First operand 126 states and 284 transitions. Second operand 4 states. [2020-10-22 00:37:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:37,444 INFO L93 Difference]: Finished difference Result 165 states and 362 transitions. [2020-10-22 00:37:37,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:37:37,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-22 00:37:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:37,446 INFO L225 Difference]: With dead ends: 165 [2020-10-22 00:37:37,446 INFO L226 Difference]: Without dead ends: 72 [2020-10-22 00:37:37,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:37:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-22 00:37:37,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-22 00:37:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-22 00:37:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 140 transitions. [2020-10-22 00:37:37,450 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 140 transitions. Word has length 20 [2020-10-22 00:37:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:37,450 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 140 transitions. [2020-10-22 00:37:37,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:37:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 140 transitions. [2020-10-22 00:37:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:37:37,451 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:37,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:37,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:37:37,451 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:37,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:37,451 INFO L82 PathProgramCache]: Analyzing trace with hash 229615954, now seen corresponding path program 2 times [2020-10-22 00:37:37,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:37,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28214761] [2020-10-22 00:37:37,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:37:37,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28214761] [2020-10-22 00:37:37,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:37,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:37:37,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [607647902] [2020-10-22 00:37:37,704 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:37,708 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:37,726 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 65 transitions. [2020-10-22 00:37:37,726 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:37,882 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-10-22 00:37:37,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:37,884 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-10-22 00:37:37,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:37,887 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:37:37,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:37,891 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:37:37,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:37,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:37,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:37,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:37,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:37,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:37,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:37:37,926 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:37:37,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:37,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:37,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:37,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:37,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:37,965 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:37:37,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:37,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:37,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:37,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:37,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:37,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,014 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:37:38,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:37:38,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,085 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:37:38,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,107 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:37:38,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,126 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:37:38,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:37:38,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:37:38,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,337 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:37:38,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:38,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:37:38,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:37:38,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:38,581 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:37:38,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:38,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:38,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 00:37:38,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:38,759 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:37:38,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:38,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:39,180 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-10-22 00:37:39,397 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 36 [2020-10-22 00:37:39,564 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 27 [2020-10-22 00:37:39,669 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2020-10-22 00:37:39,786 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 18 [2020-10-22 00:37:39,843 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8507#(and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd0~0) (or (= ~__unbuffered_p2_EAX~0 0) (= ~__unbuffered_p2_EAX~0 ~x$w_buff1~0) (= (mod ~x$r_buff1_thd3~0 256) 0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (or (= ~__unbuffered_p2_EAX~0 0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0)) (or (= ~__unbuffered_p2_EAX~0 0) (= (mod ~x$r_buff0_thd3~0 256) 0) (= ~__unbuffered_p2_EAX~0 ~x$w_buff0~0)) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0))] [2020-10-22 00:37:39,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:37:39,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:39,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:37:39,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:37:39,844 INFO L87 Difference]: Start difference. First operand 72 states and 140 transitions. Second operand 9 states. [2020-10-22 00:37:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:40,241 INFO L93 Difference]: Finished difference Result 114 states and 223 transitions. [2020-10-22 00:37:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:37:40,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-22 00:37:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:40,243 INFO L225 Difference]: With dead ends: 114 [2020-10-22 00:37:40,243 INFO L226 Difference]: Without dead ends: 79 [2020-10-22 00:37:40,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:37:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-22 00:37:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2020-10-22 00:37:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-22 00:37:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 128 transitions. [2020-10-22 00:37:40,247 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 128 transitions. Word has length 20 [2020-10-22 00:37:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:40,247 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 128 transitions. [2020-10-22 00:37:40,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:37:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 128 transitions. [2020-10-22 00:37:40,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:37:40,248 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:40,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:40,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:37:40,249 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:40,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:40,249 INFO L82 PathProgramCache]: Analyzing trace with hash -79065646, now seen corresponding path program 3 times [2020-10-22 00:37:40,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:40,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142612919] [2020-10-22 00:37:40,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:37:40,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142612919] [2020-10-22 00:37:40,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:40,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-22 00:37:40,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1085321061] [2020-10-22 00:37:40,786 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:40,790 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:40,801 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-10-22 00:37:40,801 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:40,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:40,828 INFO L603 QuantifierPusher]: Distributing 10 disjuncts over 2 conjuncts [2020-10-22 00:37:40,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:40,833 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:37:40,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:40,835 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:37:40,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:37:40,836 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 10, 5, 2, 4, 2, 1] term [2020-10-22 00:37:40,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:40,838 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 11, 2, 3, 2, 1] term [2020-10-22 00:37:40,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:37:40,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:40,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 00:37:40,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 00:37:40,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:40,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:40,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:40,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:37:40,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 00:37:40,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 00:37:40,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:40,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:40,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:40,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:37:40,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:40,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:40,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:40,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:37:40,938 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:37:40,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:40,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:40,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:40,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,968 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 11, 2, 3, 2, 1] term [2020-10-22 00:37:40,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:37:40,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:40,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:41,279 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2020-10-22 00:37:41,325 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8770#(and (or (= (mod ~x$r_buff0_thd3~0 256) 0) (= ~__unbuffered_p2_EAX~0 ~x$w_buff0~0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (= ~x$r_buff1_thd2~0 0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (<= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256))) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (not (= ~x$w_buff0~0 1)))] [2020-10-22 00:37:41,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:37:41,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:41,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:37:41,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:37:41,326 INFO L87 Difference]: Start difference. First operand 66 states and 128 transitions. Second operand 11 states. [2020-10-22 00:37:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:41,729 INFO L93 Difference]: Finished difference Result 94 states and 182 transitions. [2020-10-22 00:37:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:37:41,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-10-22 00:37:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:41,731 INFO L225 Difference]: With dead ends: 94 [2020-10-22 00:37:41,731 INFO L226 Difference]: Without dead ends: 73 [2020-10-22 00:37:41,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:37:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-22 00:37:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-22 00:37:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-22 00:37:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 143 transitions. [2020-10-22 00:37:41,735 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 143 transitions. Word has length 20 [2020-10-22 00:37:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:41,735 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 143 transitions. [2020-10-22 00:37:41,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:37:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 143 transitions. [2020-10-22 00:37:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:37:41,736 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:41,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:41,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:37:41,737 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:41,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2081305744, now seen corresponding path program 4 times [2020-10-22 00:37:41,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:41,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900075080] [2020-10-22 00:37:41,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:37:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:37:41,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900075080] [2020-10-22 00:37:41,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:37:41,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:37:41,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1775809627] [2020-10-22 00:37:41,960 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:37:41,965 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:37:41,979 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-10-22 00:37:41,979 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:37:41,997 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 2, 3, 2, 1] term [2020-10-22 00:37:41,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:41,999 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-10-22 00:37:41,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:42,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:37:42,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:42,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:37:42,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:42,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:42,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:42,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:42,012 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:37:42,013 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:37:42,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:42,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:42,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:42,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:42,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:37:42,041 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:37:42,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:42,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:42,049 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:37:42,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:42,055 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:37:42,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:42,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:42,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:42,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:42,076 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:37:42,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:42,087 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:37:42,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:42,095 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:37:42,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:37:42,104 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 5, 2, 4, 2, 1] term [2020-10-22 00:37:42,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:37:42,332 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 23 [2020-10-22 00:37:42,349 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9028#(and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0)) (= (mod ~x$r_buff1_thd3~0 256) 0))] [2020-10-22 00:37:42,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 00:37:42,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:37:42,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 00:37:42,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:37:42,351 INFO L87 Difference]: Start difference. First operand 73 states and 143 transitions. Second operand 10 states. [2020-10-22 00:37:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:37:42,606 INFO L93 Difference]: Finished difference Result 94 states and 179 transitions. [2020-10-22 00:37:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:37:42,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-22 00:37:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:37:42,608 INFO L225 Difference]: With dead ends: 94 [2020-10-22 00:37:42,608 INFO L226 Difference]: Without dead ends: 42 [2020-10-22 00:37:42,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-22 00:37:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-22 00:37:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-22 00:37:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-22 00:37:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 68 transitions. [2020-10-22 00:37:42,610 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 68 transitions. Word has length 20 [2020-10-22 00:37:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:37:42,610 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 68 transitions. [2020-10-22 00:37:42,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 00:37:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2020-10-22 00:37:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:37:42,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:37:42,611 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:37:42,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:37:42,612 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:37:42,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:37:42,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1143504162, now seen corresponding path program 5 times [2020-10-22 00:37:42,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:37:42,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701830641] [2020-10-22 00:37:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:37:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:37:42,685 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:37:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:37:42,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:37:42,800 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:37:42,800 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:37:42,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:37:42,854 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,855 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,855 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,855 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,856 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,856 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,856 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,857 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,857 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,857 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,857 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,857 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,857 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,858 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,858 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,859 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,859 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,859 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,860 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,860 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,861 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,861 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,861 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,862 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,862 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,862 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,863 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,863 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,863 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,866 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,866 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,866 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,867 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,867 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,869 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:37:42,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:37:42,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:37:42 BasicIcfg [2020-10-22 00:37:42,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:37:42,970 INFO L168 Benchmark]: Toolchain (without parser) took 20094.02 ms. Allocated memory was 138.9 MB in the beginning and 498.6 MB in the end (delta: 359.7 MB). Free memory was 100.8 MB in the beginning and 327.3 MB in the end (delta: -226.5 MB). Peak memory consumption was 133.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:42,974 INFO L168 Benchmark]: CDTParser took 3.02 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-22 00:37:42,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.55 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 99.9 MB in the beginning and 152.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:42,976 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.60 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:42,977 INFO L168 Benchmark]: Boogie Preprocessor took 47.85 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 147.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:42,977 INFO L168 Benchmark]: RCFGBuilder took 2949.12 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 147.9 MB in the beginning and 181.2 MB in the end (delta: -33.3 MB). Peak memory consumption was 109.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:42,978 INFO L168 Benchmark]: TraceAbstraction took 16228.27 ms. Allocated memory was 249.0 MB in the beginning and 498.6 MB in the end (delta: 249.6 MB). Free memory was 178.9 MB in the beginning and 327.3 MB in the end (delta: -148.4 MB). Peak memory consumption was 101.2 MB. Max. memory is 7.1 GB. [2020-10-22 00:37:42,988 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.02 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.55 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 99.9 MB in the beginning and 152.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 103.60 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.85 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 147.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2949.12 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 147.9 MB in the beginning and 181.2 MB in the end (delta: -33.3 MB). Peak memory consumption was 109.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16228.27 ms. Allocated memory was 249.0 MB in the beginning and 498.6 MB in the end (delta: 249.6 MB). Free memory was 178.9 MB in the beginning and 327.3 MB in the end (delta: -148.4 MB). Peak memory consumption was 101.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 783 VarBasedMoverChecksPositive, 29 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 47 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.0s, 123 PlacesBefore, 34 PlacesAfterwards, 116 TransitionsBefore, 25 TransitionsAfterwards, 1562 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 106 TotalNumberOfCompositions, 4218 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L811] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0) [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0 [L811] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0) [L811] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1) [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1 [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1) [L812] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L772] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L774] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L774] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L774] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe020_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 244 SDtfs, 265 SDslu, 536 SDs, 0 SdLazy, 385 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 34382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...