/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-OGIterative.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 00:02:05,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 00:02:05,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 00:02:05,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 00:02:05,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 00:02:05,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 00:02:05,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 00:02:05,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 00:02:05,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 00:02:05,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 00:02:05,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 00:02:05,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 00:02:05,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 00:02:05,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 00:02:05,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 00:02:05,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 00:02:05,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 00:02:05,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 00:02:05,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 00:02:05,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 00:02:05,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 00:02:05,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 00:02:05,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 00:02:05,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 00:02:05,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 00:02:05,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 00:02:05,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 00:02:05,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 00:02:05,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 00:02:05,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 00:02:05,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 00:02:05,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 00:02:05,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 00:02:05,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 00:02:05,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 00:02:05,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 00:02:05,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 00:02:05,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 00:02:05,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 00:02:05,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 00:02:05,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 00:02:05,203 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-PN-NoLbe-OGIterative.epf [2021-08-13 00:02:05,231 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 00:02:05,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 00:02:05,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 00:02:05,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 00:02:05,234 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 00:02:05,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 00:02:05,235 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 00:02:05,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 00:02:05,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 00:02:05,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 00:02:05,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 00:02:05,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 00:02:05,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 00:02:05,236 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 00:02:05,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 00:02:05,236 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 00:02:05,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 00:02:05,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 00:02:05,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 00:02:05,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 00:02:05,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 00:02:05,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 00:02:05,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 00:02:05,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 00:02:05,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 00:02:05,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 00:02:05,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 00:02:05,237 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 00:02:05,238 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 00:02:05,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 00:02:05,238 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 00:02:05,238 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-08-13 00:02:05,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 00:02:05,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 00:02:05,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 00:02:05,607 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 00:02:05,611 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 00:02:05,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2021-08-13 00:02:05,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12461c65/a9b88cef01a04534beef51d18a6b11a2/FLAG2bf7427a7 [2021-08-13 00:02:06,417 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 00:02:06,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2021-08-13 00:02:06,427 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12461c65/a9b88cef01a04534beef51d18a6b11a2/FLAG2bf7427a7 [2021-08-13 00:02:06,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12461c65/a9b88cef01a04534beef51d18a6b11a2 [2021-08-13 00:02:06,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 00:02:06,470 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 00:02:06,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 00:02:06,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 00:02:06,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 00:02:06,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 12:02:06" (1/1) ... [2021-08-13 00:02:06,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18162a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06, skipping insertion in model container [2021-08-13 00:02:06,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 12:02:06" (1/1) ... [2021-08-13 00:02:06,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 00:02:06,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 00:02:06,666 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/mix043_rmo.opt.i[948,961] [2021-08-13 00:02:06,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 00:02:06,871 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 00:02:06,878 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/mix043_rmo.opt.i[948,961] [2021-08-13 00:02:06,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 00:02:06,994 INFO L208 MainTranslator]: Completed translation [2021-08-13 00:02:06,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06 WrapperNode [2021-08-13 00:02:06,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 00:02:06,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 00:02:06,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 00:02:06,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 00:02:07,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06" (1/1) ... [2021-08-13 00:02:07,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06" (1/1) ... [2021-08-13 00:02:07,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 00:02:07,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 00:02:07,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 00:02:07,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 00:02:07,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06" (1/1) ... [2021-08-13 00:02:07,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06" (1/1) ... [2021-08-13 00:02:07,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06" (1/1) ... [2021-08-13 00:02:07,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06" (1/1) ... [2021-08-13 00:02:07,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06" (1/1) ... [2021-08-13 00:02:07,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06" (1/1) ... [2021-08-13 00:02:07,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06" (1/1) ... [2021-08-13 00:02:07,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 00:02:07,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 00:02:07,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 00:02:07,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 00:02:07,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06" (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-08-13 00:02:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 00:02:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 00:02:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 00:02:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 00:02:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 00:02:07,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 00:02:07,227 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 00:02:07,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 00:02:07,228 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 00:02:07,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 00:02:07,228 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-13 00:02:07,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-13 00:02:07,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 00:02:07,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 00:02:07,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 00:02:07,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 00:02:07,230 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 00:02:08,882 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 00:02:08,882 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 00:02:08,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 12:02:08 BoogieIcfgContainer [2021-08-13 00:02:08,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 00:02:08,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 00:02:08,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 00:02:08,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 00:02:08,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 12:02:06" (1/3) ... [2021-08-13 00:02:08,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e24060b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 12:02:08, skipping insertion in model container [2021-08-13 00:02:08,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:02:06" (2/3) ... [2021-08-13 00:02:08,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e24060b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 12:02:08, skipping insertion in model container [2021-08-13 00:02:08,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 12:02:08" (3/3) ... [2021-08-13 00:02:08,890 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_rmo.opt.i [2021-08-13 00:02:08,897 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 00:02:08,898 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 00:02:08,898 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 00:02:08,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,925 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,925 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,925 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,925 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,926 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,926 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,926 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,926 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,927 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,927 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,927 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,928 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,930 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,930 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,930 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,930 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,930 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,931 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,931 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,931 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,931 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,932 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,933 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,933 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,933 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,933 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,933 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,933 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,935 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,935 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,937 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,937 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,938 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,938 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,939 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,940 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,940 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:02:08,941 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 00:02:08,956 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-13 00:02:08,970 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 00:02:08,970 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 00:02:08,970 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 00:02:08,970 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 00:02:08,970 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 00:02:08,970 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 00:02:08,970 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 00:02:08,970 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 00:02:08,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2021-08-13 00:02:09,007 INFO L129 PetriNetUnfolder]: 2/126 cut-off events. [2021-08-13 00:02:09,007 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 00:02:09,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2021-08-13 00:02:09,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2021-08-13 00:02:09,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2021-08-13 00:02:09,023 INFO L129 PetriNetUnfolder]: 0/88 cut-off events. [2021-08-13 00:02:09,024 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 00:02:09,024 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:02:09,025 INFO L266 CegarLoopForPetriNet]: 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] [2021-08-13 00:02:09,025 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:02:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:02:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash 695328286, now seen corresponding path program 1 times [2021-08-13 00:02:09,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:02:09,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799639957] [2021-08-13 00:02:09,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:02:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:02:09,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:09,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:09,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:09,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:02:09,224 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:02:09,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799639957] [2021-08-13 00:02:09,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799639957] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:02:09,225 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:02:09,225 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 00:02:09,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14250909] [2021-08-13 00:02:09,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 00:02:09,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:02:09,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 00:02:09,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 00:02:09,241 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 130 [2021-08-13 00:02:09,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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-08-13 00:02:09,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:02:09,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 130 [2021-08-13 00:02:09,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:02:09,299 INFO L129 PetriNetUnfolder]: 16/250 cut-off events. [2021-08-13 00:02:09,299 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 00:02:09,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 250 events. 16/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 728 event pairs, 6 based on Foata normal form. 9/248 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2021-08-13 00:02:09,302 INFO L132 encePairwiseOnDemand]: 125/130 looper letters, 7 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2021-08-13 00:02:09,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 125 transitions, 280 flow [2021-08-13 00:02:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 00:02:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 00:02:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2021-08-13 00:02:09,312 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.958974358974359 [2021-08-13 00:02:09,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2021-08-13 00:02:09,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2021-08-13 00:02:09,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:02:09,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2021-08-13 00:02:09,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-08-13 00:02:09,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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-08-13 00:02:09,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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-08-13 00:02:09,323 INFO L348 CegarLoopForPetriNet]: 137 programPoint places, 0 predicate places. [2021-08-13 00:02:09,323 INFO L482 AbstractCegarLoop]: Abstraction has has 137 places, 125 transitions, 280 flow [2021-08-13 00:02:09,323 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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-08-13 00:02:09,323 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:02:09,323 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:02:09,323 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 00:02:09,324 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:02:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:02:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 12997446, now seen corresponding path program 1 times [2021-08-13 00:02:09,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:02:09,324 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475464434] [2021-08-13 00:02:09,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:02:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:02:09,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:09,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:09,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:09,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:09,460 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:02:09,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:02:09,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:09,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:09,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:09,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:09,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:09,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:02:09,489 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:02:09,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475464434] [2021-08-13 00:02:09,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475464434] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:02:09,490 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:02:09,490 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 00:02:09,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876729843] [2021-08-13 00:02:09,491 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 00:02:09,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:02:09,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 00:02:09,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 00:02:09,494 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 130 [2021-08-13 00:02:09,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 125 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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-08-13 00:02:09,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:02:09,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 130 [2021-08-13 00:02:09,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:02:09,683 INFO L129 PetriNetUnfolder]: 30/352 cut-off events. [2021-08-13 00:02:09,683 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-08-13 00:02:09,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 352 events. 30/352 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1575 event pairs, 6 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 427. Up to 45 conditions per place. [2021-08-13 00:02:09,688 INFO L132 encePairwiseOnDemand]: 124/130 looper letters, 7 selfloop transitions, 2 changer transitions 13/137 dead transitions. [2021-08-13 00:02:09,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 137 transitions, 350 flow [2021-08-13 00:02:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 00:02:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 00:02:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1085 transitions. [2021-08-13 00:02:09,697 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9273504273504274 [2021-08-13 00:02:09,697 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1085 transitions. [2021-08-13 00:02:09,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1085 transitions. [2021-08-13 00:02:09,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:02:09,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1085 transitions. [2021-08-13 00:02:09,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.55555555555556) internal successors, (1085), 9 states have internal predecessors, (1085), 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-08-13 00:02:09,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 130.0) internal successors, (1300), 10 states have internal predecessors, (1300), 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-08-13 00:02:09,707 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 130.0) internal successors, (1300), 10 states have internal predecessors, (1300), 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-08-13 00:02:09,707 INFO L348 CegarLoopForPetriNet]: 137 programPoint places, 8 predicate places. [2021-08-13 00:02:09,708 INFO L482 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 350 flow [2021-08-13 00:02:09,708 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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-08-13 00:02:09,708 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:02:09,708 INFO L266 CegarLoopForPetriNet]: 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-08-13 00:02:09,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 00:02:09,708 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:02:09,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:02:09,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1424610775, now seen corresponding path program 1 times [2021-08-13 00:02:09,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:02:09,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878029171] [2021-08-13 00:02:09,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:02:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:02:09,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:09,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:09,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:09,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:09,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:09,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:02:09,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:09,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 00:02:09,931 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-13 00:02:09,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 00:02:09,959 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.0 percent of original size [2021-08-13 00:02:09,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-08-13 00:02:09,983 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:02:09,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:02:10,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:10,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:10,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:10,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:10,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:10,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:02:10,020 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:02:10,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878029171] [2021-08-13 00:02:10,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878029171] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:02:10,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:02:10,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 00:02:10,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826468453] [2021-08-13 00:02:10,021 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 00:02:10,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:02:10,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 00:02:10,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-13 00:02:10,023 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 130 [2021-08-13 00:02:10,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 350 flow. Second operand has 10 states, 10 states have (on average 110.3) internal successors, (1103), 10 states have internal predecessors, (1103), 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-08-13 00:02:10,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:02:10,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 130 [2021-08-13 00:02:10,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:02:10,364 INFO L129 PetriNetUnfolder]: 194/871 cut-off events. [2021-08-13 00:02:10,365 INFO L130 PetriNetUnfolder]: For 159/197 co-relation queries the response was YES. [2021-08-13 00:02:10,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 871 events. 194/871 cut-off events. For 159/197 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5795 event pairs, 29 based on Foata normal form. 2/863 useless extension candidates. Maximal degree in co-relation 1520. Up to 166 conditions per place. [2021-08-13 00:02:10,369 INFO L132 encePairwiseOnDemand]: 118/130 looper letters, 15 selfloop transitions, 9 changer transitions 83/201 dead transitions. [2021-08-13 00:02:10,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 201 transitions, 776 flow [2021-08-13 00:02:10,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-13 00:02:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-13 00:02:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1916 transitions. [2021-08-13 00:02:10,373 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8669683257918552 [2021-08-13 00:02:10,373 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1916 transitions. [2021-08-13 00:02:10,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1916 transitions. [2021-08-13 00:02:10,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:02:10,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1916 transitions. [2021-08-13 00:02:10,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 112.70588235294117) internal successors, (1916), 17 states have internal predecessors, (1916), 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-08-13 00:02:10,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 130.0) internal successors, (2340), 18 states have internal predecessors, (2340), 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-08-13 00:02:10,381 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 130.0) internal successors, (2340), 18 states have internal predecessors, (2340), 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-08-13 00:02:10,381 INFO L348 CegarLoopForPetriNet]: 137 programPoint places, 24 predicate places. [2021-08-13 00:02:10,381 INFO L482 AbstractCegarLoop]: Abstraction has has 161 places, 201 transitions, 776 flow [2021-08-13 00:02:10,382 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 110.3) internal successors, (1103), 10 states have internal predecessors, (1103), 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-08-13 00:02:10,382 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:02:10,382 INFO L266 CegarLoopForPetriNet]: 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-08-13 00:02:10,382 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 00:02:10,382 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:02:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:02:10,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1162206302, now seen corresponding path program 1 times [2021-08-13 00:02:10,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:02:10,383 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299492073] [2021-08-13 00:02:10,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:02:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:02:10,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:10,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:10,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:10,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:10,436 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 00:02:10,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 00:02:10,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:10,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:02:10,453 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 00:02:10,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:10,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:10,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:02:10,461 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:02:10,461 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299492073] [2021-08-13 00:02:10,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299492073] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:02:10,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:02:10,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 00:02:10,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122105318] [2021-08-13 00:02:10,462 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 00:02:10,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:02:10,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 00:02:10,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 00:02:10,463 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 130 [2021-08-13 00:02:10,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 201 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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-08-13 00:02:10,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:02:10,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 130 [2021-08-13 00:02:10,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:02:11,092 INFO L129 PetriNetUnfolder]: 1315/4422 cut-off events. [2021-08-13 00:02:11,092 INFO L130 PetriNetUnfolder]: For 692/884 co-relation queries the response was YES. [2021-08-13 00:02:11,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8242 conditions, 4422 events. 1315/4422 cut-off events. For 692/884 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 44648 event pairs, 166 based on Foata normal form. 0/4236 useless extension candidates. Maximal degree in co-relation 8174. Up to 838 conditions per place. [2021-08-13 00:02:11,122 INFO L132 encePairwiseOnDemand]: 119/130 looper letters, 26 selfloop transitions, 18 changer transitions 5/238 dead transitions. [2021-08-13 00:02:11,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 238 transitions, 948 flow [2021-08-13 00:02:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 00:02:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 00:02:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1201 transitions. [2021-08-13 00:02:11,125 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9238461538461539 [2021-08-13 00:02:11,125 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1201 transitions. [2021-08-13 00:02:11,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1201 transitions. [2021-08-13 00:02:11,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:02:11,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1201 transitions. [2021-08-13 00:02:11,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.1) internal successors, (1201), 10 states have internal predecessors, (1201), 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-08-13 00:02:11,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 130.0) internal successors, (1430), 11 states have internal predecessors, (1430), 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-08-13 00:02:11,129 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 130.0) internal successors, (1430), 11 states have internal predecessors, (1430), 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-08-13 00:02:11,130 INFO L348 CegarLoopForPetriNet]: 137 programPoint places, 33 predicate places. [2021-08-13 00:02:11,130 INFO L482 AbstractCegarLoop]: Abstraction has has 170 places, 238 transitions, 948 flow [2021-08-13 00:02:11,130 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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-08-13 00:02:11,130 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:02:11,130 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:02:11,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 00:02:11,130 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:02:11,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:02:11,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1114101568, now seen corresponding path program 1 times [2021-08-13 00:02:11,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:02:11,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243066781] [2021-08-13 00:02:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:02:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:02:11,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:11,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:11,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:11,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:11,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:11,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:11,187 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 00:02:11,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 00:02:11,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:11,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:02:11,206 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 00:02:11,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:11,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:11,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:02:11,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:02:11,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243066781] [2021-08-13 00:02:11,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243066781] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:02:11,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:02:11,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 00:02:11,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807313088] [2021-08-13 00:02:11,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 00:02:11,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:02:11,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 00:02:11,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 00:02:11,216 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 130 [2021-08-13 00:02:11,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 238 transitions, 948 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 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-08-13 00:02:11,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:02:11,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 130 [2021-08-13 00:02:11,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:02:11,709 INFO L129 PetriNetUnfolder]: 886/2768 cut-off events. [2021-08-13 00:02:11,710 INFO L130 PetriNetUnfolder]: For 416/2208 co-relation queries the response was YES. [2021-08-13 00:02:11,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 2768 events. 886/2768 cut-off events. For 416/2208 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 23861 event pairs, 70 based on Foata normal form. 83/2707 useless extension candidates. Maximal degree in co-relation 5986. Up to 497 conditions per place. [2021-08-13 00:02:11,734 INFO L132 encePairwiseOnDemand]: 119/130 looper letters, 45 selfloop transitions, 46 changer transitions 73/295 dead transitions. [2021-08-13 00:02:11,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 295 transitions, 1388 flow [2021-08-13 00:02:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 00:02:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 00:02:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1563 transitions. [2021-08-13 00:02:11,737 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9248520710059172 [2021-08-13 00:02:11,737 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1563 transitions. [2021-08-13 00:02:11,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1563 transitions. [2021-08-13 00:02:11,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:02:11,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1563 transitions. [2021-08-13 00:02:11,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.23076923076923) internal successors, (1563), 13 states have internal predecessors, (1563), 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-08-13 00:02:11,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 130.0) internal successors, (1820), 14 states have internal predecessors, (1820), 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-08-13 00:02:11,743 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 130.0) internal successors, (1820), 14 states have internal predecessors, (1820), 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-08-13 00:02:11,743 INFO L348 CegarLoopForPetriNet]: 137 programPoint places, 45 predicate places. [2021-08-13 00:02:11,743 INFO L482 AbstractCegarLoop]: Abstraction has has 182 places, 295 transitions, 1388 flow [2021-08-13 00:02:11,743 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 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-08-13 00:02:11,744 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:02:11,744 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:02:11,744 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 00:02:11,744 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:02:11,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:02:11,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1026874840, now seen corresponding path program 1 times [2021-08-13 00:02:11,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:02:11,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412153519] [2021-08-13 00:02:11,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:02:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:02:11,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:11,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:11,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:11,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:11,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:11,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:11,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:11,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:11,877 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 00:02:11,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 00:02:11,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:11,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:02:11,899 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 00:02:11,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:11,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:11,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:02:11,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:02:11,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412153519] [2021-08-13 00:02:11,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412153519] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:02:11,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:02:11,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 00:02:11,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782659999] [2021-08-13 00:02:11,908 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 00:02:11,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:02:11,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 00:02:11,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 00:02:11,910 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 130 [2021-08-13 00:02:11,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 295 transitions, 1388 flow. Second operand has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 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-08-13 00:02:11,912 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:02:11,912 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 130 [2021-08-13 00:02:11,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:02:12,292 INFO L129 PetriNetUnfolder]: 602/1573 cut-off events. [2021-08-13 00:02:12,292 INFO L130 PetriNetUnfolder]: For 344/4047 co-relation queries the response was YES. [2021-08-13 00:02:12,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4712 conditions, 1573 events. 602/1573 cut-off events. For 344/4047 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 11181 event pairs, 7 based on Foata normal form. 149/1618 useless extension candidates. Maximal degree in co-relation 4638. Up to 454 conditions per place. [2021-08-13 00:02:12,305 INFO L132 encePairwiseOnDemand]: 119/130 looper letters, 33 selfloop transitions, 88 changer transitions 75/312 dead transitions. [2021-08-13 00:02:12,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 312 transitions, 1868 flow [2021-08-13 00:02:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 00:02:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 00:02:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1925 transitions. [2021-08-13 00:02:12,310 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9254807692307693 [2021-08-13 00:02:12,310 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1925 transitions. [2021-08-13 00:02:12,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1925 transitions. [2021-08-13 00:02:12,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:02:12,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1925 transitions. [2021-08-13 00:02:12,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.3125) internal successors, (1925), 16 states have internal predecessors, (1925), 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-08-13 00:02:12,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 130.0) internal successors, (2210), 17 states have internal predecessors, (2210), 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-08-13 00:02:12,318 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 130.0) internal successors, (2210), 17 states have internal predecessors, (2210), 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-08-13 00:02:12,319 INFO L348 CegarLoopForPetriNet]: 137 programPoint places, 51 predicate places. [2021-08-13 00:02:12,319 INFO L482 AbstractCegarLoop]: Abstraction has has 188 places, 312 transitions, 1868 flow [2021-08-13 00:02:12,319 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 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-08-13 00:02:12,319 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:02:12,319 INFO L266 CegarLoopForPetriNet]: 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-08-13 00:02:12,319 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 00:02:12,319 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:02:12,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:02:12,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1901444010, now seen corresponding path program 1 times [2021-08-13 00:02:12,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:02:12,320 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613460514] [2021-08-13 00:02:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:02:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:02:12,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:12,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:12,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:12,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:12,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:12,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:12,389 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:02:12,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:02:12,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:12,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:12,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:12,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:12,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:12,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:02:12,418 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:02:12,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613460514] [2021-08-13 00:02:12,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613460514] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:02:12,419 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:02:12,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 00:02:12,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024947472] [2021-08-13 00:02:12,419 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 00:02:12,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:02:12,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 00:02:12,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 00:02:12,421 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 130 [2021-08-13 00:02:12,421 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 312 transitions, 1868 flow. Second operand has 7 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 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-08-13 00:02:12,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:02:12,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 130 [2021-08-13 00:02:12,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:02:12,839 INFO L129 PetriNetUnfolder]: 1173/2812 cut-off events. [2021-08-13 00:02:12,839 INFO L130 PetriNetUnfolder]: For 589/3357 co-relation queries the response was YES. [2021-08-13 00:02:12,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8926 conditions, 2812 events. 1173/2812 cut-off events. For 589/3357 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 22624 event pairs, 13 based on Foata normal form. 3/2481 useless extension candidates. Maximal degree in co-relation 8848. Up to 882 conditions per place. [2021-08-13 00:02:12,859 INFO L132 encePairwiseOnDemand]: 124/130 looper letters, 20 selfloop transitions, 2 changer transitions 91/339 dead transitions. [2021-08-13 00:02:12,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 339 transitions, 2130 flow [2021-08-13 00:02:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-13 00:02:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-13 00:02:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 841 transitions. [2021-08-13 00:02:12,861 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9241758241758242 [2021-08-13 00:02:12,861 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 841 transitions. [2021-08-13 00:02:12,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 841 transitions. [2021-08-13 00:02:12,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:02:12,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 841 transitions. [2021-08-13 00:02:12,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 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-08-13 00:02:12,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 130.0) internal successors, (1040), 8 states have internal predecessors, (1040), 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-08-13 00:02:12,864 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 130.0) internal successors, (1040), 8 states have internal predecessors, (1040), 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-08-13 00:02:12,864 INFO L348 CegarLoopForPetriNet]: 137 programPoint places, 57 predicate places. [2021-08-13 00:02:12,864 INFO L482 AbstractCegarLoop]: Abstraction has has 194 places, 339 transitions, 2130 flow [2021-08-13 00:02:12,865 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 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-08-13 00:02:12,865 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:02:12,865 INFO L266 CegarLoopForPetriNet]: 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-08-13 00:02:12,865 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 00:02:12,865 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:02:12,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:02:12,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1386387554, now seen corresponding path program 2 times [2021-08-13 00:02:12,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:02:12,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260032658] [2021-08-13 00:02:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:02:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:02:12,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:12,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:12,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:12,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:12,945 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-08-13 00:02:12,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-08-13 00:02:12,953 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-08-13 00:02:12,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-08-13 00:02:12,964 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.5 percent of original size [2021-08-13 00:02:12,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-08-13 00:02:12,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:12,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-13 00:02:12,984 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:02:12,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:02:13,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:13,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:13,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:13,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:13,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:13,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:02:13,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:02:13,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260032658] [2021-08-13 00:02:13,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260032658] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:02:13,020 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:02:13,020 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 00:02:13,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294244938] [2021-08-13 00:02:13,021 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 00:02:13,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:02:13,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 00:02:13,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-08-13 00:02:13,022 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 130 [2021-08-13 00:02:13,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 339 transitions, 2130 flow. Second operand has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 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-08-13 00:02:13,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:02:13,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 130 [2021-08-13 00:02:13,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:02:14,214 INFO L129 PetriNetUnfolder]: 4003/9671 cut-off events. [2021-08-13 00:02:14,214 INFO L130 PetriNetUnfolder]: For 3270/13049 co-relation queries the response was YES. [2021-08-13 00:02:14,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31502 conditions, 9671 events. 4003/9671 cut-off events. For 3270/13049 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 102869 event pairs, 2 based on Foata normal form. 21/8820 useless extension candidates. Maximal degree in co-relation 31418. Up to 3044 conditions per place. [2021-08-13 00:02:14,377 INFO L132 encePairwiseOnDemand]: 120/130 looper letters, 48 selfloop transitions, 11 changer transitions 174/468 dead transitions. [2021-08-13 00:02:14,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 468 transitions, 3492 flow [2021-08-13 00:02:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 00:02:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 00:02:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1496 transitions. [2021-08-13 00:02:14,379 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8852071005917159 [2021-08-13 00:02:14,379 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1496 transitions. [2021-08-13 00:02:14,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1496 transitions. [2021-08-13 00:02:14,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:02:14,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1496 transitions. [2021-08-13 00:02:14,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.07692307692308) internal successors, (1496), 13 states have internal predecessors, (1496), 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-08-13 00:02:14,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 130.0) internal successors, (1820), 14 states have internal predecessors, (1820), 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-08-13 00:02:14,385 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 130.0) internal successors, (1820), 14 states have internal predecessors, (1820), 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-08-13 00:02:14,385 INFO L348 CegarLoopForPetriNet]: 137 programPoint places, 69 predicate places. [2021-08-13 00:02:14,385 INFO L482 AbstractCegarLoop]: Abstraction has has 206 places, 468 transitions, 3492 flow [2021-08-13 00:02:14,385 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 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-08-13 00:02:14,385 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:02:14,386 INFO L266 CegarLoopForPetriNet]: 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-08-13 00:02:14,386 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 00:02:14,386 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:02:14,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:02:14,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1898689080, now seen corresponding path program 3 times [2021-08-13 00:02:14,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:02:14,388 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594117026] [2021-08-13 00:02:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:02:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:02:14,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:14,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:14,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:14,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:14,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:14,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:14,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:14,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:14,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:14,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:14,449 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 00:02:14,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 00:02:14,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:14,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:02:14,473 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 00:02:14,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:14,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:14,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:02:14,483 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:02:14,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594117026] [2021-08-13 00:02:14,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594117026] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:02:14,483 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:02:14,483 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 00:02:14,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067033472] [2021-08-13 00:02:14,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 00:02:14,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:02:14,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 00:02:14,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-13 00:02:14,485 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 130 [2021-08-13 00:02:14,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 468 transitions, 3492 flow. Second operand has 9 states, 9 states have (on average 116.11111111111111) internal successors, (1045), 9 states have internal predecessors, (1045), 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-08-13 00:02:14,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:02:14,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 130 [2021-08-13 00:02:14,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:02:15,649 INFO L129 PetriNetUnfolder]: 3748/8398 cut-off events. [2021-08-13 00:02:15,649 INFO L130 PetriNetUnfolder]: For 5131/42427 co-relation queries the response was YES. [2021-08-13 00:02:15,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34196 conditions, 8398 events. 3748/8398 cut-off events. For 5131/42427 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 89156 event pairs, 0 based on Foata normal form. 1569/9149 useless extension candidates. Maximal degree in co-relation 34109. Up to 2951 conditions per place. [2021-08-13 00:02:15,748 INFO L132 encePairwiseOnDemand]: 119/130 looper letters, 28 selfloop transitions, 111 changer transitions 112/371 dead transitions. [2021-08-13 00:02:15,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 371 transitions, 2904 flow [2021-08-13 00:02:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-13 00:02:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-13 00:02:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2267 transitions. [2021-08-13 00:02:15,752 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9178137651821863 [2021-08-13 00:02:15,752 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2267 transitions. [2021-08-13 00:02:15,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2267 transitions. [2021-08-13 00:02:15,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:02:15,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2267 transitions. [2021-08-13 00:02:15,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 119.3157894736842) internal successors, (2267), 19 states have internal predecessors, (2267), 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-08-13 00:02:15,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 130.0) internal successors, (2600), 20 states have internal predecessors, (2600), 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-08-13 00:02:15,760 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 130.0) internal successors, (2600), 20 states have internal predecessors, (2600), 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-08-13 00:02:15,760 INFO L348 CegarLoopForPetriNet]: 137 programPoint places, 81 predicate places. [2021-08-13 00:02:15,760 INFO L482 AbstractCegarLoop]: Abstraction has has 218 places, 371 transitions, 2904 flow [2021-08-13 00:02:15,761 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 116.11111111111111) internal successors, (1045), 9 states have internal predecessors, (1045), 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-08-13 00:02:15,761 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:02:15,761 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:02:15,761 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 00:02:15,761 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:02:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:02:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash -424020362, now seen corresponding path program 1 times [2021-08-13 00:02:15,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:02:15,762 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124355537] [2021-08-13 00:02:15,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:02:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:02:15,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:15,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:02:15,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:02:15,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 00:02:15,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 00:02:15,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 00:02:15,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:15,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-13 00:02:15,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-13 00:02:15,883 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:02:15,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:02:15,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:15,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:02:15,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:02:15,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:02:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:02:15,920 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:02:15,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124355537] [2021-08-13 00:02:15,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124355537] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:02:15,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:02:15,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 00:02:15,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092504230] [2021-08-13 00:02:15,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 00:02:15,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:02:15,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 00:02:15,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-13 00:02:15,922 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 130 [2021-08-13 00:02:15,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 371 transitions, 2904 flow. Second operand has 13 states, 13 states have (on average 107.46153846153847) internal successors, (1397), 13 states have internal predecessors, (1397), 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-08-13 00:02:15,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:02:15,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 130 [2021-08-13 00:02:15,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:02:18,781 INFO L129 PetriNetUnfolder]: 9619/22590 cut-off events. [2021-08-13 00:02:18,781 INFO L130 PetriNetUnfolder]: For 21421/85964 co-relation queries the response was YES. [2021-08-13 00:02:18,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90248 conditions, 22590 events. 9619/22590 cut-off events. For 21421/85964 co-relation queries the response was YES. Maximal size of possible extension queue 3573. Compared 286021 event pairs, 5 based on Foata normal form. 67/20740 useless extension candidates. Maximal degree in co-relation 90153. Up to 7493 conditions per place. [2021-08-13 00:02:19,060 INFO L132 encePairwiseOnDemand]: 118/130 looper letters, 18 selfloop transitions, 5 changer transitions 233/457 dead transitions. [2021-08-13 00:02:19,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 457 transitions, 3920 flow [2021-08-13 00:02:19,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 00:02:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 00:02:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1745 transitions. [2021-08-13 00:02:19,062 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8389423076923077 [2021-08-13 00:02:19,062 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1745 transitions. [2021-08-13 00:02:19,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1745 transitions. [2021-08-13 00:02:19,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:02:19,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1745 transitions. [2021-08-13 00:02:19,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 109.0625) internal successors, (1745), 16 states have internal predecessors, (1745), 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-08-13 00:02:19,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 130.0) internal successors, (2210), 17 states have internal predecessors, (2210), 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-08-13 00:02:19,077 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 130.0) internal successors, (2210), 17 states have internal predecessors, (2210), 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-08-13 00:02:19,077 INFO L348 CegarLoopForPetriNet]: 137 programPoint places, 96 predicate places. [2021-08-13 00:02:19,078 INFO L482 AbstractCegarLoop]: Abstraction has has 233 places, 457 transitions, 3920 flow [2021-08-13 00:02:19,078 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 107.46153846153847) internal successors, (1397), 13 states have internal predecessors, (1397), 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-08-13 00:02:19,078 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:02:19,078 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 00:02:19,078 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 00:02:19,078 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:02:19,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:02:19,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1832448580, now seen corresponding path program 2 times [2021-08-13 00:02:19,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:02:19,079 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785406845] [2021-08-13 00:02:19,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:02:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 00:02:19,109 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 00:02:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 00:02:19,138 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 00:02:19,179 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 00:02:19,179 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 00:02:19,179 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 00:02:19,182 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 00:02:19,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 12:02:19 BasicIcfg [2021-08-13 00:02:19,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 00:02:19,297 INFO L168 Benchmark]: Toolchain (without parser) took 12826.15 ms. Allocated memory was 179.3 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 141.9 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 469.2 MB. Max. memory is 8.0 GB. [2021-08-13 00:02:19,297 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 179.3 MB. Free memory was 160.3 MB in the beginning and 160.2 MB in the end (delta: 82.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 00:02:19,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.08 ms. Allocated memory is still 179.3 MB. Free memory was 141.7 MB in the beginning and 137.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 6.0 MB. Max. memory is 8.0 GB. [2021-08-13 00:02:19,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.68 ms. Allocated memory is still 179.3 MB. Free memory was 137.8 MB in the beginning and 135.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 00:02:19,300 INFO L168 Benchmark]: Boogie Preprocessor took 46.88 ms. Allocated memory is still 179.3 MB. Free memory was 135.0 MB in the beginning and 132.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 00:02:19,300 INFO L168 Benchmark]: RCFGBuilder took 1744.64 ms. Allocated memory was 179.3 MB in the beginning and 217.1 MB in the end (delta: 37.7 MB). Free memory was 132.5 MB in the beginning and 188.6 MB in the end (delta: -56.1 MB). Peak memory consumption was 91.7 MB. Max. memory is 8.0 GB. [2021-08-13 00:02:19,300 INFO L168 Benchmark]: TraceAbstraction took 10409.00 ms. Allocated memory was 217.1 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 188.1 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 477.2 MB. Max. memory is 8.0 GB. [2021-08-13 00:02:19,301 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.16 ms. Allocated memory is still 179.3 MB. Free memory was 160.3 MB in the beginning and 160.2 MB in the end (delta: 82.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 524.08 ms. Allocated memory is still 179.3 MB. Free memory was 141.7 MB in the beginning and 137.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 6.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 95.68 ms. Allocated memory is still 179.3 MB. Free memory was 137.8 MB in the beginning and 135.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.88 ms. Allocated memory is still 179.3 MB. Free memory was 135.0 MB in the beginning and 132.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1744.64 ms. Allocated memory was 179.3 MB in the beginning and 217.1 MB in the end (delta: 37.7 MB). Free memory was 132.5 MB in the beginning and 188.6 MB in the end (delta: -56.1 MB). Peak memory consumption was 91.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10409.00 ms. Allocated memory was 217.1 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 188.1 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 477.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L742] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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}] [L745] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L747] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L848] 0 pthread_t t1149; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L849] FCALL, FORK 0 pthread_create(&t1149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L850] 0 pthread_t t1150; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L851] FCALL, FORK 0 pthread_create(&t1150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L852] 0 pthread_t t1151; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L853] FCALL, FORK 0 pthread_create(&t1151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L854] 0 pthread_t t1152; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L855] FCALL, FORK 0 pthread_create(&t1152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L817] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L769] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L784] 3 y = 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L787] 3 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L790] 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) [L790] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L790] 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) [L790] 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) [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L792] 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 [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 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 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L826] 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) [L826] 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) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L828] 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 [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L830] 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 [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L861] 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) [L861] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L861] 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) [L861] 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) [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L863] 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 [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L865] 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 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] 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) [L872] 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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 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)) [L878] 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)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 10.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10213.0ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 8506.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 42.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 122 SDtfs, 423 SDslu, 510 SDs, 0 SdLazy, 835 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 626.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1329.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3920occurred in iteration=10, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 45.6ms SsaConstructionTime, 379.3ms SatisfiabilityAnalysisTime, 1013.1ms InterpolantComputationTime, 992 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 881 ConstructedInterpolants, 0 QuantifiedInterpolants, 3114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...