/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-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 09:58:11,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 09:58:11,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 09:58:11,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 09:58:11,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 09:58:11,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 09:58:11,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 09:58:11,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 09:58:11,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 09:58:11,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 09:58:11,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 09:58:11,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 09:58:11,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 09:58:11,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 09:58:11,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 09:58:11,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 09:58:11,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 09:58:11,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 09:58:11,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 09:58:11,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 09:58:11,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 09:58:11,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 09:58:11,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 09:58:11,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 09:58:11,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 09:58:11,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 09:58:11,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 09:58:11,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 09:58:11,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 09:58:11,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 09:58:11,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 09:58:11,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 09:58:11,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 09:58:11,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 09:58:11,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 09:58:11,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 09:58:11,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 09:58:11,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 09:58:11,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 09:58:11,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 09:58:11,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 09:58:11,730 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-Separate.epf [2021-06-05 09:58:11,762 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 09:58:11,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 09:58:11,763 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 09:58:11,763 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 09:58:11,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 09:58:11,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 09:58:11,766 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 09:58:11,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 09:58:11,767 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 09:58:11,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 09:58:11,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 09:58:11,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 09:58:11,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 09:58:11,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 09:58:11,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 09:58:11,768 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 09:58:11,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 09:58:11,769 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 09:58:11,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 09:58:11,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 09:58:11,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 09:58:11,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 09:58:11,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 09:58:11,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 09:58:11,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 09:58:11,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 09:58:11,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 09:58:11,770 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 09:58:11,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 09:58:11,770 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 09:58:11,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 09:58:11,770 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 09:58:11,771 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-05 09:58:12,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 09:58:12,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 09:58:12,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 09:58:12,122 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 09:58:12,122 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 09:58:12,123 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2021-06-05 09:58:12,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9bd1a89/ecb128ee83fa43c183ab7d43e8df5aac/FLAGdf8f6cd91 [2021-06-05 09:58:12,736 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 09:58:12,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2021-06-05 09:58:12,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9bd1a89/ecb128ee83fa43c183ab7d43e8df5aac/FLAGdf8f6cd91 [2021-06-05 09:58:13,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9bd1a89/ecb128ee83fa43c183ab7d43e8df5aac [2021-06-05 09:58:13,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 09:58:13,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 09:58:13,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 09:58:13,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 09:58:13,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 09:58:13,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:58:13" (1/1) ... [2021-06-05 09:58:13,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b70274c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13, skipping insertion in model container [2021-06-05 09:58:13,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:58:13" (1/1) ... [2021-06-05 09:58:13,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 09:58:13,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 09:58:13,377 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/mix055_power.opt.i[950,963] [2021-06-05 09:58:13,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:58:13,559 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 09:58:13,571 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/mix055_power.opt.i[950,963] [2021-06-05 09:58:13,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:58:13,684 INFO L208 MainTranslator]: Completed translation [2021-06-05 09:58:13,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13 WrapperNode [2021-06-05 09:58:13,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 09:58:13,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 09:58:13,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 09:58:13,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 09:58:13,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13" (1/1) ... [2021-06-05 09:58:13,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13" (1/1) ... [2021-06-05 09:58:13,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 09:58:13,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 09:58:13,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 09:58:13,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 09:58:13,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13" (1/1) ... [2021-06-05 09:58:13,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13" (1/1) ... [2021-06-05 09:58:13,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13" (1/1) ... [2021-06-05 09:58:13,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13" (1/1) ... [2021-06-05 09:58:13,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13" (1/1) ... [2021-06-05 09:58:13,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13" (1/1) ... [2021-06-05 09:58:13,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13" (1/1) ... [2021-06-05 09:58:13,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 09:58:13,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 09:58:13,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 09:58:13,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 09:58:13,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13" (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-05 09:58:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 09:58:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 09:58:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 09:58:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 09:58:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 09:58:13,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 09:58:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 09:58:13,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 09:58:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 09:58:13,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 09:58:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-05 09:58:13,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-05 09:58:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 09:58:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 09:58:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 09:58:13,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 09:58:13,865 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 09:58:15,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 09:58:15,421 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 09:58:15,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:58:15 BoogieIcfgContainer [2021-06-05 09:58:15,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 09:58:15,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 09:58:15,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 09:58:15,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 09:58:15,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 09:58:13" (1/3) ... [2021-06-05 09:58:15,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e24f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:58:15, skipping insertion in model container [2021-06-05 09:58:15,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:58:13" (2/3) ... [2021-06-05 09:58:15,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e24f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:58:15, skipping insertion in model container [2021-06-05 09:58:15,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:58:15" (3/3) ... [2021-06-05 09:58:15,429 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_power.opt.i [2021-06-05 09:58:15,434 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 09:58:15,435 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 09:58:15,435 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 09:58:15,435 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 09:58:15,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,464 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,464 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,469 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,470 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,470 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,470 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,470 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,470 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,471 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,471 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,477 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,478 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,479 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,481 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,482 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:58:15,483 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 09:58:15,501 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-05 09:58:15,527 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:58:15,527 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:58:15,527 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:58:15,527 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:58:15,527 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:58:15,527 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:58:15,527 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:58:15,528 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 09:58:15,541 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 125 transitions, 270 flow [2021-06-05 09:58:33,470 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105491 states, 105487 states have (on average 4.480296150236522) internal successors, (472613), 105490 states have internal predecessors, (472613), 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-05 09:58:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 105491 states, 105487 states have (on average 4.480296150236522) internal successors, (472613), 105490 states have internal predecessors, (472613), 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-05 09:58:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 09:58:33,688 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:33,689 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] [2021-06-05 09:58:33,689 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash -882581900, now seen corresponding path program 1 times [2021-06-05 09:58:33,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:33,706 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163247455] [2021-06-05 09:58:33,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:34,032 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-05 09:58:34,033 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:34,033 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163247455] [2021-06-05 09:58:34,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163247455] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:34,035 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:34,035 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 09:58:34,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862225758] [2021-06-05 09:58:34,039 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 09:58:34,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:34,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 09:58:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:58:34,239 INFO L87 Difference]: Start difference. First operand has 105491 states, 105487 states have (on average 4.480296150236522) internal successors, (472613), 105490 states have internal predecessors, (472613), 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 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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-05 09:58:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:36,014 INFO L93 Difference]: Finished difference Result 90987 states and 399778 transitions. [2021-06-05 09:58:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 09:58:36,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2021-06-05 09:58:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:36,461 INFO L225 Difference]: With dead ends: 90987 [2021-06-05 09:58:36,461 INFO L226 Difference]: Without dead ends: 50219 [2021-06-05 09:58:36,462 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:58:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50219 states. [2021-06-05 09:58:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50219 to 50219. [2021-06-05 09:58:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50219 states, 50218 states have (on average 4.336652196423593) internal successors, (217778), 50218 states have internal predecessors, (217778), 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-05 09:58:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50219 states to 50219 states and 217778 transitions. [2021-06-05 09:58:39,473 INFO L78 Accepts]: Start accepts. Automaton has 50219 states and 217778 transitions. Word has length 66 [2021-06-05 09:58:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:39,474 INFO L482 AbstractCegarLoop]: Abstraction has 50219 states and 217778 transitions. [2021-06-05 09:58:39,474 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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-05 09:58:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 50219 states and 217778 transitions. [2021-06-05 09:58:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 09:58:39,528 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:39,529 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] [2021-06-05 09:58:39,529 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 09:58:39,529 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:39,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash 414741433, now seen corresponding path program 1 times [2021-06-05 09:58:39,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:39,535 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436529509] [2021-06-05 09:58:39,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:39,734 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-05 09:58:39,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:39,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436529509] [2021-06-05 09:58:39,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436529509] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:39,735 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:39,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:58:39,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945214262] [2021-06-05 09:58:39,736 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:58:39,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:39,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:58:39,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:58:39,737 INFO L87 Difference]: Start difference. First operand 50219 states and 217778 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-05 09:58:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:40,560 INFO L93 Difference]: Finished difference Result 60459 states and 260082 transitions. [2021-06-05 09:58:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:58:40,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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 78 [2021-06-05 09:58:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:40,810 INFO L225 Difference]: With dead ends: 60459 [2021-06-05 09:58:40,810 INFO L226 Difference]: Without dead ends: 47915 [2021-06-05 09:58:40,810 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 87.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:58:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47915 states. [2021-06-05 09:58:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47915 to 47915. [2021-06-05 09:58:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47915 states, 47914 states have (on average 4.316775890136495) internal successors, (206834), 47914 states have internal predecessors, (206834), 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-05 09:58:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47915 states to 47915 states and 206834 transitions. [2021-06-05 09:58:42,710 INFO L78 Accepts]: Start accepts. Automaton has 47915 states and 206834 transitions. Word has length 78 [2021-06-05 09:58:42,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:42,711 INFO L482 AbstractCegarLoop]: Abstraction has 47915 states and 206834 transitions. [2021-06-05 09:58:42,711 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-05 09:58:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 47915 states and 206834 transitions. [2021-06-05 09:58:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:58:42,762 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:42,763 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] [2021-06-05 09:58:42,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 09:58:42,763 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash -150882152, now seen corresponding path program 1 times [2021-06-05 09:58:42,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:42,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155017234] [2021-06-05 09:58:42,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:43,030 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-05 09:58:43,031 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:43,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155017234] [2021-06-05 09:58:43,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155017234] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:43,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:43,034 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 09:58:43,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231256785] [2021-06-05 09:58:43,035 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:58:43,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:43,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:58:43,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:58:43,041 INFO L87 Difference]: Start difference. First operand 47915 states and 206834 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-05 09:58:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:43,942 INFO L93 Difference]: Finished difference Result 57669 states and 247158 transitions. [2021-06-05 09:58:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 09:58:43,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 80 [2021-06-05 09:58:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:44,184 INFO L225 Difference]: With dead ends: 57669 [2021-06-05 09:58:44,185 INFO L226 Difference]: Without dead ends: 46661 [2021-06-05 09:58:44,186 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 198.8ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:58:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46661 states. [2021-06-05 09:58:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46661 to 46367. [2021-06-05 09:58:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46367 states, 46366 states have (on average 4.304835439761894) internal successors, (199598), 46366 states have internal predecessors, (199598), 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-05 09:58:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46367 states to 46367 states and 199598 transitions. [2021-06-05 09:58:46,066 INFO L78 Accepts]: Start accepts. Automaton has 46367 states and 199598 transitions. Word has length 80 [2021-06-05 09:58:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:46,066 INFO L482 AbstractCegarLoop]: Abstraction has 46367 states and 199598 transitions. [2021-06-05 09:58:46,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-05 09:58:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 46367 states and 199598 transitions. [2021-06-05 09:58:46,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 09:58:46,124 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:46,125 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-05 09:58:46,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 09:58:46,125 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2096521914, now seen corresponding path program 1 times [2021-06-05 09:58:46,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:46,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288839279] [2021-06-05 09:58:46,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:46,337 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-05 09:58:46,337 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:46,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288839279] [2021-06-05 09:58:46,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288839279] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:46,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:46,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:58:46,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527802428] [2021-06-05 09:58:46,338 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:58:46,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:46,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:58:46,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:58:46,339 INFO L87 Difference]: Start difference. First operand 46367 states and 199598 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-05 09:58:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:47,292 INFO L93 Difference]: Finished difference Result 53075 states and 226740 transitions. [2021-06-05 09:58:47,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:58:47,293 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-05 09:58:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:47,503 INFO L225 Difference]: With dead ends: 53075 [2021-06-05 09:58:47,504 INFO L226 Difference]: Without dead ends: 44819 [2021-06-05 09:58:47,504 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 176.3ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:58:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44819 states. [2021-06-05 09:58:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44819 to 44819. [2021-06-05 09:58:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44819 states, 44818 states have (on average 4.292070150386006) internal successors, (192362), 44818 states have internal predecessors, (192362), 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-05 09:58:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44819 states to 44819 states and 192362 transitions. [2021-06-05 09:58:49,387 INFO L78 Accepts]: Start accepts. Automaton has 44819 states and 192362 transitions. Word has length 82 [2021-06-05 09:58:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:49,388 INFO L482 AbstractCegarLoop]: Abstraction has 44819 states and 192362 transitions. [2021-06-05 09:58:49,388 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-05 09:58:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 44819 states and 192362 transitions. [2021-06-05 09:58:49,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 09:58:49,469 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:49,469 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] [2021-06-05 09:58:49,469 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 09:58:49,470 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:49,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1557061825, now seen corresponding path program 1 times [2021-06-05 09:58:49,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:49,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48408625] [2021-06-05 09:58:49,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:49,797 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-05 09:58:49,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:49,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48408625] [2021-06-05 09:58:49,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48408625] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:49,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:49,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:58:49,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767575856] [2021-06-05 09:58:49,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:58:49,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:49,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:58:49,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:58:49,800 INFO L87 Difference]: Start difference. First operand 44819 states and 192362 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-05 09:58:50,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:50,406 INFO L93 Difference]: Finished difference Result 51183 states and 218240 transitions. [2021-06-05 09:58:50,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:58:50,407 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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 83 [2021-06-05 09:58:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:50,537 INFO L225 Difference]: With dead ends: 51183 [2021-06-05 09:58:50,537 INFO L226 Difference]: Without dead ends: 44303 [2021-06-05 09:58:50,538 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 221.2ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:58:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44303 states. [2021-06-05 09:58:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44303 to 44303. [2021-06-05 09:58:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44303 states, 44302 states have (on average 4.287616811882082) internal successors, (189950), 44302 states have internal predecessors, (189950), 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-05 09:58:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44303 states to 44303 states and 189950 transitions. [2021-06-05 09:58:52,461 INFO L78 Accepts]: Start accepts. Automaton has 44303 states and 189950 transitions. Word has length 83 [2021-06-05 09:58:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:52,461 INFO L482 AbstractCegarLoop]: Abstraction has 44303 states and 189950 transitions. [2021-06-05 09:58:52,461 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-05 09:58:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 44303 states and 189950 transitions. [2021-06-05 09:58:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 09:58:52,527 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:52,527 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-05 09:58:52,527 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 09:58:52,528 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1711416520, now seen corresponding path program 1 times [2021-06-05 09:58:52,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:52,528 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857352436] [2021-06-05 09:58:52,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:52,715 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-05 09:58:52,715 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:52,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857352436] [2021-06-05 09:58:52,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857352436] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:52,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:52,716 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 09:58:52,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966144353] [2021-06-05 09:58:52,716 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 09:58:52,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:52,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 09:58:52,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:58:52,717 INFO L87 Difference]: Start difference. First operand 44303 states and 189950 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-05 09:58:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:53,366 INFO L93 Difference]: Finished difference Result 56647 states and 242081 transitions. [2021-06-05 09:58:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:58:53,366 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-05 09:58:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:53,862 INFO L225 Difference]: With dead ends: 56647 [2021-06-05 09:58:53,862 INFO L226 Difference]: Without dead ends: 48047 [2021-06-05 09:58:53,863 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 238.7ms TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:58:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48047 states. [2021-06-05 09:58:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48047 to 47015. [2021-06-05 09:58:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47015 states, 47014 states have (on average 4.284744969583528) internal successors, (201443), 47014 states have internal predecessors, (201443), 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-05 09:58:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47015 states to 47015 states and 201443 transitions. [2021-06-05 09:58:55,354 INFO L78 Accepts]: Start accepts. Automaton has 47015 states and 201443 transitions. Word has length 84 [2021-06-05 09:58:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:55,354 INFO L482 AbstractCegarLoop]: Abstraction has 47015 states and 201443 transitions. [2021-06-05 09:58:55,355 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-05 09:58:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 47015 states and 201443 transitions. [2021-06-05 09:58:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 09:58:55,430 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:55,430 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-05 09:58:55,430 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 09:58:55,430 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:55,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:55,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1328186757, now seen corresponding path program 1 times [2021-06-05 09:58:55,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:55,431 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109391059] [2021-06-05 09:58:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:55,514 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-05 09:58:55,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:55,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109391059] [2021-06-05 09:58:55,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109391059] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:55,515 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:55,515 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:58:55,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474177346] [2021-06-05 09:58:55,515 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:58:55,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:55,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:58:55,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:58:55,516 INFO L87 Difference]: Start difference. First operand 47015 states and 201443 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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-05 09:58:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:56,307 INFO L93 Difference]: Finished difference Result 58803 states and 249127 transitions. [2021-06-05 09:58:56,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:58:56,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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-05 09:58:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:56,495 INFO L225 Difference]: With dead ends: 58803 [2021-06-05 09:58:56,496 INFO L226 Difference]: Without dead ends: 43907 [2021-06-05 09:58:56,496 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 65.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:58:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43907 states. [2021-06-05 09:58:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43907 to 43907. [2021-06-05 09:58:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43907 states, 43906 states have (on average 4.234113788548262) internal successors, (185903), 43906 states have internal predecessors, (185903), 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-05 09:58:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43907 states to 43907 states and 185903 transitions. [2021-06-05 09:58:58,052 INFO L78 Accepts]: Start accepts. Automaton has 43907 states and 185903 transitions. Word has length 84 [2021-06-05 09:58:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:58,053 INFO L482 AbstractCegarLoop]: Abstraction has 43907 states and 185903 transitions. [2021-06-05 09:58:58,053 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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-05 09:58:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 43907 states and 185903 transitions. [2021-06-05 09:58:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 09:58:58,111 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:58,112 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-05 09:58:58,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 09:58:58,112 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:58,112 INFO L82 PathProgramCache]: Analyzing trace with hash -276744953, now seen corresponding path program 1 times [2021-06-05 09:58:58,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:58,112 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790083184] [2021-06-05 09:58:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:58,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-05 09:58:58,208 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:58,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790083184] [2021-06-05 09:58:58,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790083184] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:58,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:58,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:58:58,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5373187] [2021-06-05 09:58:58,209 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:58:58,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:58,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:58:58,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:58:58,210 INFO L87 Difference]: Start difference. First operand 43907 states and 185903 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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-05 09:58:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:58:58,544 INFO L93 Difference]: Finished difference Result 46787 states and 193751 transitions. [2021-06-05 09:58:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:58:58,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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-05 09:58:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:58:58,640 INFO L225 Difference]: With dead ends: 46787 [2021-06-05 09:58:58,641 INFO L226 Difference]: Without dead ends: 33683 [2021-06-05 09:58:58,641 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 83.6ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:58:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33683 states. [2021-06-05 09:58:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33683 to 33683. [2021-06-05 09:58:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33683 states, 33682 states have (on average 4.102814559705481) internal successors, (138191), 33682 states have internal predecessors, (138191), 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-05 09:58:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33683 states to 33683 states and 138191 transitions. [2021-06-05 09:58:59,771 INFO L78 Accepts]: Start accepts. Automaton has 33683 states and 138191 transitions. Word has length 85 [2021-06-05 09:58:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:58:59,771 INFO L482 AbstractCegarLoop]: Abstraction has 33683 states and 138191 transitions. [2021-06-05 09:58:59,771 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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-05 09:58:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 33683 states and 138191 transitions. [2021-06-05 09:58:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 09:58:59,820 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:58:59,820 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-05 09:58:59,820 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 09:58:59,821 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:58:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:58:59,821 INFO L82 PathProgramCache]: Analyzing trace with hash -525083758, now seen corresponding path program 1 times [2021-06-05 09:58:59,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:58:59,821 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943288041] [2021-06-05 09:58:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:58:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:58:59,904 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-05 09:58:59,904 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:58:59,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943288041] [2021-06-05 09:58:59,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943288041] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:58:59,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:58:59,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:58:59,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184316696] [2021-06-05 09:58:59,905 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:58:59,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:58:59,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:58:59,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:58:59,905 INFO L87 Difference]: Start difference. First operand 33683 states and 138191 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-05 09:59:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:59:00,672 INFO L93 Difference]: Finished difference Result 52007 states and 212894 transitions. [2021-06-05 09:59:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 09:59:00,673 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-05 09:59:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:59:00,777 INFO L225 Difference]: With dead ends: 52007 [2021-06-05 09:59:00,777 INFO L226 Difference]: Without dead ends: 32523 [2021-06-05 09:59:00,778 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 70.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:59:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32523 states. [2021-06-05 09:59:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32523 to 29823. [2021-06-05 09:59:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29823 states, 29822 states have (on average 4.026959962443834) internal successors, (120092), 29822 states have internal predecessors, (120092), 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-05 09:59:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29823 states to 29823 states and 120092 transitions. [2021-06-05 09:59:01,426 INFO L78 Accepts]: Start accepts. Automaton has 29823 states and 120092 transitions. Word has length 87 [2021-06-05 09:59:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:59:01,427 INFO L482 AbstractCegarLoop]: Abstraction has 29823 states and 120092 transitions. [2021-06-05 09:59:01,427 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-05 09:59:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 29823 states and 120092 transitions. [2021-06-05 09:59:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 09:59:01,465 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:59:01,465 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-05 09:59:01,465 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 09:59:01,466 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:59:01,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:59:01,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1128153042, now seen corresponding path program 2 times [2021-06-05 09:59:01,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:59:01,466 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424826516] [2021-06-05 09:59:01,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:59:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:59:01,545 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-05 09:59:01,546 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:59:01,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424826516] [2021-06-05 09:59:01,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424826516] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:59:01,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:59:01,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:59:01,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972920575] [2021-06-05 09:59:01,546 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:59:01,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:59:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:59:01,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:59:01,547 INFO L87 Difference]: Start difference. First operand 29823 states and 120092 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-05 09:59:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:59:02,216 INFO L93 Difference]: Finished difference Result 47269 states and 188013 transitions. [2021-06-05 09:59:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:59:02,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-05 09:59:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:59:02,312 INFO L225 Difference]: With dead ends: 47269 [2021-06-05 09:59:02,312 INFO L226 Difference]: Without dead ends: 31335 [2021-06-05 09:59:02,312 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 71.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:59:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31335 states. [2021-06-05 09:59:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31335 to 28527. [2021-06-05 09:59:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28527 states, 28526 states have (on average 3.9486433429152354) internal successors, (112639), 28526 states have internal predecessors, (112639), 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-05 09:59:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28527 states to 28527 states and 112639 transitions. [2021-06-05 09:59:03,044 INFO L78 Accepts]: Start accepts. Automaton has 28527 states and 112639 transitions. Word has length 87 [2021-06-05 09:59:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:59:03,044 INFO L482 AbstractCegarLoop]: Abstraction has 28527 states and 112639 transitions. [2021-06-05 09:59:03,044 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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-05 09:59:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 28527 states and 112639 transitions. [2021-06-05 09:59:03,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 09:59:03,362 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:59:03,362 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-05 09:59:03,363 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 09:59:03,363 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:59:03,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:59:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1752105178, now seen corresponding path program 1 times [2021-06-05 09:59:03,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:59:03,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060899925] [2021-06-05 09:59:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:59:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:59:03,452 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-05 09:59:03,452 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:59:03,452 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060899925] [2021-06-05 09:59:03,452 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060899925] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:59:03,452 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:59:03,452 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 09:59:03,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522499469] [2021-06-05 09:59:03,453 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:59:03,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:59:03,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:59:03,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:59:03,454 INFO L87 Difference]: Start difference. First operand 28527 states and 112639 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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-05 09:59:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:59:03,742 INFO L93 Difference]: Finished difference Result 25107 states and 96676 transitions. [2021-06-05 09:59:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:59:03,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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-05 09:59:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:59:03,785 INFO L225 Difference]: With dead ends: 25107 [2021-06-05 09:59:03,785 INFO L226 Difference]: Without dead ends: 17852 [2021-06-05 09:59:03,785 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 93.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:59:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17852 states. [2021-06-05 09:59:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17852 to 17372. [2021-06-05 09:59:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17372 states, 17371 states have (on average 3.8145184502907146) internal successors, (66262), 17371 states have internal predecessors, (66262), 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-05 09:59:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17372 states to 17372 states and 66262 transitions. [2021-06-05 09:59:04,133 INFO L78 Accepts]: Start accepts. Automaton has 17372 states and 66262 transitions. Word has length 87 [2021-06-05 09:59:04,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:59:04,133 INFO L482 AbstractCegarLoop]: Abstraction has 17372 states and 66262 transitions. [2021-06-05 09:59:04,134 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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-05 09:59:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 17372 states and 66262 transitions. [2021-06-05 09:59:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-05 09:59:04,160 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:59:04,160 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:59:04,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 09:59:04,160 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:59:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:59:04,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1341351252, now seen corresponding path program 1 times [2021-06-05 09:59:04,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:59:04,160 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008706068] [2021-06-05 09:59:04,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:59:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:59:04,254 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-05 09:59:04,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:59:04,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008706068] [2021-06-05 09:59:04,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008706068] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:59:04,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:59:04,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:59:04,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138837831] [2021-06-05 09:59:04,255 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:59:04,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:59:04,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:59:04,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:59:04,255 INFO L87 Difference]: Start difference. First operand 17372 states and 66262 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:59:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:59:04,475 INFO L93 Difference]: Finished difference Result 14456 states and 54517 transitions. [2021-06-05 09:59:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:59:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-06-05 09:59:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:59:04,490 INFO L225 Difference]: With dead ends: 14456 [2021-06-05 09:59:04,490 INFO L226 Difference]: Without dead ends: 6513 [2021-06-05 09:59:04,491 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 106.8ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:59:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2021-06-05 09:59:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 5649. [2021-06-05 09:59:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5649 states, 5648 states have (on average 3.7857648725212463) internal successors, (21382), 5648 states have internal predecessors, (21382), 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-05 09:59:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5649 states to 5649 states and 21382 transitions. [2021-06-05 09:59:04,593 INFO L78 Accepts]: Start accepts. Automaton has 5649 states and 21382 transitions. Word has length 91 [2021-06-05 09:59:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:59:04,594 INFO L482 AbstractCegarLoop]: Abstraction has 5649 states and 21382 transitions. [2021-06-05 09:59:04,594 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:59:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 5649 states and 21382 transitions. [2021-06-05 09:59:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-06-05 09:59:04,741 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:59:04,741 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] [2021-06-05 09:59:04,742 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 09:59:04,742 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:59:04,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:59:04,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1525335816, now seen corresponding path program 1 times [2021-06-05 09:59:04,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:59:04,742 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130716314] [2021-06-05 09:59:04,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:59:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:59:04,857 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-05 09:59:04,857 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:59:04,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130716314] [2021-06-05 09:59:04,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130716314] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:59:04,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:59:04,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:59:04,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110244977] [2021-06-05 09:59:04,858 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:59:04,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:59:04,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:59:04,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:59:04,859 INFO L87 Difference]: Start difference. First operand 5649 states and 21382 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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-05 09:59:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:59:04,974 INFO L93 Difference]: Finished difference Result 7899 states and 29824 transitions. [2021-06-05 09:59:04,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 09:59:04,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 96 [2021-06-05 09:59:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:59:04,983 INFO L225 Difference]: With dead ends: 7899 [2021-06-05 09:59:04,983 INFO L226 Difference]: Without dead ends: 3645 [2021-06-05 09:59:04,984 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:59:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2021-06-05 09:59:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 3645. [2021-06-05 09:59:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3645 states, 3644 states have (on average 3.6745334796926454) internal successors, (13390), 3644 states have internal predecessors, (13390), 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-05 09:59:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 13390 transitions. [2021-06-05 09:59:05,042 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 13390 transitions. Word has length 96 [2021-06-05 09:59:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:59:05,042 INFO L482 AbstractCegarLoop]: Abstraction has 3645 states and 13390 transitions. [2021-06-05 09:59:05,042 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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-05 09:59:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 13390 transitions. [2021-06-05 09:59:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-06-05 09:59:05,048 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:59:05,048 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] [2021-06-05 09:59:05,048 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 09:59:05,048 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:59:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:59:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash 610832262, now seen corresponding path program 2 times [2021-06-05 09:59:05,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:59:05,049 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146604044] [2021-06-05 09:59:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:59:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:59:05,252 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-05 09:59:05,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:59:05,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146604044] [2021-06-05 09:59:05,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146604044] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:59:05,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:59:05,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 09:59:05,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611807428] [2021-06-05 09:59:05,253 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:59:05,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:59:05,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:59:05,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:59:05,254 INFO L87 Difference]: Start difference. First operand 3645 states and 13390 transitions. Second operand has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 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-05 09:59:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:59:05,398 INFO L93 Difference]: Finished difference Result 5415 states and 19928 transitions. [2021-06-05 09:59:05,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:59:05,398 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 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 96 [2021-06-05 09:59:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:59:05,403 INFO L225 Difference]: With dead ends: 5415 [2021-06-05 09:59:05,403 INFO L226 Difference]: Without dead ends: 2637 [2021-06-05 09:59:05,404 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 153.8ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:59:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2021-06-05 09:59:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2637. [2021-06-05 09:59:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 2636 states have (on average 3.540971168437026) internal successors, (9334), 2636 states have internal predecessors, (9334), 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-05 09:59:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 9334 transitions. [2021-06-05 09:59:05,440 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 9334 transitions. Word has length 96 [2021-06-05 09:59:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:59:05,441 INFO L482 AbstractCegarLoop]: Abstraction has 2637 states and 9334 transitions. [2021-06-05 09:59:05,441 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 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-05 09:59:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 9334 transitions. [2021-06-05 09:59:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-06-05 09:59:05,444 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:59:05,444 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] [2021-06-05 09:59:05,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 09:59:05,444 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:59:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:59:05,445 INFO L82 PathProgramCache]: Analyzing trace with hash 590418630, now seen corresponding path program 3 times [2021-06-05 09:59:05,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:59:05,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113924258] [2021-06-05 09:59:05,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:59:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:59:05,476 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:59:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:59:05,512 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:59:05,551 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 09:59:05,551 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 09:59:05,551 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 09:59:05,554 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 09:59:05,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 09:59:05 BasicIcfg [2021-06-05 09:59:05,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 09:59:05,695 INFO L168 Benchmark]: Toolchain (without parser) took 52540.92 ms. Allocated memory was 375.4 MB in the beginning and 13.9 GB in the end (delta: 13.5 GB). Free memory was 337.1 MB in the beginning and 10.0 GB in the end (delta: -9.6 GB). Peak memory consumption was 3.9 GB. Max. memory is 16.0 GB. [2021-06-05 09:59:05,695 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 375.4 MB. Free memory was 355.3 MB in the beginning and 355.3 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 09:59:05,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.52 ms. Allocated memory is still 375.4 MB. Free memory was 336.9 MB in the beginning and 333.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-06-05 09:59:05,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.05 ms. Allocated memory is still 375.4 MB. Free memory was 333.3 MB in the beginning and 330.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 09:59:05,700 INFO L168 Benchmark]: Boogie Preprocessor took 28.48 ms. Allocated memory is still 375.4 MB. Free memory was 330.5 MB in the beginning and 327.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 09:59:05,701 INFO L168 Benchmark]: RCFGBuilder took 1655.47 ms. Allocated memory is still 375.4 MB. Free memory was 327.4 MB in the beginning and 284.7 MB in the end (delta: 42.7 MB). Peak memory consumption was 146.5 MB. Max. memory is 16.0 GB. [2021-06-05 09:59:05,701 INFO L168 Benchmark]: TraceAbstraction took 50264.20 ms. Allocated memory was 375.4 MB in the beginning and 13.9 GB in the end (delta: 13.5 GB). Free memory was 283.6 MB in the beginning and 10.0 GB in the end (delta: -9.7 GB). Peak memory consumption was 3.8 GB. Max. memory is 16.0 GB. [2021-06-05 09:59:05,701 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.11 ms. Allocated memory is still 375.4 MB. Free memory was 355.3 MB in the beginning and 355.3 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 536.52 ms. Allocated memory is still 375.4 MB. Free memory was 336.9 MB in the beginning and 333.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 51.05 ms. Allocated memory is still 375.4 MB. Free memory was 333.3 MB in the beginning and 330.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.48 ms. Allocated memory is still 375.4 MB. Free memory was 330.5 MB in the beginning and 327.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1655.47 ms. Allocated memory is still 375.4 MB. Free memory was 327.4 MB in the beginning and 284.7 MB in the end (delta: 42.7 MB). Peak memory consumption was 146.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 50264.20 ms. Allocated memory was 375.4 MB in the beginning and 13.9 GB in the end (delta: 13.5 GB). Free memory was 283.6 MB in the beginning and 10.0 GB in the end (delta: -9.7 GB). Peak memory consumption was 3.8 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L725] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L726] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L727] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L728] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L729] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L730] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L731] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L732] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L733] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L734] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L735] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L736] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L737] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L738] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L739] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L740] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L741] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L742] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1461; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1462; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1463; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1464; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 50026.9ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 1249.1ms, AutomataDifference: 11589.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17942.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2330 SDtfs, 3824 SDslu, 8458 SDs, 0 SdLazy, 831 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 768.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1647.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105491occurred in iteration=0, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 16685.4ms AutomataMinimizationTime, 14 MinimizatonAttempts, 8178 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 65.6ms SsaConstructionTime, 565.2ms SatisfiabilityAnalysisTime, 1602.6ms InterpolantComputationTime, 1282 NumberOfCodeBlocks, 1282 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1172 ConstructedInterpolants, 0 QuantifiedInterpolants, 5331 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...