/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 22:09:34,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 22:09:34,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 22:09:34,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 22:09:34,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 22:09:34,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 22:09:34,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 22:09:34,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 22:09:34,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 22:09:34,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 22:09:34,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 22:09:34,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 22:09:34,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 22:09:34,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 22:09:34,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 22:09:34,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 22:09:34,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 22:09:34,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 22:09:34,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 22:09:34,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 22:09:34,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 22:09:34,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 22:09:34,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 22:09:34,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 22:09:34,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 22:09:34,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 22:09:34,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 22:09:34,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 22:09:34,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 22:09:34,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 22:09:34,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 22:09:34,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 22:09:34,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 22:09:34,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 22:09:34,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 22:09:34,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 22:09:34,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 22:09:34,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 22:09:34,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 22:09:34,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 22:09:34,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 22:09:34,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf [2021-07-09 22:09:34,754 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 22:09:34,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 22:09:34,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 22:09:34,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 22:09:34,756 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 22:09:34,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 22:09:34,756 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 22:09:34,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 22:09:34,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 22:09:34,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 22:09:34,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 22:09:34,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 22:09:34,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 22:09:34,757 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 22:09:34,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 22:09:34,757 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 22:09:34,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 22:09:34,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 22:09:34,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 22:09:34,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 22:09:34,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 22:09:34,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 22:09:34,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 22:09:34,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 22:09:34,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 22:09:34,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 22:09:34,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 22:09:34,759 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 22:09:34,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 22:09:34,759 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-07-09 22:09:34,759 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-07-09 22:09:35,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 22:09:35,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 22:09:35,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 22:09:35,108 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 22:09:35,108 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 22:09:35,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2021-07-09 22:09:35,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f470ccb5d/f735002ec21c453d9629180a5eeb42c9/FLAGc64357660 [2021-07-09 22:09:35,571 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 22:09:35,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2021-07-09 22:09:35,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f470ccb5d/f735002ec21c453d9629180a5eeb42c9/FLAGc64357660 [2021-07-09 22:09:35,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f470ccb5d/f735002ec21c453d9629180a5eeb42c9 [2021-07-09 22:09:35,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 22:09:35,915 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 22:09:35,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 22:09:35,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 22:09:35,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 22:09:35,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 10:09:35" (1/1) ... [2021-07-09 22:09:35,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23fcdb87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:35, skipping insertion in model container [2021-07-09 22:09:35,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 10:09:35" (1/1) ... [2021-07-09 22:09:35,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 22:09:35,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 22:09:36,168 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i[949,962] [2021-07-09 22:09:36,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 22:09:36,400 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 22:09:36,409 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i[949,962] [2021-07-09 22:09:36,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 22:09:36,491 INFO L208 MainTranslator]: Completed translation [2021-07-09 22:09:36,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36 WrapperNode [2021-07-09 22:09:36,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 22:09:36,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 22:09:36,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 22:09:36,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 22:09:36,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36" (1/1) ... [2021-07-09 22:09:36,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36" (1/1) ... [2021-07-09 22:09:36,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 22:09:36,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 22:09:36,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 22:09:36,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 22:09:36,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36" (1/1) ... [2021-07-09 22:09:36,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36" (1/1) ... [2021-07-09 22:09:36,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36" (1/1) ... [2021-07-09 22:09:36,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36" (1/1) ... [2021-07-09 22:09:36,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36" (1/1) ... [2021-07-09 22:09:36,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36" (1/1) ... [2021-07-09 22:09:36,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36" (1/1) ... [2021-07-09 22:09:36,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 22:09:36,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 22:09:36,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 22:09:36,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 22:09:36,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 22:09:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 22:09:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 22:09:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 22:09:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 22:09:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 22:09:36,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 22:09:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 22:09:36,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 22:09:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-09 22:09:36,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-09 22:09:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 22:09:36,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 22:09:36,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 22:09:36,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 22:09:36,715 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 22:09:38,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 22:09:38,699 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 22:09:38,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 10:09:38 BoogieIcfgContainer [2021-07-09 22:09:38,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 22:09:38,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 22:09:38,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 22:09:38,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 22:09:38,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 10:09:35" (1/3) ... [2021-07-09 22:09:38,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727a178d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 10:09:38, skipping insertion in model container [2021-07-09 22:09:38,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:09:36" (2/3) ... [2021-07-09 22:09:38,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727a178d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 10:09:38, skipping insertion in model container [2021-07-09 22:09:38,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 10:09:38" (3/3) ... [2021-07-09 22:09:38,711 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2021-07-09 22:09:38,718 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 22:09:38,718 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 22:09:38,718 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 22:09:38,719 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 22:09:38,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,758 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,758 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,758 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,758 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,762 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,763 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,763 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,764 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,764 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,764 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,764 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,765 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,769 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,769 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,769 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,769 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,800 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,800 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,800 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,805 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,806 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:09:38,808 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 22:09:38,828 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-09 22:09:38,843 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 22:09:38,843 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 22:09:38,843 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 22:09:38,843 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 22:09:38,843 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 22:09:38,844 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 22:09:38,844 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 22:09:38,844 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 22:09:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 9815 states, 8572 states have (on average 2.2914139057396175) internal successors, (19642), 9814 states have internal predecessors, (19642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-09 22:09:40,225 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:40,226 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:40,226 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:40,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:40,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1192679358, now seen corresponding path program 1 times [2021-07-09 22:09:40,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:40,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879672659] [2021-07-09 22:09:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:09:40,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:40,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:40,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:40,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:40,701 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:09:40,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:09:40,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:40,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:40,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:40,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:40,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:40,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:09:40,769 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:09:40,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879672659] [2021-07-09 22:09:40,770 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879672659] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:09:40,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:09:40,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:09:40,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58672270] [2021-07-09 22:09:40,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:09:40,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:09:40,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:09:40,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:09:40,830 INFO L87 Difference]: Start difference. First operand has 9815 states, 8572 states have (on average 2.2914139057396175) internal successors, (19642), 9814 states have internal predecessors, (19642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:09:41,110 INFO L93 Difference]: Finished difference Result 10823 states and 21540 transitions. [2021-07-09 22:09:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:09:41,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-07-09 22:09:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:09:41,159 INFO L225 Difference]: With dead ends: 10823 [2021-07-09 22:09:41,159 INFO L226 Difference]: Without dead ends: 4519 [2021-07-09 22:09:41,161 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 153.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:09:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2021-07-09 22:09:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4519. [2021-07-09 22:09:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4519 states, 4447 states have (on average 2.462109287159883) internal successors, (10949), 4518 states have internal predecessors, (10949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4519 states to 4519 states and 10949 transitions. [2021-07-09 22:09:41,420 INFO L78 Accepts]: Start accepts. Automaton has 4519 states and 10949 transitions. Word has length 67 [2021-07-09 22:09:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:09:41,421 INFO L482 AbstractCegarLoop]: Abstraction has 4519 states and 10949 transitions. [2021-07-09 22:09:41,422 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 4519 states and 10949 transitions. [2021-07-09 22:09:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-09 22:09:41,431 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:41,431 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:41,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 22:09:41,432 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:41,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:41,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1133217032, now seen corresponding path program 1 times [2021-07-09 22:09:41,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:41,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914442908] [2021-07-09 22:09:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:09:41,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:41,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:41,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:41,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:41,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:41,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:09:41,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:41,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-09 22:09:41,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:41,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-09 22:09:41,688 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-07-09 22:09:41,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-09 22:09:41,718 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:09:41,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:09:41,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:41,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:41,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:41,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:41,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:41,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:09:41,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:09:41,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914442908] [2021-07-09 22:09:41,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914442908] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:09:41,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:09:41,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 22:09:41,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427418451] [2021-07-09 22:09:41,779 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 22:09:41,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:09:41,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 22:09:41,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-09 22:09:41,780 INFO L87 Difference]: Start difference. First operand 4519 states and 10949 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:09:42,256 INFO L93 Difference]: Finished difference Result 5197 states and 13015 transitions. [2021-07-09 22:09:42,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-09 22:09:42,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-07-09 22:09:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:09:42,283 INFO L225 Difference]: With dead ends: 5197 [2021-07-09 22:09:42,283 INFO L226 Difference]: Without dead ends: 4345 [2021-07-09 22:09:42,289 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 318.0ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-07-09 22:09:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4345 states. [2021-07-09 22:09:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4345 to 4345. [2021-07-09 22:09:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 4273 states have (on average 2.4572899602153053) internal successors, (10500), 4344 states have internal predecessors, (10500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 10500 transitions. [2021-07-09 22:09:42,419 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 10500 transitions. Word has length 70 [2021-07-09 22:09:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:09:42,421 INFO L482 AbstractCegarLoop]: Abstraction has 4345 states and 10500 transitions. [2021-07-09 22:09:42,421 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 10500 transitions. [2021-07-09 22:09:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 22:09:42,430 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:42,430 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:42,430 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 22:09:42,430 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:42,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:42,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1508640764, now seen corresponding path program 1 times [2021-07-09 22:09:42,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:42,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257869570] [2021-07-09 22:09:42,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:09:42,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:42,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:42,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:42,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:42,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:42,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:42,601 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:09:42,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:09:42,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:42,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:42,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:42,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:42,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:42,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:09:42,656 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:09:42,656 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257869570] [2021-07-09 22:09:42,656 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257869570] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:09:42,656 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:09:42,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 22:09:42,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992880566] [2021-07-09 22:09:42,657 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 22:09:42,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:09:42,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 22:09:42,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-09 22:09:42,658 INFO L87 Difference]: Start difference. First operand 4345 states and 10500 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:09:42,895 INFO L93 Difference]: Finished difference Result 6368 states and 15987 transitions. [2021-07-09 22:09:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 22:09:42,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-07-09 22:09:42,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:09:42,918 INFO L225 Difference]: With dead ends: 6368 [2021-07-09 22:09:42,918 INFO L226 Difference]: Without dead ends: 4051 [2021-07-09 22:09:42,918 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 190.2ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-07-09 22:09:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2021-07-09 22:09:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 4051. [2021-07-09 22:09:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4051 states, 3987 states have (on average 2.4863305743666917) internal successors, (9913), 4050 states have internal predecessors, (9913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 9913 transitions. [2021-07-09 22:09:43,075 INFO L78 Accepts]: Start accepts. Automaton has 4051 states and 9913 transitions. Word has length 71 [2021-07-09 22:09:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:09:43,075 INFO L482 AbstractCegarLoop]: Abstraction has 4051 states and 9913 transitions. [2021-07-09 22:09:43,076 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:43,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4051 states and 9913 transitions. [2021-07-09 22:09:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 22:09:43,083 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:43,083 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:43,084 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 22:09:43,084 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1290459613, now seen corresponding path program 1 times [2021-07-09 22:09:43,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:43,085 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340785917] [2021-07-09 22:09:43,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:09:43,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:43,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:43,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:43,160 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:09:43,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:09:43,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:43,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:43,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:09:43,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:09:43,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340785917] [2021-07-09 22:09:43,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340785917] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:09:43,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:09:43,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 22:09:43,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537108877] [2021-07-09 22:09:43,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 22:09:43,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:09:43,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 22:09:43,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-09 22:09:43,219 INFO L87 Difference]: Start difference. First operand 4051 states and 9913 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:09:43,432 INFO L93 Difference]: Finished difference Result 7693 states and 19899 transitions. [2021-07-09 22:09:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 22:09:43,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-07-09 22:09:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:09:43,455 INFO L225 Difference]: With dead ends: 7693 [2021-07-09 22:09:43,456 INFO L226 Difference]: Without dead ends: 4119 [2021-07-09 22:09:43,456 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 159.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-07-09 22:09:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4119 states. [2021-07-09 22:09:43,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4119 to 2895. [2021-07-09 22:09:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2855 states have (on average 2.3957968476357268) internal successors, (6840), 2894 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 6840 transitions. [2021-07-09 22:09:43,551 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 6840 transitions. Word has length 73 [2021-07-09 22:09:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:09:43,552 INFO L482 AbstractCegarLoop]: Abstraction has 2895 states and 6840 transitions. [2021-07-09 22:09:43,552 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 6840 transitions. [2021-07-09 22:09:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 22:09:43,558 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:43,558 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:43,558 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 22:09:43,558 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:43,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:43,559 INFO L82 PathProgramCache]: Analyzing trace with hash 547141552, now seen corresponding path program 1 times [2021-07-09 22:09:43,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:43,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175349624] [2021-07-09 22:09:43,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:09:43,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:43,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:43,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:43,632 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:09:43,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:09:43,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:43,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:43,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:09:43,668 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:09:43,669 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175349624] [2021-07-09 22:09:43,669 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175349624] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:09:43,669 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:09:43,669 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 22:09:43,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936580739] [2021-07-09 22:09:43,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 22:09:43,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:09:43,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 22:09:43,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-09 22:09:43,670 INFO L87 Difference]: Start difference. First operand 2895 states and 6840 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:09:43,776 INFO L93 Difference]: Finished difference Result 4567 states and 11341 transitions. [2021-07-09 22:09:43,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 22:09:43,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-09 22:09:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:09:43,790 INFO L225 Difference]: With dead ends: 4567 [2021-07-09 22:09:43,790 INFO L226 Difference]: Without dead ends: 2853 [2021-07-09 22:09:43,790 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 80.0ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:09:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2021-07-09 22:09:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2853. [2021-07-09 22:09:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2813 states have (on average 2.4066832563099894) internal successors, (6770), 2852 states have internal predecessors, (6770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:43,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 6770 transitions. [2021-07-09 22:09:43,898 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 6770 transitions. Word has length 74 [2021-07-09 22:09:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:09:43,899 INFO L482 AbstractCegarLoop]: Abstraction has 2853 states and 6770 transitions. [2021-07-09 22:09:43,899 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 6770 transitions. [2021-07-09 22:09:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 22:09:43,905 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:43,905 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:43,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 22:09:43,905 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:43,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:43,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1116314926, now seen corresponding path program 2 times [2021-07-09 22:09:43,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:43,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650476955] [2021-07-09 22:09:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:09:43,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:43,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:43,974 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:09:43,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:09:43,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:43,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:44,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:44,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:09:44,013 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:09:44,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650476955] [2021-07-09 22:09:44,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650476955] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:09:44,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:09:44,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:09:44,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042595495] [2021-07-09 22:09:44,014 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:09:44,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:09:44,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:09:44,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:09:44,015 INFO L87 Difference]: Start difference. First operand 2853 states and 6770 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:09:44,142 INFO L93 Difference]: Finished difference Result 4099 states and 10421 transitions. [2021-07-09 22:09:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:09:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-09 22:09:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:09:44,148 INFO L225 Difference]: With dead ends: 4099 [2021-07-09 22:09:44,149 INFO L226 Difference]: Without dead ends: 1461 [2021-07-09 22:09:44,149 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 96.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:09:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2021-07-09 22:09:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1461. [2021-07-09 22:09:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1431 states have (on average 2.678546470999301) internal successors, (3833), 1460 states have internal predecessors, (3833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 3833 transitions. [2021-07-09 22:09:44,189 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 3833 transitions. Word has length 74 [2021-07-09 22:09:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:09:44,189 INFO L482 AbstractCegarLoop]: Abstraction has 1461 states and 3833 transitions. [2021-07-09 22:09:44,189 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 3833 transitions. [2021-07-09 22:09:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 22:09:44,192 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:44,192 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:44,193 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 22:09:44,193 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:44,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1735273409, now seen corresponding path program 1 times [2021-07-09 22:09:44,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:44,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586282798] [2021-07-09 22:09:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:09:44,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:44,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:44,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:09:44,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-09 22:09:44,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-09 22:09:44,327 INFO L142 QuantifierPusher]: treesize reduction 37, result has 43.9 percent of original size [2021-07-09 22:09:44,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-07-09 22:09:44,339 INFO L142 QuantifierPusher]: treesize reduction 27, result has 71.0 percent of original size [2021-07-09 22:09:44,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-07-09 22:09:44,387 INFO L142 QuantifierPusher]: treesize reduction 27, result has 69.0 percent of original size [2021-07-09 22:09:44,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-07-09 22:09:44,428 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:09:44,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:09:44,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:44,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:44,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:09:44,475 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:09:44,475 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586282798] [2021-07-09 22:09:44,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586282798] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:09:44,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:09:44,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 22:09:44,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260072585] [2021-07-09 22:09:44,476 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 22:09:44,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:09:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 22:09:44,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:09:44,477 INFO L87 Difference]: Start difference. First operand 1461 states and 3833 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:09:44,809 INFO L93 Difference]: Finished difference Result 1687 states and 4483 transitions. [2021-07-09 22:09:44,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 22:09:44,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-07-09 22:09:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:09:44,814 INFO L225 Difference]: With dead ends: 1687 [2021-07-09 22:09:44,815 INFO L226 Difference]: Without dead ends: 1447 [2021-07-09 22:09:44,815 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 335.8ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-07-09 22:09:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2021-07-09 22:09:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2021-07-09 22:09:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1418 states have (on average 2.6720733427362484) internal successors, (3789), 1446 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 3789 transitions. [2021-07-09 22:09:44,851 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 3789 transitions. Word has length 76 [2021-07-09 22:09:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:09:44,851 INFO L482 AbstractCegarLoop]: Abstraction has 1447 states and 3789 transitions. [2021-07-09 22:09:44,852 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 3789 transitions. [2021-07-09 22:09:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 22:09:44,855 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:44,855 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:44,855 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 22:09:44,855 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:44,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:44,856 INFO L82 PathProgramCache]: Analyzing trace with hash 420116401, now seen corresponding path program 1 times [2021-07-09 22:09:44,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:44,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717082042] [2021-07-09 22:09:44,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:09:44,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:44,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:44,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:44,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:09:44,933 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-07-09 22:09:44,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-09 22:09:44,956 INFO L142 QuantifierPusher]: treesize reduction 52, result has 51.4 percent of original size [2021-07-09 22:09:44,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-07-09 22:09:44,986 INFO L142 QuantifierPusher]: treesize reduction 52, result has 52.7 percent of original size [2021-07-09 22:09:44,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-07-09 22:09:45,018 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:09:45,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:09:45,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:45,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:45,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:45,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:45,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:45,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:09:45,062 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:09:45,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717082042] [2021-07-09 22:09:45,062 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717082042] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:09:45,063 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:09:45,063 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 22:09:45,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112112988] [2021-07-09 22:09:45,063 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 22:09:45,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:09:45,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 22:09:45,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-07-09 22:09:45,064 INFO L87 Difference]: Start difference. First operand 1447 states and 3789 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:09:45,604 INFO L93 Difference]: Finished difference Result 1975 states and 5353 transitions. [2021-07-09 22:09:45,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 22:09:45,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-07-09 22:09:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:09:45,609 INFO L225 Difference]: With dead ends: 1975 [2021-07-09 22:09:45,609 INFO L226 Difference]: Without dead ends: 1619 [2021-07-09 22:09:45,610 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 400.2ms TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-07-09 22:09:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2021-07-09 22:09:45,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1529. [2021-07-09 22:09:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1500 states have (on average 2.6586666666666665) internal successors, (3988), 1528 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 3988 transitions. [2021-07-09 22:09:45,646 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 3988 transitions. Word has length 76 [2021-07-09 22:09:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:09:45,646 INFO L482 AbstractCegarLoop]: Abstraction has 1529 states and 3988 transitions. [2021-07-09 22:09:45,647 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 3988 transitions. [2021-07-09 22:09:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 22:09:45,650 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:45,650 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:45,650 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 22:09:45,650 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:45,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:45,651 INFO L82 PathProgramCache]: Analyzing trace with hash -182285062, now seen corresponding path program 1 times [2021-07-09 22:09:45,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:45,651 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531938293] [2021-07-09 22:09:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:09:45,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:45,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:45,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:45,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:45,737 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:09:45,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:09:45,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:45,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:09:45,761 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:09:45,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:45,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:45,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:09:45,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:09:45,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531938293] [2021-07-09 22:09:45,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531938293] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:09:45,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:09:45,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:09:45,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466927771] [2021-07-09 22:09:45,772 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:09:45,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:09:45,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:09:45,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:09:45,772 INFO L87 Difference]: Start difference. First operand 1529 states and 3988 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:09:45,872 INFO L93 Difference]: Finished difference Result 1819 states and 4550 transitions. [2021-07-09 22:09:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:09:45,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-07-09 22:09:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:09:45,876 INFO L225 Difference]: With dead ends: 1819 [2021-07-09 22:09:45,877 INFO L226 Difference]: Without dead ends: 1307 [2021-07-09 22:09:45,877 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 82.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:09:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2021-07-09 22:09:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1307. [2021-07-09 22:09:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1278 states have (on average 2.6220657276995305) internal successors, (3351), 1306 states have internal predecessors, (3351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 3351 transitions. [2021-07-09 22:09:45,905 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 3351 transitions. Word has length 76 [2021-07-09 22:09:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:09:45,905 INFO L482 AbstractCegarLoop]: Abstraction has 1307 states and 3351 transitions. [2021-07-09 22:09:45,906 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 3351 transitions. [2021-07-09 22:09:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-09 22:09:45,908 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:45,908 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:45,908 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 22:09:45,909 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1602574972, now seen corresponding path program 1 times [2021-07-09 22:09:45,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:45,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480343081] [2021-07-09 22:09:45,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:09:45,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:45,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:45,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:45,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:45,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:45,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:45,970 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:09:45,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:09:45,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:45,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:09:45,993 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:09:45,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:46,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:46,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:09:46,003 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:09:46,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480343081] [2021-07-09 22:09:46,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480343081] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:09:46,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:09:46,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 22:09:46,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540345293] [2021-07-09 22:09:46,003 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 22:09:46,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:09:46,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 22:09:46,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 22:09:46,004 INFO L87 Difference]: Start difference. First operand 1307 states and 3351 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:09:46,126 INFO L93 Difference]: Finished difference Result 1153 states and 2671 transitions. [2021-07-09 22:09:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 22:09:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-07-09 22:09:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:09:46,129 INFO L225 Difference]: With dead ends: 1153 [2021-07-09 22:09:46,129 INFO L226 Difference]: Without dead ends: 744 [2021-07-09 22:09:46,129 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 93.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 22:09:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-07-09 22:09:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 741. [2021-07-09 22:09:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 717 states have (on average 2.3695955369595536) internal successors, (1699), 740 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1699 transitions. [2021-07-09 22:09:46,143 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1699 transitions. Word has length 77 [2021-07-09 22:09:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:09:46,143 INFO L482 AbstractCegarLoop]: Abstraction has 741 states and 1699 transitions. [2021-07-09 22:09:46,143 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1699 transitions. [2021-07-09 22:09:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-07-09 22:09:46,145 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:46,145 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:46,145 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 22:09:46,145 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:46,146 INFO L82 PathProgramCache]: Analyzing trace with hash -830566181, now seen corresponding path program 1 times [2021-07-09 22:09:46,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:46,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117527783] [2021-07-09 22:09:46,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:09:46,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:46,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:46,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:46,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:46,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:46,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:46,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:46,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:09:46,231 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:09:46,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:09:46,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:46,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:09:46,256 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:09:46,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:09:46,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:09:46,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:09:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:09:46,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:09:46,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117527783] [2021-07-09 22:09:46,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117527783] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:09:46,268 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:09:46,268 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 22:09:46,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537193301] [2021-07-09 22:09:46,269 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 22:09:46,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:09:46,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 22:09:46,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-09 22:09:46,270 INFO L87 Difference]: Start difference. First operand 741 states and 1699 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:09:46,408 INFO L93 Difference]: Finished difference Result 477 states and 952 transitions. [2021-07-09 22:09:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 22:09:46,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-07-09 22:09:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:09:46,410 INFO L225 Difference]: With dead ends: 477 [2021-07-09 22:09:46,410 INFO L226 Difference]: Without dead ends: 279 [2021-07-09 22:09:46,410 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 116.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-09 22:09:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-07-09 22:09:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2021-07-09 22:09:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 266 states have (on average 1.8796992481203008) internal successors, (500), 274 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 500 transitions. [2021-07-09 22:09:46,415 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 500 transitions. Word has length 79 [2021-07-09 22:09:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:09:46,415 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 500 transitions. [2021-07-09 22:09:46,415 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 22:09:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 500 transitions. [2021-07-09 22:09:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 22:09:46,416 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:09:46,416 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:09:46,417 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 22:09:46,417 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:09:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:09:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1199339806, now seen corresponding path program 1 times [2021-07-09 22:09:46,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:09:46,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905206745] [2021-07-09 22:09:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:09:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 22:09:46,455 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 22:09:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 22:09:46,493 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 22:09:46,534 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 22:09:46,534 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 22:09:46,534 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 22:09:46,534 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-07-09 22:09:46,536 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 22:09:46,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 10:09:46 BasicIcfg [2021-07-09 22:09:46,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 22:09:46,671 INFO L168 Benchmark]: Toolchain (without parser) took 10756.28 ms. Allocated memory was 190.8 MB in the beginning and 546.3 MB in the end (delta: 355.5 MB). Free memory was 153.4 MB in the beginning and 172.9 MB in the end (delta: -19.5 MB). Peak memory consumption was 337.1 MB. Max. memory is 8.0 GB. [2021-07-09 22:09:46,671 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 190.8 MB. Free memory was 171.4 MB in the beginning and 171.3 MB in the end (delta: 105.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 22:09:46,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 575.37 ms. Allocated memory is still 190.8 MB. Free memory was 153.2 MB in the beginning and 160.1 MB in the end (delta: -6.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-07-09 22:09:46,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.27 ms. Allocated memory is still 190.8 MB. Free memory was 160.1 MB in the beginning and 157.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 22:09:46,671 INFO L168 Benchmark]: Boogie Preprocessor took 54.68 ms. Allocated memory is still 190.8 MB. Free memory was 157.4 MB in the beginning and 154.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 22:09:46,672 INFO L168 Benchmark]: RCFGBuilder took 2066.50 ms. Allocated memory was 190.8 MB in the beginning and 253.8 MB in the end (delta: 62.9 MB). Free memory was 154.9 MB in the beginning and 128.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 91.5 MB. Max. memory is 8.0 GB. [2021-07-09 22:09:46,672 INFO L168 Benchmark]: TraceAbstraction took 7964.52 ms. Allocated memory was 253.8 MB in the beginning and 546.3 MB in the end (delta: 292.6 MB). Free memory was 127.6 MB in the beginning and 172.9 MB in the end (delta: -45.3 MB). Peak memory consumption was 247.3 MB. Max. memory is 8.0 GB. [2021-07-09 22:09:46,673 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 190.8 MB. Free memory was 171.4 MB in the beginning and 171.3 MB in the end (delta: 105.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 575.37 ms. Allocated memory is still 190.8 MB. Free memory was 153.2 MB in the beginning and 160.1 MB in the end (delta: -6.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 85.27 ms. Allocated memory is still 190.8 MB. Free memory was 160.1 MB in the beginning and 157.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 54.68 ms. Allocated memory is still 190.8 MB. Free memory was 157.4 MB in the beginning and 154.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2066.50 ms. Allocated memory was 190.8 MB in the beginning and 253.8 MB in the end (delta: 62.9 MB). Free memory was 154.9 MB in the beginning and 128.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 91.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7964.52 ms. Allocated memory was 253.8 MB in the beginning and 546.3 MB in the end (delta: 292.6 MB). Free memory was 127.6 MB in the beginning and 172.9 MB in the end (delta: -45.3 MB). Peak memory consumption was 247.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 36937, positive: 33731, positive conditional: 33731, positive unconditional: 0, negative: 3206, negative conditional: 3206, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36257, positive: 33731, positive conditional: 0, positive unconditional: 33731, negative: 2526, negative conditional: 0, negative unconditional: 2526, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 858, positive: 809, positive conditional: 0, positive unconditional: 809, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 858, positive: 806, positive conditional: 0, positive unconditional: 806, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 587, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 578, negative conditional: 0, negative unconditional: 578, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36257, positive: 32922, positive conditional: 0, positive unconditional: 32922, negative: 2477, negative conditional: 0, negative unconditional: 2477, unknown: 858, unknown conditional: 0, unknown unconditional: 858] , Statistics on independence cache: Total cache size (in pairs): 858, Positive cache size: 809, Positive conditional cache size: 0, Positive unconditional cache size: 809, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Independence queries for same thread: 680 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=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] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L818] 0 pthread_t t1888; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L819] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L820] 0 pthread_t t1889; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L821] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L822] 0 pthread_t t1890; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L823] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 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) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] 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) [L796] 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) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 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 [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 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 [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 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) [L776] 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) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 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 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 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) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] 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) [L829] 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) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 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 [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 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 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7693.5ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 113.0ms, AutomataDifference: 2904.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1317.8ms, PartialOrderReductionTime: 1304.3ms, HoareTripleCheckerStatistics: 1370 SDtfs, 1834 SDslu, 4671 SDs, 0 SdLazy, 641 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 770.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2026.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9815occurred in iteration=0, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 894.8ms AutomataMinimizationTime, 11 MinimizatonAttempts, 1321 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 46.1ms SsaConstructionTime, 599.8ms SatisfiabilityAnalysisTime, 1519.3ms InterpolantComputationTime, 895 NumberOfCodeBlocks, 895 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 802 ConstructedInterpolants, 0 QuantifiedInterpolants, 3609 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...