/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:39:21,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:39:21,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:39:21,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:39:21,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:39:21,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:39:21,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:39:21,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:39:21,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:39:21,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:39:21,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:39:21,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:39:21,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:39:21,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:39:21,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:39:21,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:39:21,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:39:21,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:39:21,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:39:21,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:39:21,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:39:21,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:39:21,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:39:21,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:39:21,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:39:21,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:39:21,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:39:21,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:39:21,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:39:21,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:39:21,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:39:21,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:39:21,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:39:21,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:39:21,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:39:21,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:39:21,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:39:21,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:39:21,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:39:21,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:39:21,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:39:21,127 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-Before.epf [2022-01-19 04:39:21,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:39:21,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:39:21,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:39:21,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:39:21,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:39:21,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:39:21,155 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:39:21,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:39:21,155 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:39:21,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:39:21,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:39:21,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:39:21,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:39:21,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:39:21,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:39:21,156 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:39:21,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:39:21,157 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:39:21,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:39:21,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:39:21,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:39:21,157 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:39:21,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:39:21,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:39:21,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:39:21,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:39:21,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:39:21,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:39:21,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:39:21,158 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:39:21,158 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:39:21,158 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:39:21,158 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 [2022-01-19 04:39:21,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:39:21,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:39:21,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:39:21,353 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:39:21,353 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:39:21,354 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2022-01-19 04:39:21,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f9452be/73d79fdea7554486b4f371c8e81d8f25/FLAGe35236dd2 [2022-01-19 04:39:21,824 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:39:21,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2022-01-19 04:39:21,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f9452be/73d79fdea7554486b4f371c8e81d8f25/FLAGe35236dd2 [2022-01-19 04:39:22,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f9452be/73d79fdea7554486b4f371c8e81d8f25 [2022-01-19 04:39:22,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:39:22,173 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:39:22,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:39:22,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:39:22,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:39:22,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39331145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22, skipping insertion in model container [2022-01-19 04:39:22,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:39:22,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:39:22,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2022-01-19 04:39:22,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:39:22,523 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:39:22,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2022-01-19 04:39:22,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:39:22,608 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:39:22,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22 WrapperNode [2022-01-19 04:39:22,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:39:22,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:39:22,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:39:22,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:39:22,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,671 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 281 [2022-01-19 04:39:22,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:39:22,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:39:22,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:39:22,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:39:22,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:39:22,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:39:22,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:39:22,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:39:22,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22" (1/1) ... [2022-01-19 04:39:22,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:39:22,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:39:22,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 04:39:22,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 04:39:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:39:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:39:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:39:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:39:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:39:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:39:22,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:39:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:39:22,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:39:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 04:39:22,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 04:39:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:39:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:39:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:39:22,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:39:22,773 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 04:39:22,851 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:39:22,852 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:39:23,250 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:39:23,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:39:23,475 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:39:23,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:39:23 BoogieIcfgContainer [2022-01-19 04:39:23,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:39:23,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:39:23,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:39:23,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:39:23,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:39:22" (1/3) ... [2022-01-19 04:39:23,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e65eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:39:23, skipping insertion in model container [2022-01-19 04:39:23,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:22" (2/3) ... [2022-01-19 04:39:23,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e65eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:39:23, skipping insertion in model container [2022-01-19 04:39:23,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:39:23" (3/3) ... [2022-01-19 04:39:23,483 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2022-01-19 04:39:23,488 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:39:23,488 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:39:23,489 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:39:23,530 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,530 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,530 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,531 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,531 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,531 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,531 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,531 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,531 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,532 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,532 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,533 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,533 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,533 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,533 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,533 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,534 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,534 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,534 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,534 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,534 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,534 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,535 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,535 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,535 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,535 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,535 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,535 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,536 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,536 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,536 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,536 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,536 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,537 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,538 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,539 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,539 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,540 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,540 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,540 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,540 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,541 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,541 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,541 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,541 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,541 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,541 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,541 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,541 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,541 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,541 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,542 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,543 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,543 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,543 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,544 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,544 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,544 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,544 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,546 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,550 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,550 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,550 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,550 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,552 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,552 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,552 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,552 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,552 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,553 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,554 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,555 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,556 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,556 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,556 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,556 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,556 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,556 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,556 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,556 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,557 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,558 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,558 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,558 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,559 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,559 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,560 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,560 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,560 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,560 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,561 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,562 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,564 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,564 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,564 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,564 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,564 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,564 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,565 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,565 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,565 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,565 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,565 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,565 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,565 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,565 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,566 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,566 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,566 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,566 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,572 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,572 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,572 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,572 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,572 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,572 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,572 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,573 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,575 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,576 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,576 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,576 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,576 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,576 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,577 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,577 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,577 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,577 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,577 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,577 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,577 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,577 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,577 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,577 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,577 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,582 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,582 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,583 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,583 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,583 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,583 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,583 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,583 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,583 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,583 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,583 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,583 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,583 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,584 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,584 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,584 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,584 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,584 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,584 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,584 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,584 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,584 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,584 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,584 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,585 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,586 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,586 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,586 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,586 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:23,586 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:39:23,628 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:39:23,640 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:39:23,640 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 04:39:23,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2022-01-19 04:39:23,692 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2022-01-19 04:39:23,692 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:39:23,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-01-19 04:39:23,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2022-01-19 04:39:23,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2022-01-19 04:39:23,720 INFO L129 PetriNetUnfolder]: 0/76 cut-off events. [2022-01-19 04:39:23,720 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:39:23,720 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:23,721 INFO L254 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] [2022-01-19 04:39:23,722 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:23,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:23,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1251871241, now seen corresponding path program 1 times [2022-01-19 04:39:23,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:23,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481469334] [2022-01-19 04:39:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:23,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:23,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:23,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481469334] [2022-01-19 04:39:23,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481469334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:23,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:23,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:39:23,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337809123] [2022-01-19 04:39:23,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:23,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:39:23,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:24,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:39:24,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:39:24,010 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 118 [2022-01-19 04:39:24,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 115 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:24,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:24,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 118 [2022-01-19 04:39:24,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:24,101 INFO L129 PetriNetUnfolder]: 14/154 cut-off events. [2022-01-19 04:39:24,101 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 04:39:24,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 154 events. 14/154 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 287 event pairs, 2 based on Foata normal form. 7/152 useless extension candidates. Maximal degree in co-relation 146. Up to 25 conditions per place. [2022-01-19 04:39:24,105 INFO L132 encePairwiseOnDemand]: 113/118 looper letters, 9 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-01-19 04:39:24,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 113 transitions, 257 flow [2022-01-19 04:39:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:39:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:39:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2022-01-19 04:39:24,118 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9350282485875706 [2022-01-19 04:39:24,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2022-01-19 04:39:24,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2022-01-19 04:39:24,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:24,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2022-01-19 04:39:24,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:24,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:24,133 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:24,134 INFO L186 Difference]: Start difference. First operand has 123 places, 115 transitions, 239 flow. Second operand 3 states and 331 transitions. [2022-01-19 04:39:24,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 113 transitions, 257 flow [2022-01-19 04:39:24,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 113 transitions, 254 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 04:39:24,140 INFO L242 Difference]: Finished difference. Result has 120 places, 111 transitions, 232 flow [2022-01-19 04:39:24,142 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2022-01-19 04:39:24,144 INFO L334 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2022-01-19 04:39:24,144 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 232 flow [2022-01-19 04:39:24,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:24,145 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:24,145 INFO L254 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] [2022-01-19 04:39:24,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:39:24,145 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1337773493, now seen corresponding path program 1 times [2022-01-19 04:39:24,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:24,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013674539] [2022-01-19 04:39:24,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:24,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:24,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:24,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013674539] [2022-01-19 04:39:24,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013674539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:24,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:24,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:24,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252238367] [2022-01-19 04:39:24,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:24,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:24,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:24,407 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 118 [2022-01-19 04:39:24,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:24,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:24,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 118 [2022-01-19 04:39:24,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:24,874 INFO L129 PetriNetUnfolder]: 588/1721 cut-off events. [2022-01-19 04:39:24,874 INFO L130 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-01-19 04:39:24,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2741 conditions, 1721 events. 588/1721 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 12385 event pairs, 79 based on Foata normal form. 0/1673 useless extension candidates. Maximal degree in co-relation 2682. Up to 460 conditions per place. [2022-01-19 04:39:24,885 INFO L132 encePairwiseOnDemand]: 112/118 looper letters, 27 selfloop transitions, 2 changer transitions 57/163 dead transitions. [2022-01-19 04:39:24,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 163 transitions, 502 flow [2022-01-19 04:39:24,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:39:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:39:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions. [2022-01-19 04:39:24,888 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8436911487758946 [2022-01-19 04:39:24,888 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 896 transitions. [2022-01-19 04:39:24,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions. [2022-01-19 04:39:24,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:24,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions. [2022-01-19 04:39:24,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.55555555555556) internal successors, (896), 9 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:24,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:24,893 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:24,894 INFO L186 Difference]: Start difference. First operand has 120 places, 111 transitions, 232 flow. Second operand 9 states and 896 transitions. [2022-01-19 04:39:24,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 163 transitions, 502 flow [2022-01-19 04:39:24,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 163 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:39:24,898 INFO L242 Difference]: Finished difference. Result has 133 places, 99 transitions, 224 flow [2022-01-19 04:39:24,898 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=224, PETRI_PLACES=133, PETRI_TRANSITIONS=99} [2022-01-19 04:39:24,898 INFO L334 CegarLoopForPetriNet]: 123 programPoint places, 10 predicate places. [2022-01-19 04:39:24,898 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 99 transitions, 224 flow [2022-01-19 04:39:24,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:24,899 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:24,899 INFO L254 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] [2022-01-19 04:39:24,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:39:24,899 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:24,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:24,899 INFO L85 PathProgramCache]: Analyzing trace with hash 239328245, now seen corresponding path program 1 times [2022-01-19 04:39:24,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:24,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294648383] [2022-01-19 04:39:24,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:24,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:25,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:25,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294648383] [2022-01-19 04:39:25,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294648383] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:25,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:25,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:39:25,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130947281] [2022-01-19 04:39:25,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:25,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:39:25,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:25,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:39:25,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:39:25,040 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 118 [2022-01-19 04:39:25,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 99 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:25,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:25,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 118 [2022-01-19 04:39:25,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:25,203 INFO L129 PetriNetUnfolder]: 70/290 cut-off events. [2022-01-19 04:39:25,203 INFO L130 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-01-19 04:39:25,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 290 events. 70/290 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 998 event pairs, 16 based on Foata normal form. 8/290 useless extension candidates. Maximal degree in co-relation 480. Up to 57 conditions per place. [2022-01-19 04:39:25,204 INFO L132 encePairwiseOnDemand]: 112/118 looper letters, 15 selfloop transitions, 2 changer transitions 22/123 dead transitions. [2022-01-19 04:39:25,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 123 transitions, 368 flow [2022-01-19 04:39:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:39:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:39:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 923 transitions. [2022-01-19 04:39:25,206 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8691148775894538 [2022-01-19 04:39:25,206 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 923 transitions. [2022-01-19 04:39:25,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 923 transitions. [2022-01-19 04:39:25,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:25,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 923 transitions. [2022-01-19 04:39:25,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.55555555555556) internal successors, (923), 9 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:25,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:25,210 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:25,210 INFO L186 Difference]: Start difference. First operand has 133 places, 99 transitions, 224 flow. Second operand 9 states and 923 transitions. [2022-01-19 04:39:25,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 123 transitions, 368 flow [2022-01-19 04:39:25,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 123 transitions, 336 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-01-19 04:39:25,216 INFO L242 Difference]: Finished difference. Result has 122 places, 99 transitions, 228 flow [2022-01-19 04:39:25,216 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=228, PETRI_PLACES=122, PETRI_TRANSITIONS=99} [2022-01-19 04:39:25,217 INFO L334 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2022-01-19 04:39:25,217 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 99 transitions, 228 flow [2022-01-19 04:39:25,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:25,218 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:25,218 INFO L254 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] [2022-01-19 04:39:25,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:39:25,218 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:25,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:25,219 INFO L85 PathProgramCache]: Analyzing trace with hash 834917796, now seen corresponding path program 1 times [2022-01-19 04:39:25,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:25,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365710935] [2022-01-19 04:39:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:25,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:25,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:25,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365710935] [2022-01-19 04:39:25,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365710935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:25,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:25,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:39:25,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812912423] [2022-01-19 04:39:25,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:25,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:39:25,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:39:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:39:25,391 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 118 [2022-01-19 04:39:25,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 99 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:25,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:25,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 118 [2022-01-19 04:39:25,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:25,680 INFO L129 PetriNetUnfolder]: 556/1225 cut-off events. [2022-01-19 04:39:25,680 INFO L130 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-01-19 04:39:25,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 1225 events. 556/1225 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7659 event pairs, 16 based on Foata normal form. 0/1200 useless extension candidates. Maximal degree in co-relation 2333. Up to 343 conditions per place. [2022-01-19 04:39:25,686 INFO L132 encePairwiseOnDemand]: 108/118 looper letters, 28 selfloop transitions, 6 changer transitions 45/159 dead transitions. [2022-01-19 04:39:25,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 159 transitions, 531 flow [2022-01-19 04:39:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:39:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:39:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1031 transitions. [2022-01-19 04:39:25,689 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8737288135593221 [2022-01-19 04:39:25,689 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1031 transitions. [2022-01-19 04:39:25,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1031 transitions. [2022-01-19 04:39:25,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:25,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1031 transitions. [2022-01-19 04:39:25,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.1) internal successors, (1031), 10 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:25,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:25,693 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:25,693 INFO L186 Difference]: Start difference. First operand has 122 places, 99 transitions, 228 flow. Second operand 10 states and 1031 transitions. [2022-01-19 04:39:25,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 159 transitions, 531 flow [2022-01-19 04:39:25,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 159 transitions, 501 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-01-19 04:39:25,699 INFO L242 Difference]: Finished difference. Result has 123 places, 101 transitions, 266 flow [2022-01-19 04:39:25,700 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=266, PETRI_PLACES=123, PETRI_TRANSITIONS=101} [2022-01-19 04:39:25,700 INFO L334 CegarLoopForPetriNet]: 123 programPoint places, 0 predicate places. [2022-01-19 04:39:25,701 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 101 transitions, 266 flow [2022-01-19 04:39:25,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:25,701 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:25,701 INFO L254 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] [2022-01-19 04:39:25,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:39:25,701 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:25,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1904461213, now seen corresponding path program 1 times [2022-01-19 04:39:25,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:25,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257325093] [2022-01-19 04:39:25,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:25,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:25,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:25,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257325093] [2022-01-19 04:39:25,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257325093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:25,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:25,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:25,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270663997] [2022-01-19 04:39:25,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:25,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:25,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:25,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:25,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:25,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 118 [2022-01-19 04:39:25,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 101 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:25,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:25,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 118 [2022-01-19 04:39:25,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:26,056 INFO L129 PetriNetUnfolder]: 212/614 cut-off events. [2022-01-19 04:39:26,056 INFO L130 PetriNetUnfolder]: For 597/605 co-relation queries the response was YES. [2022-01-19 04:39:26,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 614 events. 212/614 cut-off events. For 597/605 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3271 event pairs, 4 based on Foata normal form. 22/634 useless extension candidates. Maximal degree in co-relation 1541. Up to 154 conditions per place. [2022-01-19 04:39:26,059 INFO L132 encePairwiseOnDemand]: 109/118 looper letters, 33 selfloop transitions, 9 changer transitions 35/157 dead transitions. [2022-01-19 04:39:26,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 157 transitions, 672 flow [2022-01-19 04:39:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:39:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:39:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1029 transitions. [2022-01-19 04:39:26,062 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8720338983050847 [2022-01-19 04:39:26,062 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1029 transitions. [2022-01-19 04:39:26,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1029 transitions. [2022-01-19 04:39:26,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:26,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1029 transitions. [2022-01-19 04:39:26,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.9) internal successors, (1029), 10 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,067 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,067 INFO L186 Difference]: Start difference. First operand has 123 places, 101 transitions, 266 flow. Second operand 10 states and 1029 transitions. [2022-01-19 04:39:26,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 157 transitions, 672 flow [2022-01-19 04:39:26,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 157 transitions, 648 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-19 04:39:26,072 INFO L242 Difference]: Finished difference. Result has 127 places, 104 transitions, 334 flow [2022-01-19 04:39:26,072 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=334, PETRI_PLACES=127, PETRI_TRANSITIONS=104} [2022-01-19 04:39:26,074 INFO L334 CegarLoopForPetriNet]: 123 programPoint places, 4 predicate places. [2022-01-19 04:39:26,074 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 104 transitions, 334 flow [2022-01-19 04:39:26,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,074 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:26,074 INFO L254 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] [2022-01-19 04:39:26,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:39:26,074 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash 985825364, now seen corresponding path program 1 times [2022-01-19 04:39:26,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:26,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634041305] [2022-01-19 04:39:26,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:26,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:26,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:26,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634041305] [2022-01-19 04:39:26,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634041305] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:26,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:26,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:39:26,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947555861] [2022-01-19 04:39:26,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:26,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:39:26,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:26,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:39:26,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:39:26,233 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 118 [2022-01-19 04:39:26,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 104 transitions, 334 flow. Second operand has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,234 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:26,234 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 118 [2022-01-19 04:39:26,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:26,398 INFO L129 PetriNetUnfolder]: 65/287 cut-off events. [2022-01-19 04:39:26,398 INFO L130 PetriNetUnfolder]: For 498/498 co-relation queries the response was YES. [2022-01-19 04:39:26,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 287 events. 65/287 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1034 event pairs, 4 based on Foata normal form. 8/293 useless extension candidates. Maximal degree in co-relation 744. Up to 59 conditions per place. [2022-01-19 04:39:26,400 INFO L132 encePairwiseOnDemand]: 109/118 looper letters, 23 selfloop transitions, 12 changer transitions 21/136 dead transitions. [2022-01-19 04:39:26,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 620 flow [2022-01-19 04:39:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 04:39:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 04:39:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1103 transitions. [2022-01-19 04:39:26,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.849768875192604 [2022-01-19 04:39:26,402 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1103 transitions. [2022-01-19 04:39:26,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1103 transitions. [2022-01-19 04:39:26,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:26,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1103 transitions. [2022-01-19 04:39:26,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.27272727272727) internal successors, (1103), 11 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) [2022-01-19 04:39:26,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 118.0) internal successors, (1416), 12 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,406 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 118.0) internal successors, (1416), 12 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,406 INFO L186 Difference]: Start difference. First operand has 127 places, 104 transitions, 334 flow. Second operand 11 states and 1103 transitions. [2022-01-19 04:39:26,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 620 flow [2022-01-19 04:39:26,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 136 transitions, 513 flow, removed 40 selfloop flow, removed 11 redundant places. [2022-01-19 04:39:26,410 INFO L242 Difference]: Finished difference. Result has 128 places, 104 transitions, 316 flow [2022-01-19 04:39:26,410 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=316, PETRI_PLACES=128, PETRI_TRANSITIONS=104} [2022-01-19 04:39:26,412 INFO L334 CegarLoopForPetriNet]: 123 programPoint places, 5 predicate places. [2022-01-19 04:39:26,412 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 104 transitions, 316 flow [2022-01-19 04:39:26,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,412 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:26,413 INFO L254 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] [2022-01-19 04:39:26,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:39:26,413 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1334624652, now seen corresponding path program 1 times [2022-01-19 04:39:26,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:26,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452393727] [2022-01-19 04:39:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:26,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:26,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:26,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452393727] [2022-01-19 04:39:26,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452393727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:26,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:26,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:26,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340844700] [2022-01-19 04:39:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:26,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:26,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:26,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:26,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:26,582 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 118 [2022-01-19 04:39:26,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 104 transitions, 316 flow. Second operand has 7 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:26,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 118 [2022-01-19 04:39:26,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:26,739 INFO L129 PetriNetUnfolder]: 93/397 cut-off events. [2022-01-19 04:39:26,739 INFO L130 PetriNetUnfolder]: For 262/272 co-relation queries the response was YES. [2022-01-19 04:39:26,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 397 events. 93/397 cut-off events. For 262/272 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1797 event pairs, 10 based on Foata normal form. 1/389 useless extension candidates. Maximal degree in co-relation 795. Up to 108 conditions per place. [2022-01-19 04:39:26,741 INFO L132 encePairwiseOnDemand]: 105/118 looper letters, 27 selfloop transitions, 9 changer transitions 5/121 dead transitions. [2022-01-19 04:39:26,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 121 transitions, 436 flow [2022-01-19 04:39:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 04:39:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 04:39:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 754 transitions. [2022-01-19 04:39:26,743 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.798728813559322 [2022-01-19 04:39:26,743 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 754 transitions. [2022-01-19 04:39:26,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 754 transitions. [2022-01-19 04:39:26,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:26,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 754 transitions. [2022-01-19 04:39:26,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.25) internal successors, (754), 8 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 118.0) internal successors, (1062), 9 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,746 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 118.0) internal successors, (1062), 9 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,746 INFO L186 Difference]: Start difference. First operand has 128 places, 104 transitions, 316 flow. Second operand 8 states and 754 transitions. [2022-01-19 04:39:26,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 121 transitions, 436 flow [2022-01-19 04:39:26,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 354 flow, removed 22 selfloop flow, removed 15 redundant places. [2022-01-19 04:39:26,749 INFO L242 Difference]: Finished difference. Result has 121 places, 108 transitions, 285 flow [2022-01-19 04:39:26,749 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=285, PETRI_PLACES=121, PETRI_TRANSITIONS=108} [2022-01-19 04:39:26,749 INFO L334 CegarLoopForPetriNet]: 123 programPoint places, -2 predicate places. [2022-01-19 04:39:26,749 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 108 transitions, 285 flow [2022-01-19 04:39:26,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,750 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:26,750 INFO L254 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] [2022-01-19 04:39:26,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:39:26,750 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1330390274, now seen corresponding path program 2 times [2022-01-19 04:39:26,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:26,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147791971] [2022-01-19 04:39:26,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:26,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:26,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:26,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147791971] [2022-01-19 04:39:26,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147791971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:26,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:26,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:26,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983906051] [2022-01-19 04:39:26,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:26,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:26,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:26,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:26,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:26,849 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 118 [2022-01-19 04:39:26,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 108 transitions, 285 flow. Second operand has 7 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:26,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:26,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 118 [2022-01-19 04:39:26,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:27,017 INFO L129 PetriNetUnfolder]: 113/517 cut-off events. [2022-01-19 04:39:27,018 INFO L130 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-01-19 04:39:27,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 517 events. 113/517 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2838 event pairs, 6 based on Foata normal form. 1/507 useless extension candidates. Maximal degree in co-relation 972. Up to 116 conditions per place. [2022-01-19 04:39:27,020 INFO L132 encePairwiseOnDemand]: 104/118 looper letters, 32 selfloop transitions, 11 changer transitions 5/128 dead transitions. [2022-01-19 04:39:27,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 128 transitions, 451 flow [2022-01-19 04:39:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 04:39:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 04:39:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 755 transitions. [2022-01-19 04:39:27,022 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7997881355932204 [2022-01-19 04:39:27,022 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 755 transitions. [2022-01-19 04:39:27,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 755 transitions. [2022-01-19 04:39:27,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:27,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 755 transitions. [2022-01-19 04:39:27,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.375) internal successors, (755), 8 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:27,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 118.0) internal successors, (1062), 9 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:27,024 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 118.0) internal successors, (1062), 9 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:27,025 INFO L186 Difference]: Start difference. First operand has 121 places, 108 transitions, 285 flow. Second operand 8 states and 755 transitions. [2022-01-19 04:39:27,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 128 transitions, 451 flow [2022-01-19 04:39:27,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 128 transitions, 432 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-01-19 04:39:27,027 INFO L242 Difference]: Finished difference. Result has 125 places, 114 transitions, 351 flow [2022-01-19 04:39:27,027 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=351, PETRI_PLACES=125, PETRI_TRANSITIONS=114} [2022-01-19 04:39:27,027 INFO L334 CegarLoopForPetriNet]: 123 programPoint places, 2 predicate places. [2022-01-19 04:39:27,027 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 114 transitions, 351 flow [2022-01-19 04:39:27,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:27,028 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:27,028 INFO L254 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] [2022-01-19 04:39:27,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:39:27,028 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:27,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1024950620, now seen corresponding path program 3 times [2022-01-19 04:39:27,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:27,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766086171] [2022-01-19 04:39:27,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:27,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:27,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:27,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766086171] [2022-01-19 04:39:27,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766086171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:27,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:27,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 04:39:27,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229208074] [2022-01-19 04:39:27,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:27,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 04:39:27,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 04:39:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-19 04:39:27,282 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 118 [2022-01-19 04:39:27,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 114 transitions, 351 flow. Second operand has 13 states, 13 states have (on average 90.84615384615384) internal successors, (1181), 13 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:27,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:27,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 118 [2022-01-19 04:39:27,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:27,505 INFO L129 PetriNetUnfolder]: 70/422 cut-off events. [2022-01-19 04:39:27,505 INFO L130 PetriNetUnfolder]: For 106/213 co-relation queries the response was YES. [2022-01-19 04:39:27,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 422 events. 70/422 cut-off events. For 106/213 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2161 event pairs, 2 based on Foata normal form. 1/409 useless extension candidates. Maximal degree in co-relation 793. Up to 56 conditions per place. [2022-01-19 04:39:27,507 INFO L132 encePairwiseOnDemand]: 104/118 looper letters, 17 selfloop transitions, 10 changer transitions 16/130 dead transitions. [2022-01-19 04:39:27,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 130 transitions, 519 flow [2022-01-19 04:39:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 04:39:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 04:39:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1460 transitions. [2022-01-19 04:39:27,509 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7733050847457628 [2022-01-19 04:39:27,509 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1460 transitions. [2022-01-19 04:39:27,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1460 transitions. [2022-01-19 04:39:27,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:27,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1460 transitions. [2022-01-19 04:39:27,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 91.25) internal successors, (1460), 16 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:27,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 118.0) internal successors, (2006), 17 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:27,514 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 118.0) internal successors, (2006), 17 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:27,514 INFO L186 Difference]: Start difference. First operand has 125 places, 114 transitions, 351 flow. Second operand 16 states and 1460 transitions. [2022-01-19 04:39:27,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 130 transitions, 519 flow [2022-01-19 04:39:27,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 130 transitions, 490 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-01-19 04:39:27,517 INFO L242 Difference]: Finished difference. Result has 139 places, 114 transitions, 383 flow [2022-01-19 04:39:27,517 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=383, PETRI_PLACES=139, PETRI_TRANSITIONS=114} [2022-01-19 04:39:27,517 INFO L334 CegarLoopForPetriNet]: 123 programPoint places, 16 predicate places. [2022-01-19 04:39:27,518 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 114 transitions, 383 flow [2022-01-19 04:39:27,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 90.84615384615384) internal successors, (1181), 13 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:27,518 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:27,518 INFO L254 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] [2022-01-19 04:39:27,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:39:27,519 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1247912498, now seen corresponding path program 4 times [2022-01-19 04:39:27,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:27,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766924080] [2022-01-19 04:39:27,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:27,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:39:27,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:39:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:39:27,656 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:39:27,656 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:39:27,657 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 04:39:27,658 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 04:39:27,661 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 04:39:27,661 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-19 04:39:27,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-19 04:39:27,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 04:39:27,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:39:27,664 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:27,668 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:39:27,668 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:39:27,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:39:27 BasicIcfg [2022-01-19 04:39:27,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:39:27,751 INFO L158 Benchmark]: Toolchain (without parser) took 5578.57ms. Allocated memory was 377.5MB in the beginning and 505.4MB in the end (delta: 127.9MB). Free memory was 323.0MB in the beginning and 419.9MB in the end (delta: -96.9MB). Peak memory consumption was 274.3MB. Max. memory is 16.0GB. [2022-01-19 04:39:27,752 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 377.5MB. Free memory was 341.0MB in the beginning and 340.9MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:39:27,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.86ms. Allocated memory is still 377.5MB. Free memory was 322.8MB in the beginning and 336.5MB in the end (delta: -13.7MB). Peak memory consumption was 18.0MB. Max. memory is 16.0GB. [2022-01-19 04:39:27,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.06ms. Allocated memory is still 377.5MB. Free memory was 336.5MB in the beginning and 333.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:39:27,752 INFO L158 Benchmark]: Boogie Preprocessor took 39.39ms. Allocated memory is still 377.5MB. Free memory was 333.4MB in the beginning and 331.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:39:27,752 INFO L158 Benchmark]: RCFGBuilder took 765.28ms. Allocated memory is still 377.5MB. Free memory was 331.3MB in the beginning and 235.9MB in the end (delta: 95.4MB). Peak memory consumption was 96.5MB. Max. memory is 16.0GB. [2022-01-19 04:39:27,752 INFO L158 Benchmark]: TraceAbstraction took 4273.06ms. Allocated memory was 377.5MB in the beginning and 505.4MB in the end (delta: 127.9MB). Free memory was 235.9MB in the beginning and 419.9MB in the end (delta: -184.0MB). Peak memory consumption was 187.1MB. Max. memory is 16.0GB. [2022-01-19 04:39:27,754 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.09ms. Allocated memory is still 377.5MB. Free memory was 341.0MB in the beginning and 340.9MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 429.86ms. Allocated memory is still 377.5MB. Free memory was 322.8MB in the beginning and 336.5MB in the end (delta: -13.7MB). Peak memory consumption was 18.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 62.06ms. Allocated memory is still 377.5MB. Free memory was 336.5MB in the beginning and 333.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.39ms. Allocated memory is still 377.5MB. Free memory was 333.4MB in the beginning and 331.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 765.28ms. Allocated memory is still 377.5MB. Free memory was 331.3MB in the beginning and 235.9MB in the end (delta: 95.4MB). Peak memory consumption was 96.5MB. Max. memory is 16.0GB. * TraceAbstraction took 4273.06ms. Allocated memory was 377.5MB in the beginning and 505.4MB in the end (delta: 127.9MB). Free memory was 235.9MB in the beginning and 419.9MB in the end (delta: -184.0MB). Peak memory consumption was 187.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L727] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L728] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L729] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L730] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L731] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L736] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L737] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L738] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L739] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L740] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L741] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t65; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t65={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t65, ((void *)0), P0, ((void *)0))=-2, t65={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t66; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t65={5:0}, t66={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t66, ((void *)0), P1, ((void *)0))=-1, t65={5:0}, t66={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t67; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t67, ((void *)0), P2, ((void *)0))=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L775] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L776] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L777] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L778] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L779] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L780] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 411 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 715 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 940 IncrementalHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 92 mSDtfsCounter, 940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=9, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 843 NumberOfCodeBlocks, 843 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 4157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2022-01-19 04:39:27,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...