/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/mix029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-04 23:43:36,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-04 23:43:36,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-04 23:43:36,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-04 23:43:36,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-04 23:43:36,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-04 23:43:36,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-04 23:43:36,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-04 23:43:36,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-04 23:43:36,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-04 23:43:36,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-04 23:43:36,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-04 23:43:36,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-04 23:43:36,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-04 23:43:36,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-04 23:43:36,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-04 23:43:36,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-04 23:43:36,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-04 23:43:36,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-04 23:43:36,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-04 23:43:36,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-04 23:43:36,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-04 23:43:36,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-04 23:43:36,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-04 23:43:36,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-04 23:43:36,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-04 23:43:36,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-04 23:43:36,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-04 23:43:36,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-04 23:43:36,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-04 23:43:36,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-04 23:43:36,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-04 23:43:36,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-04 23:43:36,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-04 23:43:36,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-04 23:43:36,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-04 23:43:36,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-04 23:43:36,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-04 23:43:36,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-04 23:43:36,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-04 23:43:36,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-04 23:43:36,449 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:43:36,486 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-04 23:43:36,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-04 23:43:36,487 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-04 23:43:36,487 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-04 23:43:36,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-04 23:43:36,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-04 23:43:36,489 INFO L138 SettingsManager]: * Use SBE=true [2021-06-04 23:43:36,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-04 23:43:36,489 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-04 23:43:36,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-04 23:43:36,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-04 23:43:36,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-04 23:43:36,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-04 23:43:36,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-04 23:43:36,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-04 23:43:36,490 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-04 23:43:36,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-04 23:43:36,491 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-04 23:43:36,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-04 23:43:36,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-04 23:43:36,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-04 23:43:36,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-04 23:43:36,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-04 23:43:36,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-04 23:43:36,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-04 23:43:36,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-04 23:43:36,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-04 23:43:36,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-04 23:43:36,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-04 23:43:36,492 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-04 23:43:36,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-04 23:43:36,492 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:43:36,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-04 23:43:36,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-04 23:43:36,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-04 23:43:36,738 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-04 23:43:36,738 INFO L275 PluginConnector]: CDTParser initialized [2021-06-04 23:43:36,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt.i [2021-06-04 23:43:36,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56bbc839/6f763a6953084d578ab25e941ea3a142/FLAG124a5396b [2021-06-04 23:43:37,239 INFO L306 CDTParser]: Found 1 translation units. [2021-06-04 23:43:37,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt.i [2021-06-04 23:43:37,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56bbc839/6f763a6953084d578ab25e941ea3a142/FLAG124a5396b [2021-06-04 23:43:37,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56bbc839/6f763a6953084d578ab25e941ea3a142 [2021-06-04 23:43:37,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-04 23:43:37,293 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-04 23:43:37,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-04 23:43:37,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-04 23:43:37,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-04 23:43:37,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 11:43:37" (1/1) ... [2021-06-04 23:43:37,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c39c5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:43:37, skipping insertion in model container [2021-06-04 23:43:37,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 11:43:37" (1/1) ... [2021-06-04 23:43:37,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-04 23:43:37,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-04 23:43:37,485 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/mix029_power.opt.i[950,963] [2021-06-04 23:43:37,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 23:43:37,613 INFO L203 MainTranslator]: Completed pre-run [2021-06-04 23:43:37,620 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/mix029_power.opt.i[950,963] [2021-06-04 23:43:37,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 23:43:37,723 INFO L208 MainTranslator]: Completed translation [2021-06-04 23:43:37,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:43:37 WrapperNode [2021-06-04 23:43:37,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-04 23:43:37,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-04 23:43:37,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-04 23:43:37,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-04 23:43:37,729 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:43:37" (1/1) ... [2021-06-04 23:43:37,750 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:43:37" (1/1) ... [2021-06-04 23:43:37,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-04 23:43:37,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-04 23:43:37,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-04 23:43:37,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-04 23:43:37,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:43:37" (1/1) ... [2021-06-04 23:43:37,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:43:37" (1/1) ... [2021-06-04 23:43:37,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:43:37" (1/1) ... [2021-06-04 23:43:37,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:43:37" (1/1) ... [2021-06-04 23:43:37,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:43:37" (1/1) ... [2021-06-04 23:43:37,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:43:37" (1/1) ... [2021-06-04 23:43:37,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:43:37" (1/1) ... [2021-06-04 23:43:37,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-04 23:43:37,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-04 23:43:37,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-04 23:43:37,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-04 23:43:37,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:43:37" (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:43:37,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-04 23:43:37,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-04 23:43:37,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-04 23:43:37,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-04 23:43:37,858 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-04 23:43:37,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-04 23:43:37,858 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-04 23:43:37,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-04 23:43:37,858 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-04 23:43:37,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-04 23:43:37,858 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-04 23:43:37,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-04 23:43:37,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-04 23:43:37,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-04 23:43:37,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-04 23:43:37,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-04 23:43:37,860 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:43:39,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-04 23:43:39,249 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-04 23:43:39,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 11:43:39 BoogieIcfgContainer [2021-06-04 23:43:39,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-04 23:43:39,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-04 23:43:39,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-04 23:43:39,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-04 23:43:39,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 11:43:37" (1/3) ... [2021-06-04 23:43:39,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1382f6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 11:43:39, skipping insertion in model container [2021-06-04 23:43:39,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 11:43:37" (2/3) ... [2021-06-04 23:43:39,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1382f6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 11:43:39, skipping insertion in model container [2021-06-04 23:43:39,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 11:43:39" (3/3) ... [2021-06-04 23:43:39,255 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_power.opt.i [2021-06-04 23:43:39,262 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-04 23:43:39,262 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-04 23:43:39,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-04 23:43:39,262 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-04 23:43:39,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,288 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,288 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,289 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,289 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,290 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,290 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,296 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,296 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,296 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,296 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,299 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,299 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,299 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,299 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,308 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,308 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,309 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,310 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,312 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,312 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,312 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,313 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 23:43:39,314 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-04 23:43:39,327 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-04 23:43:39,346 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-04 23:43:39,346 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-04 23:43:39,346 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-04 23:43:39,347 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-04 23:43:39,347 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-04 23:43:39,347 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-04 23:43:39,347 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-04 23:43:39,347 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-04 23:43:39,353 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 128 transitions, 276 flow [2021-06-04 23:44:02,740 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:44:02,935 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:44:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-04 23:44:02,946 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:02,947 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:44:02,947 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:44:02,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:02,955 INFO L82 PathProgramCache]: Analyzing trace with hash -803804790, now seen corresponding path program 1 times [2021-06-04 23:44:02,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:02,961 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483001751] [2021-06-04 23:44:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:03,191 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:44:03,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:03,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483001751] [2021-06-04 23:44:03,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483001751] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:03,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:03,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-04 23:44:03,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920349890] [2021-06-04 23:44:03,197 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 23:44:03,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:03,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 23:44:03,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 23:44:03,398 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:44:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:04,921 INFO L93 Difference]: Finished difference Result 116517 states and 516070 transitions. [2021-06-04 23:44:04,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 23:44:04,923 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:44:04,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:05,350 INFO L225 Difference]: With dead ends: 116517 [2021-06-04 23:44:05,350 INFO L226 Difference]: Without dead ends: 64101 [2021-06-04 23:44:05,351 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 23:44:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64101 states. [2021-06-04 23:44:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64101 to 64101. [2021-06-04 23:44:07,580 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:44:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64101 states to 64101 states and 280406 transitions. [2021-06-04 23:44:08,136 INFO L78 Accepts]: Start accepts. Automaton has 64101 states and 280406 transitions. Word has length 60 [2021-06-04 23:44:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:08,138 INFO L482 AbstractCegarLoop]: Abstraction has 64101 states and 280406 transitions. [2021-06-04 23:44:08,138 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:44:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 64101 states and 280406 transitions. [2021-06-04 23:44:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-04 23:44:08,210 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:08,211 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:44:08,211 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-04 23:44:08,211 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:44:08,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:08,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2144397672, now seen corresponding path program 1 times [2021-06-04 23:44:08,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:08,215 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943226061] [2021-06-04 23:44:08,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:08,388 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:44:08,388 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:08,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943226061] [2021-06-04 23:44:08,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943226061] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:08,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:08,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:44:08,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871655947] [2021-06-04 23:44:08,389 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:44:08,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:08,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:44:08,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:44:08,390 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:44:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:09,014 INFO L93 Difference]: Finished difference Result 72165 states and 313078 transitions. [2021-06-04 23:44:09,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:44:09,015 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:44:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:09,208 INFO L225 Difference]: With dead ends: 72165 [2021-06-04 23:44:09,209 INFO L226 Difference]: Without dead ends: 56037 [2021-06-04 23:44:09,209 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 59.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:44:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2021-06-04 23:44:10,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 56037. [2021-06-04 23:44:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56037 states, 56036 states have (on average 4.341030765936184) internal successors, (243254), 56036 states have internal predecessors, (243254), 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:44:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56037 states to 56037 states and 243254 transitions. [2021-06-04 23:44:11,017 INFO L78 Accepts]: Start accepts. Automaton has 56037 states and 243254 transitions. Word has length 79 [2021-06-04 23:44:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:11,017 INFO L482 AbstractCegarLoop]: Abstraction has 56037 states and 243254 transitions. [2021-06-04 23:44:11,017 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:44:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 56037 states and 243254 transitions. [2021-06-04 23:44:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-04 23:44:11,064 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:11,064 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] [2021-06-04 23:44:11,065 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-04 23:44:11,065 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:44:11,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:11,065 INFO L82 PathProgramCache]: Analyzing trace with hash 758644152, now seen corresponding path program 1 times [2021-06-04 23:44:11,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:11,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069925650] [2021-06-04 23:44:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:11,208 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:44:11,208 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:11,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069925650] [2021-06-04 23:44:11,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069925650] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:11,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:11,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 23:44:11,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120262993] [2021-06-04 23:44:11,209 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 23:44:11,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:11,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 23:44:11,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-04 23:44:11,209 INFO L87 Difference]: Start difference. First operand 56037 states and 243254 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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:44:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:12,043 INFO L93 Difference]: Finished difference Result 65781 states and 283582 transitions. [2021-06-04 23:44:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 23:44:12,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 82 [2021-06-04 23:44:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:12,255 INFO L225 Difference]: With dead ends: 65781 [2021-06-04 23:44:12,255 INFO L226 Difference]: Without dead ends: 55029 [2021-06-04 23:44:12,256 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 177.1ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-06-04 23:44:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55029 states. [2021-06-04 23:44:13,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55029 to 55029. [2021-06-04 23:44:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55029 states, 55028 states have (on average 4.331576651886312) internal successors, (238358), 55028 states have internal predecessors, (238358), 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:44:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55029 states to 55029 states and 238358 transitions. [2021-06-04 23:44:13,908 INFO L78 Accepts]: Start accepts. Automaton has 55029 states and 238358 transitions. Word has length 82 [2021-06-04 23:44:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:13,908 INFO L482 AbstractCegarLoop]: Abstraction has 55029 states and 238358 transitions. [2021-06-04 23:44:13,908 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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:44:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 55029 states and 238358 transitions. [2021-06-04 23:44:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-04 23:44:13,974 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:13,974 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:44:13,974 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-04 23:44:13,974 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:44:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1235717177, now seen corresponding path program 1 times [2021-06-04 23:44:13,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:13,975 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837991486] [2021-06-04 23:44:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:14,160 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:44:14,161 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:14,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837991486] [2021-06-04 23:44:14,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837991486] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:14,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:14,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-04 23:44:14,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364880554] [2021-06-04 23:44:14,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-04 23:44:14,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:14,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-04 23:44:14,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-06-04 23:44:14,163 INFO L87 Difference]: Start difference. First operand 55029 states and 238358 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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:44:15,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:15,088 INFO L93 Difference]: Finished difference Result 62911 states and 271098 transitions. [2021-06-04 23:44:15,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-04 23:44:15,093 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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:44:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:15,261 INFO L225 Difference]: With dead ends: 62911 [2021-06-04 23:44:15,261 INFO L226 Difference]: Without dead ends: 55743 [2021-06-04 23:44:15,261 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 204.0ms TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2021-06-04 23:44:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55743 states. [2021-06-04 23:44:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55743 to 54021. [2021-06-04 23:44:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54021 states, 54020 states have (on average 4.326434653831914) internal successors, (233714), 54020 states have internal predecessors, (233714), 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:44:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54021 states to 54021 states and 233714 transitions. [2021-06-04 23:44:17,165 INFO L78 Accepts]: Start accepts. Automaton has 54021 states and 233714 transitions. Word has length 84 [2021-06-04 23:44:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:17,165 INFO L482 AbstractCegarLoop]: Abstraction has 54021 states and 233714 transitions. [2021-06-04 23:44:17,166 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 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:44:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 54021 states and 233714 transitions. [2021-06-04 23:44:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-04 23:44:17,227 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:17,227 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:44:17,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-04 23:44:17,227 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:44:17,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:17,228 INFO L82 PathProgramCache]: Analyzing trace with hash -659540979, now seen corresponding path program 1 times [2021-06-04 23:44:17,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:17,228 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914763233] [2021-06-04 23:44:17,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:17,384 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:44:17,384 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:17,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914763233] [2021-06-04 23:44:17,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914763233] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:17,384 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:17,384 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 23:44:17,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758898261] [2021-06-04 23:44:17,385 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 23:44:17,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:17,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 23:44:17,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:44:17,386 INFO L87 Difference]: Start difference. First operand 54021 states and 233714 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 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:44:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:18,538 INFO L93 Difference]: Finished difference Result 70261 states and 302990 transitions. [2021-06-04 23:44:18,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-04 23:44:18,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 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:44:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:18,740 INFO L225 Difference]: With dead ends: 70261 [2021-06-04 23:44:18,741 INFO L226 Difference]: Without dead ends: 61077 [2021-06-04 23:44:18,741 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 335.7ms TimeCoverageRelationStatistics Valid=204, Invalid=396, Unknown=0, NotChecked=0, Total=600 [2021-06-04 23:44:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61077 states. [2021-06-04 23:44:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61077 to 59229. [2021-06-04 23:44:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59229 states, 59228 states have (on average 4.318970757074356) internal successors, (255804), 59228 states have internal predecessors, (255804), 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:44:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59229 states to 59229 states and 255804 transitions. [2021-06-04 23:44:20,778 INFO L78 Accepts]: Start accepts. Automaton has 59229 states and 255804 transitions. Word has length 85 [2021-06-04 23:44:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:20,778 INFO L482 AbstractCegarLoop]: Abstraction has 59229 states and 255804 transitions. [2021-06-04 23:44:20,778 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 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:44:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 59229 states and 255804 transitions. [2021-06-04 23:44:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-04 23:44:20,853 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:20,854 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:44:20,854 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-04 23:44:20,854 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:44:20,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:20,854 INFO L82 PathProgramCache]: Analyzing trace with hash -657463441, now seen corresponding path program 1 times [2021-06-04 23:44:20,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:20,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665781970] [2021-06-04 23:44:20,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:21,079 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:44:21,080 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:21,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665781970] [2021-06-04 23:44:21,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665781970] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:21,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:21,080 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-04 23:44:21,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709493170] [2021-06-04 23:44:21,080 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-04 23:44:21,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:21,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-04 23:44:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-06-04 23:44:21,081 INFO L87 Difference]: Start difference. First operand 59229 states and 255804 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 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:44:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:21,952 INFO L93 Difference]: Finished difference Result 63597 states and 273184 transitions. [2021-06-04 23:44:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-04 23:44:21,953 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 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:44:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:22,142 INFO L225 Difference]: With dead ends: 63597 [2021-06-04 23:44:22,143 INFO L226 Difference]: Without dead ends: 58221 [2021-06-04 23:44:22,143 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 230.9ms TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-06-04 23:44:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58221 states. [2021-06-04 23:44:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58221 to 58221. [2021-06-04 23:44:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58221 states, 58220 states have (on average 4.313981449673651) internal successors, (251160), 58220 states have internal predecessors, (251160), 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:44:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58221 states to 58221 states and 251160 transitions. [2021-06-04 23:44:23,704 INFO L78 Accepts]: Start accepts. Automaton has 58221 states and 251160 transitions. Word has length 86 [2021-06-04 23:44:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:23,704 INFO L482 AbstractCegarLoop]: Abstraction has 58221 states and 251160 transitions. [2021-06-04 23:44:23,704 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 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:44:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 58221 states and 251160 transitions. [2021-06-04 23:44:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-04 23:44:23,780 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:23,780 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:44:23,781 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-04 23:44:23,781 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:44:23,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:23,781 INFO L82 PathProgramCache]: Analyzing trace with hash 57444433, now seen corresponding path program 1 times [2021-06-04 23:44:23,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:23,781 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610502971] [2021-06-04 23:44:23,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:23,844 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:44:23,845 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:23,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610502971] [2021-06-04 23:44:23,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610502971] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:23,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:23,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:44:23,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579927955] [2021-06-04 23:44:23,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:44:23,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:23,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:44:23,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:44:23,846 INFO L87 Difference]: Start difference. First operand 58221 states and 251160 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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:44:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:24,733 INFO L93 Difference]: Finished difference Result 90673 states and 389632 transitions. [2021-06-04 23:44:24,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-04 23:44:24,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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:44:24,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:24,912 INFO L225 Difference]: With dead ends: 90673 [2021-06-04 23:44:24,912 INFO L226 Difference]: Without dead ends: 60069 [2021-06-04 23:44:24,912 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-06-04 23:44:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60069 states. [2021-06-04 23:44:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60069 to 54189. [2021-06-04 23:44:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54189 states, 54188 states have (on average 4.216726950616373) internal successors, (228496), 54188 states have internal predecessors, (228496), 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:44:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54189 states to 54189 states and 228496 transitions. [2021-06-04 23:44:26,466 INFO L78 Accepts]: Start accepts. Automaton has 54189 states and 228496 transitions. Word has length 86 [2021-06-04 23:44:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:26,467 INFO L482 AbstractCegarLoop]: Abstraction has 54189 states and 228496 transitions. [2021-06-04 23:44:26,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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:44:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 54189 states and 228496 transitions. [2021-06-04 23:44:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-04 23:44:26,867 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:26,867 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:44:26,867 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-04 23:44:26,867 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:44:26,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:26,867 INFO L82 PathProgramCache]: Analyzing trace with hash -896962253, now seen corresponding path program 2 times [2021-06-04 23:44:26,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:26,868 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197845682] [2021-06-04 23:44:26,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:27,014 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:44:27,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:27,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197845682] [2021-06-04 23:44:27,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197845682] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:27,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:27,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 23:44:27,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560286716] [2021-06-04 23:44:27,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 23:44:27,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:27,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 23:44:27,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 23:44:27,015 INFO L87 Difference]: Start difference. First operand 54189 states and 228496 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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:44:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:27,388 INFO L93 Difference]: Finished difference Result 67237 states and 279624 transitions. [2021-06-04 23:44:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 23:44:27,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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:44:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:27,523 INFO L225 Difference]: With dead ends: 67237 [2021-06-04 23:44:27,524 INFO L226 Difference]: Without dead ends: 49653 [2021-06-04 23:44:27,524 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 54.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:44:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49653 states. [2021-06-04 23:44:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49653 to 49653. [2021-06-04 23:44:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49653 states, 49652 states have (on average 4.158704583903972) internal successors, (206488), 49652 states have internal predecessors, (206488), 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:44:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49653 states to 49653 states and 206488 transitions. [2021-06-04 23:44:28,979 INFO L78 Accepts]: Start accepts. Automaton has 49653 states and 206488 transitions. Word has length 86 [2021-06-04 23:44:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:28,979 INFO L482 AbstractCegarLoop]: Abstraction has 49653 states and 206488 transitions. [2021-06-04 23:44:28,979 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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:44:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 49653 states and 206488 transitions. [2021-06-04 23:44:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-04 23:44:29,042 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:29,042 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:44:29,042 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-04 23:44:29,042 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:44:29,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:29,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1707861447, now seen corresponding path program 1 times [2021-06-04 23:44:29,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:29,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611258982] [2021-06-04 23:44:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:29,108 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:44:29,108 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:29,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611258982] [2021-06-04 23:44:29,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611258982] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:29,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:29,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-04 23:44:29,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996994314] [2021-06-04 23:44:29,109 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-04 23:44:29,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:29,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-04 23:44:29,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-04 23:44:29,109 INFO L87 Difference]: Start difference. First operand 49653 states and 206488 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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:44:29,549 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-06-04 23:44:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:29,756 INFO L93 Difference]: Finished difference Result 51603 states and 209654 transitions. [2021-06-04 23:44:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-04 23:44:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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:44:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:29,845 INFO L225 Difference]: With dead ends: 51603 [2021-06-04 23:44:29,845 INFO L226 Difference]: Without dead ends: 36675 [2021-06-04 23:44:29,845 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 371.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-04 23:44:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36675 states. [2021-06-04 23:44:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36675 to 36675. [2021-06-04 23:44:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36675 states, 36674 states have (on average 4.0260675137699735) internal successors, (147652), 36674 states have internal predecessors, (147652), 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:44:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36675 states to 36675 states and 147652 transitions. [2021-06-04 23:44:30,904 INFO L78 Accepts]: Start accepts. Automaton has 36675 states and 147652 transitions. Word has length 87 [2021-06-04 23:44:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:30,905 INFO L482 AbstractCegarLoop]: Abstraction has 36675 states and 147652 transitions. [2021-06-04 23:44:30,905 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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:44:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 36675 states and 147652 transitions. [2021-06-04 23:44:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-06-04 23:44:30,954 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:30,954 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] [2021-06-04 23:44:30,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-04 23:44:30,954 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:44:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash 869707430, now seen corresponding path program 1 times [2021-06-04 23:44:30,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:30,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881505007] [2021-06-04 23:44:30,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:31,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:44:31,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:31,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881505007] [2021-06-04 23:44:31,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881505007] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:31,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:31,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 23:44:31,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391959747] [2021-06-04 23:44:31,022 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 23:44:31,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:31,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 23:44:31,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-04 23:44:31,022 INFO L87 Difference]: Start difference. First operand 36675 states and 147652 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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:44:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:31,257 INFO L93 Difference]: Finished difference Result 32013 states and 126226 transitions. [2021-06-04 23:44:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-04 23:44:31,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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 90 [2021-06-04 23:44:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:31,312 INFO L225 Difference]: With dead ends: 32013 [2021-06-04 23:44:31,312 INFO L226 Difference]: Without dead ends: 23877 [2021-06-04 23:44:31,312 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 72.8ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-04 23:44:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23877 states. [2021-06-04 23:44:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23877 to 21861. [2021-06-04 23:44:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21861 states, 21860 states have (on average 3.908508691674291) internal successors, (85440), 21860 states have internal predecessors, (85440), 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:44:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21861 states to 21861 states and 85440 transitions. [2021-06-04 23:44:31,711 INFO L78 Accepts]: Start accepts. Automaton has 21861 states and 85440 transitions. Word has length 90 [2021-06-04 23:44:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:31,712 INFO L482 AbstractCegarLoop]: Abstraction has 21861 states and 85440 transitions. [2021-06-04 23:44:31,712 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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:44:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 21861 states and 85440 transitions. [2021-06-04 23:44:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-06-04 23:44:32,004 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:32,004 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] [2021-06-04 23:44:32,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-04 23:44:32,004 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:44:32,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:32,005 INFO L82 PathProgramCache]: Analyzing trace with hash -567007960, now seen corresponding path program 1 times [2021-06-04 23:44:32,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:32,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044943160] [2021-06-04 23:44:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:32,083 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:44:32,083 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:32,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044943160] [2021-06-04 23:44:32,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044943160] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:32,083 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:32,083 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-04 23:44:32,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015850666] [2021-06-04 23:44:32,083 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-04 23:44:32,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:32,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-04 23:44:32,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-04 23:44:32,084 INFO L87 Difference]: Start difference. First operand 21861 states and 85440 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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:44:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:32,257 INFO L93 Difference]: Finished difference Result 31443 states and 122287 transitions. [2021-06-04 23:44:32,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-04 23:44:32,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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 94 [2021-06-04 23:44:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:32,306 INFO L225 Difference]: With dead ends: 31443 [2021-06-04 23:44:32,306 INFO L226 Difference]: Without dead ends: 21951 [2021-06-04 23:44:32,307 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:44:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21951 states. [2021-06-04 23:44:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21951 to 21141. [2021-06-04 23:44:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21141 states, 21140 states have (on average 3.8452223273415327) internal successors, (81288), 21140 states have internal predecessors, (81288), 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:44:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21141 states to 21141 states and 81288 transitions. [2021-06-04 23:44:32,673 INFO L78 Accepts]: Start accepts. Automaton has 21141 states and 81288 transitions. Word has length 94 [2021-06-04 23:44:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:32,674 INFO L482 AbstractCegarLoop]: Abstraction has 21141 states and 81288 transitions. [2021-06-04 23:44:32,674 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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:44:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 21141 states and 81288 transitions. [2021-06-04 23:44:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-06-04 23:44:32,702 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:32,703 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] [2021-06-04 23:44:32,703 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-04 23:44:32,703 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:44:32,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:32,703 INFO L82 PathProgramCache]: Analyzing trace with hash 100154524, now seen corresponding path program 2 times [2021-06-04 23:44:32,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:32,703 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495030754] [2021-06-04 23:44:32,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 23:44:32,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:32,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495030754] [2021-06-04 23:44:32,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495030754] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:32,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:32,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-04 23:44:32,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093009114] [2021-06-04 23:44:32,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-04 23:44:32,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:32,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-04 23:44:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-04 23:44:32,779 INFO L87 Difference]: Start difference. First operand 21141 states and 81288 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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:44:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:32,956 INFO L93 Difference]: Finished difference Result 18009 states and 68679 transitions. [2021-06-04 23:44:32,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 23:44:32,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 94 [2021-06-04 23:44:32,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:32,973 INFO L225 Difference]: With dead ends: 18009 [2021-06-04 23:44:32,973 INFO L226 Difference]: Without dead ends: 7822 [2021-06-04 23:44:32,973 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 78.7ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-04 23:44:32,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7822 states. [2021-06-04 23:44:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7822 to 7486. [2021-06-04 23:44:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7486 states, 7485 states have (on average 3.782231128924516) internal successors, (28310), 7485 states have internal predecessors, (28310), 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:44:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7486 states to 7486 states and 28310 transitions. [2021-06-04 23:44:33,289 INFO L78 Accepts]: Start accepts. Automaton has 7486 states and 28310 transitions. Word has length 94 [2021-06-04 23:44:33,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:33,289 INFO L482 AbstractCegarLoop]: Abstraction has 7486 states and 28310 transitions. [2021-06-04 23:44:33,289 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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:44:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 7486 states and 28310 transitions. [2021-06-04 23:44:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-04 23:44:33,301 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:33,301 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:44:33,302 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-04 23:44:33,302 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:44:33,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:33,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1542824982, now seen corresponding path program 1 times [2021-06-04 23:44:33,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:33,302 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876859902] [2021-06-04 23:44:33,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:33,384 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:44:33,384 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:33,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876859902] [2021-06-04 23:44:33,385 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876859902] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:33,385 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:33,385 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-04 23:44:33,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448568842] [2021-06-04 23:44:33,385 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-04 23:44:33,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:33,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-04 23:44:33,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-04 23:44:33,386 INFO L87 Difference]: Start difference. First operand 7486 states and 28310 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:44:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:33,481 INFO L93 Difference]: Finished difference Result 10096 states and 38210 transitions. [2021-06-04 23:44:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-04 23:44:33,482 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:44:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:33,492 INFO L225 Difference]: With dead ends: 10096 [2021-06-04 23:44:33,492 INFO L226 Difference]: Without dead ends: 4444 [2021-06-04 23:44:33,492 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-04 23:44:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4444 states. [2021-06-04 23:44:33,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4444 to 4444. [2021-06-04 23:44:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4444 states, 4443 states have (on average 3.696601395453522) internal successors, (16424), 4443 states have internal predecessors, (16424), 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:44:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 16424 transitions. [2021-06-04 23:44:33,570 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 16424 transitions. Word has length 99 [2021-06-04 23:44:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:33,571 INFO L482 AbstractCegarLoop]: Abstraction has 4444 states and 16424 transitions. [2021-06-04 23:44:33,571 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:44:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 16424 transitions. [2021-06-04 23:44:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-04 23:44:33,577 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:33,577 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:44:33,577 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-04 23:44:33,578 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:44:33,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:33,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2126838646, now seen corresponding path program 2 times [2021-06-04 23:44:33,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:33,578 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839944411] [2021-06-04 23:44:33,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 23:44:33,816 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:44:33,816 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 23:44:33,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839944411] [2021-06-04 23:44:33,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839944411] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 23:44:33,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 23:44:33,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-04 23:44:33,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483357971] [2021-06-04 23:44:33,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-04 23:44:33,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 23:44:33,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-04 23:44:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-06-04 23:44:33,818 INFO L87 Difference]: Start difference. First operand 4444 states and 16424 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:44:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 23:44:34,011 INFO L93 Difference]: Finished difference Result 6454 states and 23914 transitions. [2021-06-04 23:44:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-04 23:44:34,011 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:44:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 23:44:34,018 INFO L225 Difference]: With dead ends: 6454 [2021-06-04 23:44:34,018 INFO L226 Difference]: Without dead ends: 3060 [2021-06-04 23:44:34,019 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 177.4ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-06-04 23:44:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2021-06-04 23:44:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 3060. [2021-06-04 23:44:34,062 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:44:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 10920 transitions. [2021-06-04 23:44:34,070 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 10920 transitions. Word has length 99 [2021-06-04 23:44:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 23:44:34,070 INFO L482 AbstractCegarLoop]: Abstraction has 3060 states and 10920 transitions. [2021-06-04 23:44:34,070 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:44:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 10920 transitions. [2021-06-04 23:44:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-04 23:44:34,075 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 23:44:34,075 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:44:34,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-04 23:44:34,075 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:44:34,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 23:44:34,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1615752566, now seen corresponding path program 3 times [2021-06-04 23:44:34,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 23:44:34,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749346719] [2021-06-04 23:44:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 23:44:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-04 23:44:34,114 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-04 23:44:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-04 23:44:34,147 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-04 23:44:34,188 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-04 23:44:34,188 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-04 23:44:34,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-04 23:44:34,190 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-04 23:44:34,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 11:44:34 BasicIcfg [2021-06-04 23:44:34,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-04 23:44:34,313 INFO L168 Benchmark]: Toolchain (without parser) took 57019.86 ms. Allocated memory was 364.9 MB in the beginning and 14.6 GB in the end (delta: 14.3 GB). Free memory was 327.0 MB in the beginning and 9.4 GB in the end (delta: -9.1 GB). Peak memory consumption was 5.2 GB. Max. memory is 16.0 GB. [2021-06-04 23:44:34,313 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 364.9 MB. Free memory is still 345.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-04 23:44:34,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.28 ms. Allocated memory is still 364.9 MB. Free memory was 326.9 MB in the beginning and 322.3 MB in the end (delta: 4.6 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-04 23:44:34,317 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.79 ms. Allocated memory is still 364.9 MB. Free memory was 322.3 MB in the beginning and 319.2 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:44:34,317 INFO L168 Benchmark]: Boogie Preprocessor took 21.86 ms. Allocated memory is still 364.9 MB. Free memory was 319.2 MB in the beginning and 317.1 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:44:34,317 INFO L168 Benchmark]: RCFGBuilder took 1458.93 ms. Allocated memory is still 364.9 MB. Free memory was 317.1 MB in the beginning and 235.3 MB in the end (delta: 81.7 MB). Peak memory consumption was 124.7 MB. Max. memory is 16.0 GB. [2021-06-04 23:44:34,318 INFO L168 Benchmark]: TraceAbstraction took 55060.76 ms. Allocated memory was 364.9 MB in the beginning and 14.6 GB in the end (delta: 14.3 GB). Free memory was 235.3 MB in the beginning and 9.4 GB in the end (delta: -9.2 GB). Peak memory consumption was 5.1 GB. Max. memory is 16.0 GB. [2021-06-04 23:44:34,318 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.12 ms. Allocated memory is still 364.9 MB. Free memory is still 345.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 428.28 ms. Allocated memory is still 364.9 MB. Free memory was 326.9 MB in the beginning and 322.3 MB in the end (delta: 4.6 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 44.79 ms. Allocated memory is still 364.9 MB. Free memory was 322.3 MB in the beginning and 319.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.86 ms. Allocated memory is still 364.9 MB. Free memory was 319.2 MB in the beginning and 317.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1458.93 ms. Allocated memory is still 364.9 MB. Free memory was 317.1 MB in the beginning and 235.3 MB in the end (delta: 81.7 MB). Peak memory consumption was 124.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 55060.76 ms. Allocated memory was 364.9 MB in the beginning and 14.6 GB in the end (delta: 14.3 GB). Free memory was 235.3 MB in the beginning and 9.4 GB in the end (delta: -9.2 GB). Peak memory consumption was 5.1 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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 t773; VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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 t774; VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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 t775; VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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 t776; VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_p0_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 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=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=2] [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_p0_EAX=0, __unbuffered_p3_EAX=2, __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=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=2] [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_p0_EAX=0, __unbuffered_p3_EAX=2, __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=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=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=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=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] [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 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __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_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=1, 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=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=1, 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=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=2, weak$$choice2=1, x=1, 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=2] - 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: 54843.7ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 1440.6ms, AutomataDifference: 10865.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 23409.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2359 SDtfs, 4294 SDslu, 9184 SDs, 0 SdLazy, 993 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 782.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1934.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135557occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 16991.5ms AutomataMinimizationTime, 14 MinimizatonAttempts, 12612 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 43.6ms SsaConstructionTime, 488.1ms SatisfiabilityAnalysisTime, 1306.6ms InterpolantComputationTime, 1310 NumberOfCodeBlocks, 1310 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1197 ConstructedInterpolants, 0 QuantifiedInterpolants, 6648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...