/usr/bin/java -Xmx16000000000 -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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-04 23:37:44,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-04 23:37:44,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-04 23:37:44,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-04 23:37:44,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-04 23:37:44,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-04 23:37:44,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-04 23:37:44,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-04 23:37:44,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-04 23:37:44,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-04 23:37:44,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-04 23:37:44,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-04 23:37:44,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-04 23:37:44,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-04 23:37:44,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-04 23:37:44,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-04 23:37:44,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-04 23:37:44,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-04 23:37:44,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-04 23:37:44,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-04 23:37:44,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-04 23:37:44,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-04 23:37:44,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-04 23:37:44,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-04 23:37:44,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-04 23:37:44,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-04 23:37:44,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-04 23:37:44,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-04 23:37:44,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-04 23:37:44,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-04 23:37:44,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-04 23:37:44,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-04 23:37:44,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-04 23:37:44,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-04 23:37:44,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-04 23:37:44,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-04 23:37:44,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-04 23:37:44,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-04 23:37:44,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-04 23:37:44,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-04 23:37:44,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-04 23:37:44,559 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.epf [2021-06-04 23:37:44,597 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-04 23:37:44,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-04 23:37:44,598 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-04 23:37:44,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-04 23:37:44,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-04 23:37:44,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-04 23:37:44,601 INFO L138 SettingsManager]: * Use SBE=true [2021-06-04 23:37:44,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-04 23:37:44,601 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-04 23:37:44,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-04 23:37:44,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-04 23:37:44,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-04 23:37:44,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-04 23:37:44,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-04 23:37:44,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-04 23:37:44,603 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-04 23:37:44,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-04 23:37:44,603 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-04 23:37:44,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-04 23:37:44,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-04 23:37:44,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-04 23:37:44,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-04 23:37:44,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-04 23:37:44,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-04 23:37:44,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-04 23:37:44,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-04 23:37:44,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-04 23:37:44,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-04 23:37:44,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-04 23:37:44,605 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-04 23:37:44,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-04 23:37:44,605 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-06-04 23:37:44,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-04 23:37:44,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-04 23:37:44,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-04 23:37:44,931 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-04 23:37:44,933 INFO L275 PluginConnector]: CDTParser initialized [2021-06-04 23:37:44,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2021-06-04 23:37:44,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feedd305f/eb4d22e249b14133860ae9055397c837/FLAGcc23233c2 [2021-06-04 23:37:45,724 INFO L306 CDTParser]: Found 1 translation units. [2021-06-04 23:37:45,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2021-06-04 23:37:45,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feedd305f/eb4d22e249b14133860ae9055397c837/FLAGcc23233c2 [2021-06-04 23:37:46,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feedd305f/eb4d22e249b14133860ae9055397c837 [2021-06-04 23:37:46,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-04 23:37:46,009 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-04 23:37:46,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-04 23:37:46,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-04 23:37:46,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-04 23:37:46,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 11:37:46" (1/1) ... [2021-06-04 23:37:46,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab42f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46, skipping insertion in model container [2021-06-04 23:37:46,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 11:37:46" (1/1) ... [2021-06-04 23:37:46,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-04 23:37:46,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-04 23:37:46,215 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/mix021_tso.oepc.i[949,962] [2021-06-04 23:37:46,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 23:37:46,474 INFO L203 MainTranslator]: Completed pre-run [2021-06-04 23:37:46,482 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/mix021_tso.oepc.i[949,962] [2021-06-04 23:37:46,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 23:37:46,600 INFO L208 MainTranslator]: Completed translation [2021-06-04 23:37:46,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46 WrapperNode [2021-06-04 23:37:46,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-04 23:37:46,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-04 23:37:46,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-04 23:37:46,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-04 23:37:46,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46" (1/1) ... [2021-06-04 23:37:46,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46" (1/1) ... [2021-06-04 23:37:46,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-04 23:37:46,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-04 23:37:46,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-04 23:37:46,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-04 23:37:46,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46" (1/1) ... [2021-06-04 23:37:46,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46" (1/1) ... [2021-06-04 23:37:46,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46" (1/1) ... [2021-06-04 23:37:46,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46" (1/1) ... [2021-06-04 23:37:46,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46" (1/1) ... [2021-06-04 23:37:46,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46" (1/1) ... [2021-06-04 23:37:46,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46" (1/1) ... [2021-06-04 23:37:46,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-04 23:37:46,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-04 23:37:46,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-04 23:37:46,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-04 23:37:46,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46" (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-06-04 23:37:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-04 23:37:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-04 23:37:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-04 23:37:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-04 23:37:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-04 23:37:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-04 23:37:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-04 23:37:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-04 23:37:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-04 23:37:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-04 23:37:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-04 23:37:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-04 23:37:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-04 23:37:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-04 23:37:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-04 23:37:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-04 23:37:46,765 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-04 23:37:48,581 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-04 23:37:48,582 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-04 23:37:48,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 11:37:48 BoogieIcfgContainer [2021-06-04 23:37:48,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-04 23:37:48,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-04 23:37:48,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-04 23:37:48,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-04 23:37:48,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 11:37:46" (1/3) ... [2021-06-04 23:37:48,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e75552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 11:37:48, skipping insertion in model container [2021-06-04 23:37:48,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:37:46" (2/3) ... [2021-06-04 23:37:48,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e75552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 11:37:48, skipping insertion in model container [2021-06-04 23:37:48,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 11:37:48" (3/3) ... [2021-06-04 23:37:48,589 INFO L111 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2021-06-04 23:37:48,594 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-04 23:37:48,594 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-04 23:37:48,594 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-04 23:37:48,595 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-04 23:37:48,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,625 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,625 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,625 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,625 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,627 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,627 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,630 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,630 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,631 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,631 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,631 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,631 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,631 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,632 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,635 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,635 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,635 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,635 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,636 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,636 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,641 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,642 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,643 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,644 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,646 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,646 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,647 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,648 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,649 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:37:48,650 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-04 23:37:48,667 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-04 23:37:48,683 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-04 23:37:48,683 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-04 23:37:48,683 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-04 23:37:48,683 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-04 23:37:48,683 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-04 23:37:48,684 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-04 23:37:48,684 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-04 23:37:48,684 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-04 23:37:48,693 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 128 transitions, 276 flow [2021-06-04 23:38:16,605 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 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-06-04 23:38:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 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-06-04 23:38:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-04 23:38:16,873 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:38:16,873 INFO L521 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] [2021-06-04 23:38:16,874 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:38:16,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:38:16,891 INFO L82 PathProgramCache]: Analyzing trace with hash -803804790, now seen corresponding path program 1 times [2021-06-04 23:38:16,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:38:16,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275167926] [2021-06-04 23:38:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:38:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:38:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:38:17,131 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:38:17,131 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275167926] [2021-06-04 23:38:17,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275167926] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:38:17,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:38:17,132 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-04 23:38:17,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838710269] [2021-06-04 23:38:17,136 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 23:38:17,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:38:17,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 23:38:17,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 23:38:17,391 INFO L87 Difference]: Start difference. First operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 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 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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-06-04 23:38:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:38:19,328 INFO L93 Difference]: Finished difference Result 116517 states and 516070 transitions. [2021-06-04 23:38:19,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 23:38:19,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2021-06-04 23:38:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:38:19,916 INFO L225 Difference]: With dead ends: 116517 [2021-06-04 23:38:19,916 INFO L226 Difference]: Without dead ends: 64101 [2021-06-04 23:38:19,918 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 23:38:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64101 states. [2021-06-04 23:38:22,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64101 to 64101. [2021-06-04 23:38:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64101 states, 64100 states have (on average 4.374508580343214) internal successors, (280406), 64100 states have internal predecessors, (280406), 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-06-04 23:38:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64101 states to 64101 states and 280406 transitions. [2021-06-04 23:38:23,451 INFO L78 Accepts]: Start accepts. Automaton has 64101 states and 280406 transitions. Word has length 60 [2021-06-04 23:38:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:38:23,452 INFO L482 AbstractCegarLoop]: Abstraction has 64101 states and 280406 transitions. [2021-06-04 23:38:23,452 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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-06-04 23:38:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 64101 states and 280406 transitions. [2021-06-04 23:38:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-04 23:38:23,522 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:38:23,522 INFO L521 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-06-04 23:38:23,522 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-04 23:38:23,522 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:38:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:38:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2144397672, now seen corresponding path program 1 times [2021-06-04 23:38:23,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:38:23,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575813449] [2021-06-04 23:38:23,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:38:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:38:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:38:24,171 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:38:24,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575813449] [2021-06-04 23:38:24,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575813449] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:38:24,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:38:24,173 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:38:24,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176212358] [2021-06-04 23:38:24,175 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:38:24,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:38:24,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:38:24,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:38:24,178 INFO L87 Difference]: Start difference. First operand 64101 states and 280406 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-06-04 23:38:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:38:25,063 INFO L93 Difference]: Finished difference Result 77637 states and 336970 transitions. [2021-06-04 23:38:25,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:38:25,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-06-04 23:38:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:38:25,488 INFO L225 Difference]: With dead ends: 77637 [2021-06-04 23:38:25,488 INFO L226 Difference]: Without dead ends: 61509 [2021-06-04 23:38:25,489 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 83.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:38:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61509 states. [2021-06-04 23:38:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61509 to 61509. [2021-06-04 23:38:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61509 states, 61508 states have (on average 4.3580997593808934) internal successors, (268058), 61508 states have internal predecessors, (268058), 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-06-04 23:38:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61509 states to 61509 states and 268058 transitions. [2021-06-04 23:38:28,072 INFO L78 Accepts]: Start accepts. Automaton has 61509 states and 268058 transitions. Word has length 79 [2021-06-04 23:38:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:38:28,083 INFO L482 AbstractCegarLoop]: Abstraction has 61509 states and 268058 transitions. [2021-06-04 23:38:28,086 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-06-04 23:38:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 61509 states and 268058 transitions. [2021-06-04 23:38:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-04 23:38:28,170 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:38:28,170 INFO L521 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] [2021-06-04 23:38:28,171 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-04 23:38:28,171 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:38:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:38:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash 779588023, now seen corresponding path program 1 times [2021-06-04 23:38:28,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:38:28,172 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793976054] [2021-06-04 23:38:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:38:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:38:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:38:28,306 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:38:28,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793976054] [2021-06-04 23:38:28,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793976054] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:38:28,307 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:38:28,307 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:38:28,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475609532] [2021-06-04 23:38:28,308 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:38:28,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:38:28,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:38:28,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:38:28,308 INFO L87 Difference]: Start difference. First operand 61509 states and 268058 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-06-04 23:38:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:38:29,255 INFO L93 Difference]: Finished difference Result 68709 states and 296998 transitions. [2021-06-04 23:38:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:38:29,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 81 [2021-06-04 23:38:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:38:29,563 INFO L225 Difference]: With dead ends: 68709 [2021-06-04 23:38:29,563 INFO L226 Difference]: Without dead ends: 54309 [2021-06-04 23:38:29,563 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 79.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:38:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54309 states. [2021-06-04 23:38:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54309 to 54309. [2021-06-04 23:38:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54309 states, 54308 states have (on average 4.32934374309494) internal successors, (235118), 54308 states have internal predecessors, (235118), 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-06-04 23:38:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54309 states to 54309 states and 235118 transitions. [2021-06-04 23:38:31,623 INFO L78 Accepts]: Start accepts. Automaton has 54309 states and 235118 transitions. Word has length 81 [2021-06-04 23:38:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:38:31,625 INFO L482 AbstractCegarLoop]: Abstraction has 54309 states and 235118 transitions. [2021-06-04 23:38:31,626 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-06-04 23:38:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 54309 states and 235118 transitions. [2021-06-04 23:38:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-04 23:38:31,719 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:38:31,719 INFO L521 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, 1, 1] [2021-06-04 23:38:31,719 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-04 23:38:31,719 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:38:31,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:38:31,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1310213575, now seen corresponding path program 1 times [2021-06-04 23:38:31,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:38:31,720 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688775213] [2021-06-04 23:38:31,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:38:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:38:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:38:32,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:38:32,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688775213] [2021-06-04 23:38:32,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688775213] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:38:32,020 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:38:32,020 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 23:38:32,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607360325] [2021-06-04 23:38:32,021 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 23:38:32,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:38:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 23:38:32,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-04 23:38:32,022 INFO L87 Difference]: Start difference. First operand 54309 states and 235118 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-06-04 23:38:32,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:38:32,739 INFO L93 Difference]: Finished difference Result 65031 states and 280066 transitions. [2021-06-04 23:38:32,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 23:38:32,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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 84 [2021-06-04 23:38:32,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:38:33,402 INFO L225 Difference]: With dead ends: 65031 [2021-06-04 23:38:33,402 INFO L226 Difference]: Without dead ends: 54951 [2021-06-04 23:38:33,402 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 229.1ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-06-04 23:38:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54951 states. [2021-06-04 23:38:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54951 to 53229. [2021-06-04 23:38:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53229 states, 53228 states have (on average 4.323175772149996) internal successors, (230114), 53228 states have internal predecessors, (230114), 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-06-04 23:38:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53229 states to 53229 states and 230114 transitions. [2021-06-04 23:38:35,241 INFO L78 Accepts]: Start accepts. Automaton has 53229 states and 230114 transitions. Word has length 84 [2021-06-04 23:38:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:38:35,241 INFO L482 AbstractCegarLoop]: Abstraction has 53229 states and 230114 transitions. [2021-06-04 23:38:35,242 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-06-04 23:38:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 53229 states and 230114 transitions. [2021-06-04 23:38:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-04 23:38:35,319 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:38:35,319 INFO L521 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, 1, 1, 1] [2021-06-04 23:38:35,320 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-04 23:38:35,320 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:38:35,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:38:35,321 INFO L82 PathProgramCache]: Analyzing trace with hash -659540979, now seen corresponding path program 1 times [2021-06-04 23:38:35,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:38:35,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567515096] [2021-06-04 23:38:35,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:38:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:38:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:38:35,547 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:38:35,547 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567515096] [2021-06-04 23:38:35,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567515096] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:38:35,548 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:38:35,548 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 23:38:35,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871134420] [2021-06-04 23:38:35,548 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 23:38:35,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:38:35,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 23:38:35,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-04 23:38:35,549 INFO L87 Difference]: Start difference. First operand 53229 states and 230114 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-06-04 23:38:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:38:36,631 INFO L93 Difference]: Finished difference Result 57429 states and 246874 transitions. [2021-06-04 23:38:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 23:38:36,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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 85 [2021-06-04 23:38:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:38:36,813 INFO L225 Difference]: With dead ends: 57429 [2021-06-04 23:38:36,814 INFO L226 Difference]: Without dead ends: 50709 [2021-06-04 23:38:36,814 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 191.1ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-06-04 23:38:37,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50709 states. [2021-06-04 23:38:38,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50709 to 50709. [2021-06-04 23:38:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50709 states, 50708 states have (on average 4.314861560306066) internal successors, (218798), 50708 states have internal predecessors, (218798), 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-06-04 23:38:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50709 states to 50709 states and 218798 transitions. [2021-06-04 23:38:38,811 INFO L78 Accepts]: Start accepts. Automaton has 50709 states and 218798 transitions. Word has length 85 [2021-06-04 23:38:38,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:38:38,811 INFO L482 AbstractCegarLoop]: Abstraction has 50709 states and 218798 transitions. [2021-06-04 23:38:38,811 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-06-04 23:38:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 50709 states and 218798 transitions. [2021-06-04 23:38:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-04 23:38:38,888 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:38:38,889 INFO L521 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, 1, 1, 1, 1] [2021-06-04 23:38:38,889 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-04 23:38:38,889 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:38:38,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:38:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1785060945, now seen corresponding path program 1 times [2021-06-04 23:38:38,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:38:38,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981548431] [2021-06-04 23:38:38,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:38:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:38:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:38:39,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:38:39,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981548431] [2021-06-04 23:38:39,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981548431] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:38:39,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:38:39,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-04 23:38:39,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863653232] [2021-06-04 23:38:39,586 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-04 23:38:39,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:38:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-04 23:38:39,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-06-04 23:38:39,586 INFO L87 Difference]: Start difference. First operand 50709 states and 218798 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 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-06-04 23:38:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:38:40,237 INFO L93 Difference]: Finished difference Result 59541 states and 255752 transitions. [2021-06-04 23:38:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 23:38:40,237 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 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 86 [2021-06-04 23:38:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:38:40,416 INFO L225 Difference]: With dead ends: 59541 [2021-06-04 23:38:40,416 INFO L226 Difference]: Without dead ends: 51861 [2021-06-04 23:38:40,416 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 254.8ms TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-06-04 23:38:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51861 states. [2021-06-04 23:38:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51861 to 51861. [2021-06-04 23:38:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51861 states, 51860 states have (on average 4.316775935210181) internal successors, (223868), 51860 states have internal predecessors, (223868), 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-06-04 23:38:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51861 states to 51861 states and 223868 transitions. [2021-06-04 23:38:42,628 INFO L78 Accepts]: Start accepts. Automaton has 51861 states and 223868 transitions. Word has length 86 [2021-06-04 23:38:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:38:42,629 INFO L482 AbstractCegarLoop]: Abstraction has 51861 states and 223868 transitions. [2021-06-04 23:38:42,629 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 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-06-04 23:38:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 51861 states and 223868 transitions. [2021-06-04 23:38:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-04 23:38:42,793 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:38:42,794 INFO L521 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, 1, 1, 1, 1, 1] [2021-06-04 23:38:42,794 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-04 23:38:42,794 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:38:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:38:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash 16200485, now seen corresponding path program 1 times [2021-06-04 23:38:42,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:38:42,795 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567846311] [2021-06-04 23:38:42,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:38:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:38:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:38:43,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:38:43,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567846311] [2021-06-04 23:38:43,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567846311] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:38:43,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:38:43,038 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 23:38:43,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039559271] [2021-06-04 23:38:43,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 23:38:43,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:38:43,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 23:38:43,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:38:43,039 INFO L87 Difference]: Start difference. First operand 51861 states and 223868 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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-06-04 23:38:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:38:43,799 INFO L93 Difference]: Finished difference Result 62445 states and 268612 transitions. [2021-06-04 23:38:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 23:38:43,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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 87 [2021-06-04 23:38:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:38:44,005 INFO L225 Difference]: With dead ends: 62445 [2021-06-04 23:38:44,005 INFO L226 Difference]: Without dead ends: 56509 [2021-06-04 23:38:44,005 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 287.8ms TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2021-06-04 23:38:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56509 states. [2021-06-04 23:38:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56509 to 55165. [2021-06-04 23:38:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55165 states, 55164 states have (on average 4.3186860996301935) internal successors, (238236), 55164 states have internal predecessors, (238236), 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-06-04 23:38:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55165 states to 55165 states and 238236 transitions. [2021-06-04 23:38:46,226 INFO L78 Accepts]: Start accepts. Automaton has 55165 states and 238236 transitions. Word has length 87 [2021-06-04 23:38:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:38:46,227 INFO L482 AbstractCegarLoop]: Abstraction has 55165 states and 238236 transitions. [2021-06-04 23:38:46,227 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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-06-04 23:38:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 55165 states and 238236 transitions. [2021-06-04 23:38:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 23:38:46,311 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:38:46,311 INFO L521 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, 1, 1, 1, 1, 1, 1] [2021-06-04 23:38:46,312 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-04 23:38:46,312 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:38:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:38:46,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1977715090, now seen corresponding path program 1 times [2021-06-04 23:38:46,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:38:46,313 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990242055] [2021-06-04 23:38:46,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:38:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:38:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:38:46,591 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:38:46,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990242055] [2021-06-04 23:38:46,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990242055] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:38:46,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:38:46,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-04 23:38:46,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89254097] [2021-06-04 23:38:46,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-04 23:38:46,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:38:46,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-04 23:38:46,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-06-04 23:38:46,593 INFO L87 Difference]: Start difference. First operand 55165 states and 238236 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-06-04 23:38:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:38:47,295 INFO L93 Difference]: Finished difference Result 68269 states and 293974 transitions. [2021-06-04 23:38:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 23:38:47,296 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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 88 [2021-06-04 23:38:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:38:47,968 INFO L225 Difference]: With dead ends: 68269 [2021-06-04 23:38:47,968 INFO L226 Difference]: Without dead ends: 63341 [2021-06-04 23:38:47,969 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 289.6ms TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2021-06-04 23:38:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63341 states. [2021-06-04 23:38:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63341 to 63341. [2021-06-04 23:38:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63341 states, 63340 states have (on average 4.321660877802336) internal successors, (273734), 63340 states have internal predecessors, (273734), 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-06-04 23:38:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63341 states to 63341 states and 273734 transitions. [2021-06-04 23:38:49,881 INFO L78 Accepts]: Start accepts. Automaton has 63341 states and 273734 transitions. Word has length 88 [2021-06-04 23:38:49,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:38:49,882 INFO L482 AbstractCegarLoop]: Abstraction has 63341 states and 273734 transitions. [2021-06-04 23:38:49,882 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-06-04 23:38:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 63341 states and 273734 transitions. [2021-06-04 23:38:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 23:38:49,990 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:38:49,990 INFO L521 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, 1, 1, 1, 1, 1, 1] [2021-06-04 23:38:49,990 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-04 23:38:49,990 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:38:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:38:49,991 INFO L82 PathProgramCache]: Analyzing trace with hash 261879030, now seen corresponding path program 1 times [2021-06-04 23:38:49,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:38:49,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851726461] [2021-06-04 23:38:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:38:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:38:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:38:50,325 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:38:50,325 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851726461] [2021-06-04 23:38:50,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851726461] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:38:50,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:38:50,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-04 23:38:50,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725915287] [2021-06-04 23:38:50,326 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-04 23:38:50,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:38:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-04 23:38:50,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-06-04 23:38:50,327 INFO L87 Difference]: Start difference. First operand 63341 states and 273734 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-06-04 23:38:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:38:51,624 INFO L93 Difference]: Finished difference Result 67925 states and 292260 transitions. [2021-06-04 23:38:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-04 23:38:51,625 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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 88 [2021-06-04 23:38:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:38:51,838 INFO L225 Difference]: With dead ends: 67925 [2021-06-04 23:38:51,838 INFO L226 Difference]: Without dead ends: 63125 [2021-06-04 23:38:51,841 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 498.9ms TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2021-06-04 23:38:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63125 states. [2021-06-04 23:38:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63125 to 61109. [2021-06-04 23:38:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61109 states, 61108 states have (on average 4.314656018851869) internal successors, (263660), 61108 states have internal predecessors, (263660), 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-06-04 23:38:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61109 states to 61109 states and 263660 transitions. [2021-06-04 23:38:53,781 INFO L78 Accepts]: Start accepts. Automaton has 61109 states and 263660 transitions. Word has length 88 [2021-06-04 23:38:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:38:53,781 INFO L482 AbstractCegarLoop]: Abstraction has 61109 states and 263660 transitions. [2021-06-04 23:38:53,781 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-06-04 23:38:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 61109 states and 263660 transitions. [2021-06-04 23:38:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 23:38:53,876 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:38:53,876 INFO L521 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, 1, 1, 1, 1, 1, 1] [2021-06-04 23:38:53,876 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-04 23:38:53,876 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:38:53,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:38:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash -117957550, now seen corresponding path program 1 times [2021-06-04 23:38:53,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:38:53,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106187563] [2021-06-04 23:38:53,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:38:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:38:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:38:53,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:38:53,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106187563] [2021-06-04 23:38:53,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106187563] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:38:53,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:38:53,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-04 23:38:53,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096286356] [2021-06-04 23:38:53,973 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-04 23:38:53,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:38:53,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-04 23:38:53,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-04 23:38:53,974 INFO L87 Difference]: Start difference. First operand 61109 states and 263660 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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-06-04 23:38:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:38:55,117 INFO L93 Difference]: Finished difference Result 93174 states and 400389 transitions. [2021-06-04 23:38:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-04 23:38:55,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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 88 [2021-06-04 23:38:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:38:55,320 INFO L225 Difference]: With dead ends: 93174 [2021-06-04 23:38:55,321 INFO L226 Difference]: Without dead ends: 61949 [2021-06-04 23:38:55,321 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:38:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61949 states. [2021-06-04 23:38:56,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61949 to 56069. [2021-06-04 23:38:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56069 states, 56068 states have (on average 4.223068416922309) internal successors, (236779), 56068 states have internal predecessors, (236779), 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-06-04 23:38:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56069 states to 56069 states and 236779 transitions. [2021-06-04 23:38:57,204 INFO L78 Accepts]: Start accepts. Automaton has 56069 states and 236779 transitions. Word has length 88 [2021-06-04 23:38:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:38:57,205 INFO L482 AbstractCegarLoop]: Abstraction has 56069 states and 236779 transitions. [2021-06-04 23:38:57,205 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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-06-04 23:38:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 56069 states and 236779 transitions. [2021-06-04 23:38:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 23:38:57,793 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:38:57,793 INFO L521 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, 1, 1, 1, 1, 1, 1] [2021-06-04 23:38:57,793 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-04 23:38:57,793 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:38:57,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:38:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash 314366802, now seen corresponding path program 2 times [2021-06-04 23:38:57,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:38:57,794 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216812788] [2021-06-04 23:38:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:38:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:38:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:38:58,136 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:38:58,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216812788] [2021-06-04 23:38:58,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216812788] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:38:58,136 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:38:58,136 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 23:38:58,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195008373] [2021-06-04 23:38:58,136 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 23:38:58,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:38:58,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 23:38:58,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:38:58,138 INFO L87 Difference]: Start difference. First operand 56069 states and 236779 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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-06-04 23:38:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:38:58,815 INFO L93 Difference]: Finished difference Result 80429 states and 335429 transitions. [2021-06-04 23:38:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 23:38:58,816 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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 88 [2021-06-04 23:38:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:38:59,004 INFO L225 Difference]: With dead ends: 80429 [2021-06-04 23:38:59,004 INFO L226 Difference]: Without dead ends: 64245 [2021-06-04 23:38:59,004 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 277.0ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-06-04 23:38:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64245 states. [2021-06-04 23:39:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64245 to 56293. [2021-06-04 23:39:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56293 states, 56292 states have (on average 4.198607262133163) internal successors, (236348), 56292 states have internal predecessors, (236348), 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-06-04 23:39:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56293 states to 56293 states and 236348 transitions. [2021-06-04 23:39:01,370 INFO L78 Accepts]: Start accepts. Automaton has 56293 states and 236348 transitions. Word has length 88 [2021-06-04 23:39:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:39:01,370 INFO L482 AbstractCegarLoop]: Abstraction has 56293 states and 236348 transitions. [2021-06-04 23:39:01,370 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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-06-04 23:39:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 56293 states and 236348 transitions. [2021-06-04 23:39:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-04 23:39:01,470 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:39:01,470 INFO L521 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, 1, 1, 1, 1, 1, 1] [2021-06-04 23:39:01,470 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-04 23:39:01,470 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:39:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:39:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1072364236, now seen corresponding path program 2 times [2021-06-04 23:39:01,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:39:01,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152552566] [2021-06-04 23:39:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:39:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:39:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:39:01,555 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:39:01,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152552566] [2021-06-04 23:39:01,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152552566] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:39:01,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:39:01,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:39:01,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929264615] [2021-06-04 23:39:01,556 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:39:01,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:39:01,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:39:01,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:39:01,557 INFO L87 Difference]: Start difference. First operand 56293 states and 236348 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-06-04 23:39:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:39:02,084 INFO L93 Difference]: Finished difference Result 70969 states and 294406 transitions. [2021-06-04 23:39:02,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:39:02,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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 88 [2021-06-04 23:39:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:39:02,245 INFO L225 Difference]: With dead ends: 70969 [2021-06-04 23:39:02,245 INFO L226 Difference]: Without dead ends: 51985 [2021-06-04 23:39:02,246 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 80.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:39:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51985 states. [2021-06-04 23:39:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51985 to 51985. [2021-06-04 23:39:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51985 states, 51984 states have (on average 4.146506617420745) internal successors, (215552), 51984 states have internal predecessors, (215552), 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-06-04 23:39:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51985 states to 51985 states and 215552 transitions. [2021-06-04 23:39:03,840 INFO L78 Accepts]: Start accepts. Automaton has 51985 states and 215552 transitions. Word has length 88 [2021-06-04 23:39:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:39:03,840 INFO L482 AbstractCegarLoop]: Abstraction has 51985 states and 215552 transitions. [2021-06-04 23:39:03,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-06-04 23:39:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 51985 states and 215552 transitions. [2021-06-04 23:39:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-04 23:39:03,917 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:39:03,918 INFO L521 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:39:03,918 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-04 23:39:03,918 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:39:03,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:39:03,918 INFO L82 PathProgramCache]: Analyzing trace with hash 565367270, now seen corresponding path program 1 times [2021-06-04 23:39:03,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:39:03,919 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644079422] [2021-06-04 23:39:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:39:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:39:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:39:04,001 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:39:04,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644079422] [2021-06-04 23:39:04,002 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644079422] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:39:04,002 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:39:04,002 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-04 23:39:04,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619167654] [2021-06-04 23:39:04,002 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-04 23:39:04,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:39:04,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-04 23:39:04,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-04 23:39:04,003 INFO L87 Difference]: Start difference. First operand 51985 states and 215552 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-06-04 23:39:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:39:04,908 INFO L93 Difference]: Finished difference Result 56449 states and 229115 transitions. [2021-06-04 23:39:04,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-04 23:39:04,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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 89 [2021-06-04 23:39:04,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:39:05,013 INFO L225 Difference]: With dead ends: 56449 [2021-06-04 23:39:05,013 INFO L226 Difference]: Without dead ends: 40105 [2021-06-04 23:39:05,013 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 94.5ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-04 23:39:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40105 states. [2021-06-04 23:39:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40105 to 40105. [2021-06-04 23:39:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40105 states, 40104 states have (on average 4.022491522042689) internal successors, (161318), 40104 states have internal predecessors, (161318), 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-06-04 23:39:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40105 states to 40105 states and 161318 transitions. [2021-06-04 23:39:06,349 INFO L78 Accepts]: Start accepts. Automaton has 40105 states and 161318 transitions. Word has length 89 [2021-06-04 23:39:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:39:06,349 INFO L482 AbstractCegarLoop]: Abstraction has 40105 states and 161318 transitions. [2021-06-04 23:39:06,349 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-06-04 23:39:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 40105 states and 161318 transitions. [2021-06-04 23:39:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-04 23:39:06,411 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:39:06,411 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:39:06,411 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-04 23:39:06,411 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:39:06,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:39:06,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1457245829, now seen corresponding path program 1 times [2021-06-04 23:39:06,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:39:06,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217223364] [2021-06-04 23:39:06,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:39:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:39:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:39:06,488 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:39:06,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217223364] [2021-06-04 23:39:06,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217223364] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:39:06,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:39:06,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:39:06,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078996103] [2021-06-04 23:39:06,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:39:06,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:39:06,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:39:06,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:39:06,489 INFO L87 Difference]: Start difference. First operand 40105 states and 161318 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-06-04 23:39:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:39:06,905 INFO L93 Difference]: Finished difference Result 64733 states and 257876 transitions. [2021-06-04 23:39:06,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:39:06,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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 91 [2021-06-04 23:39:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:39:07,010 INFO L225 Difference]: With dead ends: 64733 [2021-06-04 23:39:07,010 INFO L226 Difference]: Without dead ends: 41833 [2021-06-04 23:39:07,010 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 75.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:39:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41833 states. [2021-06-04 23:39:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41833 to 39037. [2021-06-04 23:39:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39037 states, 39036 states have (on average 3.931217337841992) internal successors, (153459), 39036 states have internal predecessors, (153459), 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-06-04 23:39:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39037 states to 39037 states and 153459 transitions. [2021-06-04 23:39:08,381 INFO L78 Accepts]: Start accepts. Automaton has 39037 states and 153459 transitions. Word has length 91 [2021-06-04 23:39:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:39:08,381 INFO L482 AbstractCegarLoop]: Abstraction has 39037 states and 153459 transitions. [2021-06-04 23:39:08,381 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-06-04 23:39:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 39037 states and 153459 transitions. [2021-06-04 23:39:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-04 23:39:08,443 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:39:08,443 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:39:08,443 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-04 23:39:08,443 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:39:08,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:39:08,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1688943755, now seen corresponding path program 1 times [2021-06-04 23:39:08,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:39:08,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346643415] [2021-06-04 23:39:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:39:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:39:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:39:08,749 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:39:08,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346643415] [2021-06-04 23:39:08,749 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346643415] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:39:08,749 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:39:08,749 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-04 23:39:08,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741640912] [2021-06-04 23:39:08,750 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-04 23:39:08,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:39:08,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-04 23:39:08,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-06-04 23:39:08,751 INFO L87 Difference]: Start difference. First operand 39037 states and 153459 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 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-06-04 23:39:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:39:09,260 INFO L93 Difference]: Finished difference Result 44811 states and 174995 transitions. [2021-06-04 23:39:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 23:39:09,264 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 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 92 [2021-06-04 23:39:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:39:09,819 INFO L225 Difference]: With dead ends: 44811 [2021-06-04 23:39:09,820 INFO L226 Difference]: Without dead ends: 39897 [2021-06-04 23:39:09,822 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 277.1ms TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2021-06-04 23:39:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39897 states. [2021-06-04 23:39:10,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39897 to 37393. [2021-06-04 23:39:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37393 states, 37392 states have (on average 3.9126818570817288) internal successors, (146303), 37392 states have internal predecessors, (146303), 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-06-04 23:39:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37393 states to 37393 states and 146303 transitions. [2021-06-04 23:39:10,572 INFO L78 Accepts]: Start accepts. Automaton has 37393 states and 146303 transitions. Word has length 92 [2021-06-04 23:39:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:39:10,572 INFO L482 AbstractCegarLoop]: Abstraction has 37393 states and 146303 transitions. [2021-06-04 23:39:10,572 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 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-06-04 23:39:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 37393 states and 146303 transitions. [2021-06-04 23:39:10,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-04 23:39:10,629 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:39:10,629 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:39:10,629 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-04 23:39:10,630 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:39:10,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:39:10,630 INFO L82 PathProgramCache]: Analyzing trace with hash 909481029, now seen corresponding path program 2 times [2021-06-04 23:39:10,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:39:10,630 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074240989] [2021-06-04 23:39:10,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:39:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:39:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:39:10,894 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:39:10,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074240989] [2021-06-04 23:39:10,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074240989] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:39:10,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:39:10,896 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-04 23:39:10,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463194775] [2021-06-04 23:39:10,896 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-04 23:39:10,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:39:10,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-04 23:39:10,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-06-04 23:39:10,897 INFO L87 Difference]: Start difference. First operand 37393 states and 146303 transitions. Second operand has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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-06-04 23:39:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:39:11,810 INFO L93 Difference]: Finished difference Result 43167 states and 167902 transitions. [2021-06-04 23:39:11,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-04 23:39:11,810 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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 92 [2021-06-04 23:39:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:39:11,903 INFO L225 Difference]: With dead ends: 43167 [2021-06-04 23:39:11,903 INFO L226 Difference]: Without dead ends: 38238 [2021-06-04 23:39:11,904 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 299.2ms TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-06-04 23:39:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38238 states. [2021-06-04 23:39:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38238 to 37278. [2021-06-04 23:39:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37278 states, 37277 states have (on average 3.904471926388926) internal successors, (145547), 37277 states have internal predecessors, (145547), 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-06-04 23:39:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37278 states to 37278 states and 145547 transitions. [2021-06-04 23:39:13,088 INFO L78 Accepts]: Start accepts. Automaton has 37278 states and 145547 transitions. Word has length 92 [2021-06-04 23:39:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:39:13,088 INFO L482 AbstractCegarLoop]: Abstraction has 37278 states and 145547 transitions. [2021-06-04 23:39:13,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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-06-04 23:39:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 37278 states and 145547 transitions. [2021-06-04 23:39:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-04 23:39:13,157 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:39:13,157 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:39:13,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-04 23:39:13,158 INFO L430 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:39:13,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:39:13,158 INFO L82 PathProgramCache]: Analyzing trace with hash 548198033, now seen corresponding path program 1 times [2021-06-04 23:39:13,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:39:13,158 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729915698] [2021-06-04 23:39:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:39:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:39:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:39:13,246 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:39:13,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729915698] [2021-06-04 23:39:13,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729915698] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:39:13,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:39:13,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 23:39:13,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324115435] [2021-06-04 23:39:13,247 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 23:39:13,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:39:13,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 23:39:13,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-04 23:39:13,248 INFO L87 Difference]: Start difference. First operand 37278 states and 145547 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-06-04 23:39:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:39:13,549 INFO L93 Difference]: Finished difference Result 34182 states and 130664 transitions. [2021-06-04 23:39:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-04 23:39:13,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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 92 [2021-06-04 23:39:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:39:13,609 INFO L225 Difference]: With dead ends: 34182 [2021-06-04 23:39:13,609 INFO L226 Difference]: Without dead ends: 24642 [2021-06-04 23:39:13,609 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 108.4ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-04 23:39:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24642 states. [2021-06-04 23:39:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24642 to 22617. [2021-06-04 23:39:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22617 states, 22616 states have (on average 3.7865670321896) internal successors, (85637), 22616 states have internal predecessors, (85637), 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-06-04 23:39:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22617 states to 22617 states and 85637 transitions. [2021-06-04 23:39:14,042 INFO L78 Accepts]: Start accepts. Automaton has 22617 states and 85637 transitions. Word has length 92 [2021-06-04 23:39:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:39:14,042 INFO L482 AbstractCegarLoop]: Abstraction has 22617 states and 85637 transitions. [2021-06-04 23:39:14,042 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-06-04 23:39:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 22617 states and 85637 transitions. [2021-06-04 23:39:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-04 23:39:14,076 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:39:14,076 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:39:14,076 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-04 23:39:14,076 INFO L430 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:39:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:39:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2053869980, now seen corresponding path program 1 times [2021-06-04 23:39:14,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:39:14,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221518174] [2021-06-04 23:39:14,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:39:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:39:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:39:14,179 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:39:14,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221518174] [2021-06-04 23:39:14,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221518174] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:39:14,179 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:39:14,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-04 23:39:14,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437034824] [2021-06-04 23:39:14,179 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-04 23:39:14,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:39:14,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-04 23:39:14,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-04 23:39:14,180 INFO L87 Difference]: Start difference. First operand 22617 states and 85637 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-06-04 23:39:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:39:14,705 INFO L93 Difference]: Finished difference Result 19539 states and 73298 transitions. [2021-06-04 23:39:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 23:39:14,706 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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 95 [2021-06-04 23:39:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:39:14,736 INFO L225 Difference]: With dead ends: 19539 [2021-06-04 23:39:14,736 INFO L226 Difference]: Without dead ends: 11109 [2021-06-04 23:39:14,737 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 117.0ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-04 23:39:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2021-06-04 23:39:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 8409. [2021-06-04 23:39:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8409 states, 8408 states have (on average 3.681374881065652) internal successors, (30953), 8408 states have internal predecessors, (30953), 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-06-04 23:39:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8409 states to 8409 states and 30953 transitions. [2021-06-04 23:39:14,915 INFO L78 Accepts]: Start accepts. Automaton has 8409 states and 30953 transitions. Word has length 95 [2021-06-04 23:39:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:39:14,915 INFO L482 AbstractCegarLoop]: Abstraction has 8409 states and 30953 transitions. [2021-06-04 23:39:14,915 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-06-04 23:39:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 8409 states and 30953 transitions. [2021-06-04 23:39:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-04 23:39:14,928 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:39:14,928 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:39:14,928 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-04 23:39:14,928 INFO L430 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:39:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:39:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash -69346214, now seen corresponding path program 1 times [2021-06-04 23:39:14,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:39:14,929 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943815252] [2021-06-04 23:39:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:39:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:39:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:39:15,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:39:15,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943815252] [2021-06-04 23:39:15,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943815252] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:39:15,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:39:15,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-04 23:39:15,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299584307] [2021-06-04 23:39:15,022 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-04 23:39:15,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:39:15,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-04 23:39:15,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-04 23:39:15,023 INFO L87 Difference]: Start difference. First operand 8409 states and 30953 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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-06-04 23:39:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:39:15,146 INFO L93 Difference]: Finished difference Result 11097 states and 40884 transitions. [2021-06-04 23:39:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-04 23:39:15,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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 99 [2021-06-04 23:39:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:39:15,156 INFO L225 Difference]: With dead ends: 11097 [2021-06-04 23:39:15,156 INFO L226 Difference]: Without dead ends: 3580 [2021-06-04 23:39:15,156 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:39:15,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2021-06-04 23:39:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3580. [2021-06-04 23:39:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 3579 states have (on average 3.542889075160659) internal successors, (12680), 3579 states have internal predecessors, (12680), 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-06-04 23:39:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 12680 transitions. [2021-06-04 23:39:15,227 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 12680 transitions. Word has length 99 [2021-06-04 23:39:15,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:39:15,228 INFO L482 AbstractCegarLoop]: Abstraction has 3580 states and 12680 transitions. [2021-06-04 23:39:15,228 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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-06-04 23:39:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 12680 transitions. [2021-06-04 23:39:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-04 23:39:15,234 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:39:15,234 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:39:15,234 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-04 23:39:15,234 INFO L430 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:39:15,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:39:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2126838646, now seen corresponding path program 2 times [2021-06-04 23:39:15,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:39:15,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973918152] [2021-06-04 23:39:15,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:39:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:39:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:39:15,526 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:39:15,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973918152] [2021-06-04 23:39:15,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973918152] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:39:15,526 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:39:15,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-04 23:39:15,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77395002] [2021-06-04 23:39:15,527 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-04 23:39:15,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:39:15,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-04 23:39:15,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-06-04 23:39:15,528 INFO L87 Difference]: Start difference. First operand 3580 states and 12680 transitions. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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-06-04 23:39:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:39:15,836 INFO L93 Difference]: Finished difference Result 5590 states and 20170 transitions. [2021-06-04 23:39:15,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-04 23:39:15,836 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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 99 [2021-06-04 23:39:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:39:15,844 INFO L225 Difference]: With dead ends: 5590 [2021-06-04 23:39:15,844 INFO L226 Difference]: Without dead ends: 3060 [2021-06-04 23:39:15,845 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 316.4ms TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-06-04 23:39:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2021-06-04 23:39:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 3060. [2021-06-04 23:39:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3059 states have (on average 3.5697940503432495) internal successors, (10920), 3059 states have internal predecessors, (10920), 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-06-04 23:39:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 10920 transitions. [2021-06-04 23:39:15,903 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 10920 transitions. Word has length 99 [2021-06-04 23:39:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:39:15,903 INFO L482 AbstractCegarLoop]: Abstraction has 3060 states and 10920 transitions. [2021-06-04 23:39:15,903 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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-06-04 23:39:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 10920 transitions. [2021-06-04 23:39:15,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-04 23:39:15,908 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:39:15,909 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 23:39:15,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-04 23:39:15,909 INFO L430 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 23:39:15,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:39:15,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1615752566, now seen corresponding path program 3 times [2021-06-04 23:39:15,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:39:15,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566386075] [2021-06-04 23:39:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:39:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-04 23:39:15,938 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-04 23:39:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-04 23:39:15,987 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-04 23:39:16,040 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-04 23:39:16,041 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-04 23:39:16,041 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-04 23:39:16,044 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-04 23:39:16,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 11:39:16 BasicIcfg [2021-06-04 23:39:16,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-04 23:39:16,210 INFO L168 Benchmark]: Toolchain (without parser) took 90195.72 ms. Allocated memory was 346.0 MB in the beginning and 15.6 GB in the end (delta: 15.2 GB). Free memory was 308.6 MB in the beginning and 7.9 GB in the end (delta: -7.6 GB). Peak memory consumption was 7.7 GB. Max. memory is 16.0 GB. [2021-06-04 23:39:16,210 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 346.0 MB. Free memory is still 326.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-04 23:39:16,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.99 ms. Allocated memory is still 346.0 MB. Free memory was 308.3 MB in the beginning and 303.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-06-04 23:39:16,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.11 ms. Allocated memory is still 346.0 MB. Free memory was 303.5 MB in the beginning and 300.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-04 23:39:16,210 INFO L168 Benchmark]: Boogie Preprocessor took 29.39 ms. Allocated memory is still 346.0 MB. Free memory was 300.4 MB in the beginning and 298.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-04 23:39:16,210 INFO L168 Benchmark]: RCFGBuilder took 1900.28 ms. Allocated memory is still 346.0 MB. Free memory was 298.3 MB in the beginning and 263.4 MB in the end (delta: 34.9 MB). Peak memory consumption was 180.6 MB. Max. memory is 16.0 GB. [2021-06-04 23:39:16,210 INFO L168 Benchmark]: TraceAbstraction took 87619.42 ms. Allocated memory was 346.0 MB in the beginning and 15.6 GB in the end (delta: 15.2 GB). Free memory was 262.3 MB in the beginning and 7.9 GB in the end (delta: -7.6 GB). Peak memory consumption was 7.6 GB. Max. memory is 16.0 GB. [2021-06-04 23:39:16,211 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.15 ms. Allocated memory is still 346.0 MB. Free memory is still 326.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 589.99 ms. Allocated memory is still 346.0 MB. Free memory was 308.3 MB in the beginning and 303.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 51.11 ms. Allocated memory is still 346.0 MB. Free memory was 303.5 MB in the beginning and 300.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.39 ms. Allocated memory is still 346.0 MB. Free memory was 300.4 MB in the beginning and 298.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1900.28 ms. Allocated memory is still 346.0 MB. Free memory was 298.3 MB in the beginning and 263.4 MB in the end (delta: 34.9 MB). Peak memory consumption was 180.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 87619.42 ms. Allocated memory was 346.0 MB in the beginning and 15.6 GB in the end (delta: 15.2 GB). Free memory was 262.3 MB in the beginning and 7.9 GB in the end (delta: -7.6 GB). Peak memory consumption was 7.6 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L725] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L726] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L727] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L728] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L729] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L730] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L731] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L736] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L737] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L738] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L739] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L740] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L741] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L742] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t577; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t578; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t579; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t580; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 87360.5ms, OverallIterations: 21, TraceHistogramMax: 1, EmptinessCheckTime: 2189.6ms, AutomataDifference: 20568.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27921.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3633 SDtfs, 6396 SDslu, 15951 SDs, 0 SdLazy, 1847 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2148.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 3724.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135557occurred in iteration=0, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 31496.3ms AutomataMinimizationTime, 20 MinimizatonAttempts, 29899 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 67.7ms SsaConstructionTime, 1027.9ms SatisfiabilityAnalysisTime, 3657.6ms InterpolantComputationTime, 1850 NumberOfCodeBlocks, 1850 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1731 ConstructedInterpolants, 0 QuantifiedInterpolants, 11139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...