/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:36:59,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:36:59,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:36:59,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:36:59,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:36:59,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:36:59,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:36:59,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:36:59,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:36:59,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:36:59,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:36:59,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:36:59,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:36:59,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:36:59,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:36:59,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:36:59,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:36:59,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:36:59,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:36:59,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:36:59,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:36:59,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:36:59,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:36:59,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:36:59,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:36:59,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:36:59,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:36:59,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:36:59,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:36:59,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:36:59,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:36:59,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:36:59,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:36:59,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:36:59,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:36:59,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:36:59,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:36:59,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:36:59,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:36:59,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:36:59,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:36:59,641 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.epf [2022-01-18 22:36:59,663 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:36:59,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:36:59,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:36:59,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:36:59,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:36:59,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:36:59,664 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:36:59,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:36:59,665 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:36:59,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:36:59,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:36:59,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:36:59,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:36:59,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:36:59,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:36:59,666 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:36:59,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:36:59,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:36:59,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:36:59,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:36:59,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:36:59,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:36:59,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:36:59,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:36:59,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:36:59,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:36:59,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:36:59,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:36:59,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:36:59,667 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:36:59,667 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:36:59,667 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-18 22:36:59,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:36:59,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:36:59,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:36:59,864 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:36:59,867 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:36:59,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-01-18 22:36:59,930 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d5ab9d6/00ad75365fdd4542bf7b16af128a883c/FLAG07d9b925b [2022-01-18 22:37:00,271 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:37:00,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-01-18 22:37:00,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d5ab9d6/00ad75365fdd4542bf7b16af128a883c/FLAG07d9b925b [2022-01-18 22:37:00,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d5ab9d6/00ad75365fdd4542bf7b16af128a883c [2022-01-18 22:37:00,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:37:00,649 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:37:00,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:37:00,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:37:00,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:37:00,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:37:00" (1/1) ... [2022-01-18 22:37:00,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d0487d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:00, skipping insertion in model container [2022-01-18 22:37:00,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:37:00" (1/1) ... [2022-01-18 22:37:00,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:37:00,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:37:00,862 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/mix017_power.opt_rmo.opt.i[958,971] [2022-01-18 22:37:01,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:37:01,023 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:37:01,038 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/mix017_power.opt_rmo.opt.i[958,971] [2022-01-18 22:37:01,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:37:01,149 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:37:01,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01 WrapperNode [2022-01-18 22:37:01,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:37:01,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:37:01,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:37:01,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:37:01,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01" (1/1) ... [2022-01-18 22:37:01,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01" (1/1) ... [2022-01-18 22:37:01,219 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2022-01-18 22:37:01,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:37:01,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:37:01,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:37:01,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:37:01,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01" (1/1) ... [2022-01-18 22:37:01,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01" (1/1) ... [2022-01-18 22:37:01,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01" (1/1) ... [2022-01-18 22:37:01,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01" (1/1) ... [2022-01-18 22:37:01,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01" (1/1) ... [2022-01-18 22:37:01,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01" (1/1) ... [2022-01-18 22:37:01,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01" (1/1) ... [2022-01-18 22:37:01,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:37:01,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:37:01,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:37:01,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:37:01,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01" (1/1) ... [2022-01-18 22:37:01,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:37:01,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:37:01,276 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-18 22:37:01,286 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-18 22:37:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:37:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:37:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:37:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:37:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:37:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:37:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:37:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:37:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:37:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-18 22:37:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-18 22:37:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-18 22:37:01,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-18 22:37:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:37:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:37:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:37:01,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:37:01,317 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 22:37:01,436 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:37:01,437 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:37:01,888 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:37:02,085 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:37:02,085 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:37:02,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:37:02 BoogieIcfgContainer [2022-01-18 22:37:02,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:37:02,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:37:02,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:37:02,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:37:02,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:37:00" (1/3) ... [2022-01-18 22:37:02,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c39c094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:37:02, skipping insertion in model container [2022-01-18 22:37:02,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:37:01" (2/3) ... [2022-01-18 22:37:02,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c39c094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:37:02, skipping insertion in model container [2022-01-18 22:37:02,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:37:02" (3/3) ... [2022-01-18 22:37:02,094 INFO L111 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2022-01-18 22:37:02,100 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:37:02,100 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:37:02,100 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:37:02,153 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,154 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,154 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,154 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,154 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,154 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,154 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,155 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,156 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,156 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,156 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,156 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,157 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,158 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,158 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,158 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,158 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,158 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,158 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,159 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,159 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,159 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,159 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,160 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,160 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,160 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,160 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,161 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,161 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,161 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,161 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,161 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,161 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,161 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,161 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,161 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,163 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,163 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,163 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,163 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,163 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,163 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,163 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,164 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,164 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,164 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,164 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,164 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,164 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,166 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,166 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,166 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,166 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,167 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,167 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,167 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,167 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,167 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,167 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,167 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,167 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,168 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,168 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,168 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,168 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,168 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,168 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,168 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,168 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,168 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,169 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,169 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,169 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,169 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,169 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,169 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,170 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,170 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,171 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,171 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,172 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,174 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,178 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,178 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,178 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,178 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,179 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,181 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,181 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,181 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,182 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,182 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,182 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,182 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,182 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,182 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,182 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,183 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,183 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,183 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,183 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,183 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,183 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,184 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,184 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,185 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,185 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,186 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,186 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,186 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,186 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,187 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,187 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,187 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,187 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,187 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,188 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,188 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,188 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,189 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,190 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,190 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,190 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,191 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,191 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,191 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,191 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,191 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,191 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,192 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,192 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,192 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,192 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,192 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,192 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,192 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,193 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,193 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,193 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,193 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,193 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,193 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,194 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,195 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,195 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,195 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,195 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,198 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,199 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,199 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,199 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,199 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,199 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,199 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,199 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,200 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,200 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,200 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,200 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,201 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,201 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,201 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,202 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,202 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,202 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,202 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,202 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,202 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,203 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,203 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,204 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,205 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,205 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,206 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,207 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,207 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:37:02,208 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:37:02,258 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:37:02,263 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-18 22:37:02,263 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-18 22:37:02,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-01-18 22:37:02,330 INFO L129 PetriNetUnfolder]: 2/133 cut-off events. [2022-01-18 22:37:02,330 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:37:02,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-01-18 22:37:02,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-01-18 22:37:02,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-01-18 22:37:02,365 INFO L129 PetriNetUnfolder]: 0/77 cut-off events. [2022-01-18 22:37:02,365 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:37:02,365 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:02,366 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] [2022-01-18 22:37:02,366 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:02,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1810850912, now seen corresponding path program 1 times [2022-01-18 22:37:02,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:02,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529821370] [2022-01-18 22:37:02,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:02,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:37:02,724 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-18 22:37:02,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:37:02,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529821370] [2022-01-18 22:37:02,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529821370] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:37:02,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:37:02,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:37:02,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412269742] [2022-01-18 22:37:02,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:37:02,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:37:02,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:37:02,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:37:02,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:37:02,776 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2022-01-18 22:37:02,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:37:02,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:37:02,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2022-01-18 22:37:02,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:37:02,923 INFO L129 PetriNetUnfolder]: 37/318 cut-off events. [2022-01-18 22:37:02,923 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-18 22:37:02,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 318 events. 37/318 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1114 event pairs, 19 based on Foata normal form. 9/305 useless extension candidates. Maximal degree in co-relation 356. Up to 51 conditions per place. [2022-01-18 22:37:02,931 INFO L132 encePairwiseOnDemand]: 132/137 looper letters, 12 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2022-01-18 22:37:02,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 133 transitions, 309 flow [2022-01-18 22:37:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:37:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:37:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-01-18 22:37:02,948 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2022-01-18 22:37:02,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-01-18 22:37:02,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-01-18 22:37:02,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:37:02,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-01-18 22:37:02,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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-18 22:37:02,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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-18 22:37:02,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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-18 22:37:02,968 INFO L186 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 388 transitions. [2022-01-18 22:37:02,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 133 transitions, 309 flow [2022-01-18 22:37:02,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 133 transitions, 304 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-18 22:37:02,975 INFO L242 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-01-18 22:37:02,976 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-01-18 22:37:02,979 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-01-18 22:37:02,980 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-01-18 22:37:02,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:37:02,980 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:02,980 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] [2022-01-18 22:37:02,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:37:02,981 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:02,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash 544271704, now seen corresponding path program 1 times [2022-01-18 22:37:02,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:02,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725864276] [2022-01-18 22:37:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:02,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:37:03,204 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-18 22:37:03,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:37:03,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725864276] [2022-01-18 22:37:03,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725864276] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:37:03,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:37:03,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:37:03,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134180790] [2022-01-18 22:37:03,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:37:03,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:37:03,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:37:03,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:37:03,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:37:03,208 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2022-01-18 22:37:03,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 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-18 22:37:03,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:37:03,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2022-01-18 22:37:03,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:37:04,130 INFO L129 PetriNetUnfolder]: 1738/4375 cut-off events. [2022-01-18 22:37:04,131 INFO L130 PetriNetUnfolder]: For 188/188 co-relation queries the response was YES. [2022-01-18 22:37:04,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7115 conditions, 4375 events. 1738/4375 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 36368 event pairs, 266 based on Foata normal form. 0/4273 useless extension candidates. Maximal degree in co-relation 7053. Up to 1300 conditions per place. [2022-01-18 22:37:04,158 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 28 selfloop transitions, 2 changer transitions 62/183 dead transitions. [2022-01-18 22:37:04,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 183 transitions, 550 flow [2022-01-18 22:37:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:37:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:37:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1053 transitions. [2022-01-18 22:37:04,162 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8540145985401459 [2022-01-18 22:37:04,162 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1053 transitions. [2022-01-18 22:37:04,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1053 transitions. [2022-01-18 22:37:04,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:37:04,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1053 transitions. [2022-01-18 22:37:04,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 0 states have call successors, (0), 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-18 22:37:04,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-18 22:37:04,169 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-18 22:37:04,169 INFO L186 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 9 states and 1053 transitions. [2022-01-18 22:37:04,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 183 transitions, 550 flow [2022-01-18 22:37:04,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 183 transitions, 532 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:37:04,174 INFO L242 Difference]: Finished difference. Result has 153 places, 115 transitions, 258 flow [2022-01-18 22:37:04,174 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=258, PETRI_PLACES=153, PETRI_TRANSITIONS=115} [2022-01-18 22:37:04,175 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2022-01-18 22:37:04,175 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 115 transitions, 258 flow [2022-01-18 22:37:04,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 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-18 22:37:04,176 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:04,176 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] [2022-01-18 22:37:04,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:37:04,177 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:04,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1620445410, now seen corresponding path program 1 times [2022-01-18 22:37:04,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:04,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391208203] [2022-01-18 22:37:04,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:04,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:37:04,308 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-18 22:37:04,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:37:04,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391208203] [2022-01-18 22:37:04,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391208203] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:37:04,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:37:04,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:37:04,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270172876] [2022-01-18 22:37:04,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:37:04,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:37:04,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:37:04,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:37:04,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:37:04,311 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-18 22:37:04,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 115 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 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-18 22:37:04,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:37:04,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-18 22:37:04,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:37:05,059 INFO L129 PetriNetUnfolder]: 2005/3837 cut-off events. [2022-01-18 22:37:05,059 INFO L130 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2022-01-18 22:37:05,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7235 conditions, 3837 events. 2005/3837 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 28254 event pairs, 115 based on Foata normal form. 0/3746 useless extension candidates. Maximal degree in co-relation 7170. Up to 1189 conditions per place. [2022-01-18 22:37:05,084 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 32 selfloop transitions, 7 changer transitions 50/183 dead transitions. [2022-01-18 22:37:05,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 183 transitions, 578 flow [2022-01-18 22:37:05,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:37:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:37:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1211 transitions. [2022-01-18 22:37:05,087 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8839416058394161 [2022-01-18 22:37:05,087 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1211 transitions. [2022-01-18 22:37:05,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1211 transitions. [2022-01-18 22:37:05,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:37:05,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1211 transitions. [2022-01-18 22:37:05,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.1) internal successors, (1211), 10 states have internal predecessors, (1211), 0 states have call successors, (0), 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-18 22:37:05,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 22:37:05,094 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 22:37:05,094 INFO L186 Difference]: Start difference. First operand has 153 places, 115 transitions, 258 flow. Second operand 10 states and 1211 transitions. [2022-01-18 22:37:05,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 183 transitions, 578 flow [2022-01-18 22:37:05,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 183 transitions, 562 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-01-18 22:37:05,114 INFO L242 Difference]: Finished difference. Result has 140 places, 118 transitions, 308 flow [2022-01-18 22:37:05,114 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=308, PETRI_PLACES=140, PETRI_TRANSITIONS=118} [2022-01-18 22:37:05,116 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-01-18 22:37:05,116 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 118 transitions, 308 flow [2022-01-18 22:37:05,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 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-18 22:37:05,116 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:05,117 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, 1] [2022-01-18 22:37:05,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:37:05,117 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:05,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:05,117 INFO L85 PathProgramCache]: Analyzing trace with hash 477172693, now seen corresponding path program 1 times [2022-01-18 22:37:05,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:05,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518690005] [2022-01-18 22:37:05,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:05,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:37:05,286 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-18 22:37:05,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:37:05,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518690005] [2022-01-18 22:37:05,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518690005] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:37:05,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:37:05,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:37:05,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416998709] [2022-01-18 22:37:05,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:37:05,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:37:05,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:37:05,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:37:05,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:37:05,289 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-18 22:37:05,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 118 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 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-18 22:37:05,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:37:05,290 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-18 22:37:05,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:37:05,764 INFO L129 PetriNetUnfolder]: 1013/2244 cut-off events. [2022-01-18 22:37:05,764 INFO L130 PetriNetUnfolder]: For 2517/2545 co-relation queries the response was YES. [2022-01-18 22:37:05,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6209 conditions, 2244 events. 1013/2244 cut-off events. For 2517/2545 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16062 event pairs, 19 based on Foata normal form. 60/2288 useless extension candidates. Maximal degree in co-relation 6143. Up to 691 conditions per place. [2022-01-18 22:37:05,781 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 38 selfloop transitions, 11 changer transitions 39/182 dead transitions. [2022-01-18 22:37:05,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 182 transitions, 785 flow [2022-01-18 22:37:05,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:37:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:37:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1210 transitions. [2022-01-18 22:37:05,785 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8832116788321168 [2022-01-18 22:37:05,785 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1210 transitions. [2022-01-18 22:37:05,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1210 transitions. [2022-01-18 22:37:05,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:37:05,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1210 transitions. [2022-01-18 22:37:05,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 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-18 22:37:05,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 22:37:05,791 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 22:37:05,792 INFO L186 Difference]: Start difference. First operand has 140 places, 118 transitions, 308 flow. Second operand 10 states and 1210 transitions. [2022-01-18 22:37:05,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 182 transitions, 785 flow [2022-01-18 22:37:05,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 182 transitions, 760 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-18 22:37:05,802 INFO L242 Difference]: Finished difference. Result has 144 places, 122 transitions, 396 flow [2022-01-18 22:37:05,802 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=396, PETRI_PLACES=144, PETRI_TRANSITIONS=122} [2022-01-18 22:37:05,802 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2022-01-18 22:37:05,803 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 122 transitions, 396 flow [2022-01-18 22:37:05,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 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-18 22:37:05,803 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:05,803 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, 1, 1, 1, 1, 1] [2022-01-18 22:37:05,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:37:05,804 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:05,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1277435979, now seen corresponding path program 1 times [2022-01-18 22:37:05,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:05,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431601233] [2022-01-18 22:37:05,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:05,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:37:05,899 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-18 22:37:05,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:37:05,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431601233] [2022-01-18 22:37:05,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431601233] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:37:05,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:37:05,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:37:05,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938826250] [2022-01-18 22:37:05,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:37:05,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:37:05,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:37:05,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:37:05,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:37:05,902 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-01-18 22:37:05,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 122 transitions, 396 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 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-18 22:37:05,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:37:05,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-01-18 22:37:05,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:37:06,405 INFO L129 PetriNetUnfolder]: 803/2404 cut-off events. [2022-01-18 22:37:06,405 INFO L130 PetriNetUnfolder]: For 4273/4853 co-relation queries the response was YES. [2022-01-18 22:37:06,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6424 conditions, 2404 events. 803/2404 cut-off events. For 4273/4853 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 19613 event pairs, 150 based on Foata normal form. 45/2372 useless extension candidates. Maximal degree in co-relation 6353. Up to 522 conditions per place. [2022-01-18 22:37:06,428 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 53 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2022-01-18 22:37:06,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 161 transitions, 600 flow [2022-01-18 22:37:06,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:37:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:37:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2022-01-18 22:37:06,431 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.886339937434828 [2022-01-18 22:37:06,431 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2022-01-18 22:37:06,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2022-01-18 22:37:06,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:37:06,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2022-01-18 22:37:06,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 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-18 22:37:06,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-18 22:37:06,437 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-18 22:37:06,437 INFO L186 Difference]: Start difference. First operand has 144 places, 122 transitions, 396 flow. Second operand 7 states and 850 transitions. [2022-01-18 22:37:06,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 161 transitions, 600 flow [2022-01-18 22:37:06,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 161 transitions, 531 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-01-18 22:37:06,450 INFO L242 Difference]: Finished difference. Result has 142 places, 126 transitions, 366 flow [2022-01-18 22:37:06,450 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=142, PETRI_TRANSITIONS=126} [2022-01-18 22:37:06,452 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, -2 predicate places. [2022-01-18 22:37:06,452 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 126 transitions, 366 flow [2022-01-18 22:37:06,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 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-18 22:37:06,453 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:06,453 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, 1, 1, 1, 1, 1] [2022-01-18 22:37:06,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:37:06,453 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1811486057, now seen corresponding path program 2 times [2022-01-18 22:37:06,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:06,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102088091] [2022-01-18 22:37:06,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:06,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:37:06,610 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-18 22:37:06,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:37:06,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102088091] [2022-01-18 22:37:06,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102088091] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:37:06,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:37:06,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:37:06,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103851069] [2022-01-18 22:37:06,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:37:06,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:37:06,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:37:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:37:06,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:37:06,613 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-18 22:37:06,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 126 transitions, 366 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 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-18 22:37:06,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:37:06,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-18 22:37:06,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:37:07,059 INFO L129 PetriNetUnfolder]: 788/1983 cut-off events. [2022-01-18 22:37:07,059 INFO L130 PetriNetUnfolder]: For 2575/2671 co-relation queries the response was YES. [2022-01-18 22:37:07,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5429 conditions, 1983 events. 788/1983 cut-off events. For 2575/2671 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14509 event pairs, 24 based on Foata normal form. 67/2005 useless extension candidates. Maximal degree in co-relation 5361. Up to 518 conditions per place. [2022-01-18 22:37:07,073 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 43 selfloop transitions, 15 changer transitions 42/195 dead transitions. [2022-01-18 22:37:07,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 195 transitions, 915 flow [2022-01-18 22:37:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:37:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:37:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1331 transitions. [2022-01-18 22:37:07,077 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8832116788321168 [2022-01-18 22:37:07,077 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1331 transitions. [2022-01-18 22:37:07,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1331 transitions. [2022-01-18 22:37:07,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:37:07,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1331 transitions. [2022-01-18 22:37:07,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 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-18 22:37:07,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-18 22:37:07,083 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-18 22:37:07,083 INFO L186 Difference]: Start difference. First operand has 142 places, 126 transitions, 366 flow. Second operand 11 states and 1331 transitions. [2022-01-18 22:37:07,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 195 transitions, 915 flow [2022-01-18 22:37:07,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 195 transitions, 912 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-01-18 22:37:07,088 INFO L242 Difference]: Finished difference. Result has 157 places, 127 transitions, 464 flow [2022-01-18 22:37:07,089 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=464, PETRI_PLACES=157, PETRI_TRANSITIONS=127} [2022-01-18 22:37:07,089 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 13 predicate places. [2022-01-18 22:37:07,089 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 127 transitions, 464 flow [2022-01-18 22:37:07,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 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-18 22:37:07,090 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:07,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:37:07,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:37:07,090 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:07,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash 762723571, now seen corresponding path program 1 times [2022-01-18 22:37:07,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:07,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036310645] [2022-01-18 22:37:07,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:07,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:37:07,274 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-18 22:37:07,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:37:07,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036310645] [2022-01-18 22:37:07,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036310645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:37:07,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:37:07,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:37:07,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321527518] [2022-01-18 22:37:07,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:37:07,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:37:07,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:37:07,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:37:07,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:37:07,277 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-01-18 22:37:07,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 127 transitions, 464 flow. Second operand has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 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-18 22:37:07,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:37:07,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-01-18 22:37:07,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:37:07,879 INFO L129 PetriNetUnfolder]: 727/2605 cut-off events. [2022-01-18 22:37:07,880 INFO L130 PetriNetUnfolder]: For 6224/6674 co-relation queries the response was YES. [2022-01-18 22:37:07,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6915 conditions, 2605 events. 727/2605 cut-off events. For 6224/6674 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21912 event pairs, 203 based on Foata normal form. 108/2616 useless extension candidates. Maximal degree in co-relation 6834. Up to 514 conditions per place. [2022-01-18 22:37:07,906 INFO L132 encePairwiseOnDemand]: 125/137 looper letters, 49 selfloop transitions, 8 changer transitions 31/188 dead transitions. [2022-01-18 22:37:07,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 188 transitions, 822 flow [2022-01-18 22:37:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:37:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:37:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1254 transitions. [2022-01-18 22:37:07,909 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8321167883211679 [2022-01-18 22:37:07,910 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1254 transitions. [2022-01-18 22:37:07,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1254 transitions. [2022-01-18 22:37:07,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:37:07,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1254 transitions. [2022-01-18 22:37:07,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-18 22:37:07,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-18 22:37:07,916 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-18 22:37:07,916 INFO L186 Difference]: Start difference. First operand has 157 places, 127 transitions, 464 flow. Second operand 11 states and 1254 transitions. [2022-01-18 22:37:07,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 188 transitions, 822 flow [2022-01-18 22:37:07,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 188 transitions, 711 flow, removed 42 selfloop flow, removed 13 redundant places. [2022-01-18 22:37:07,942 INFO L242 Difference]: Finished difference. Result has 155 places, 132 transitions, 457 flow [2022-01-18 22:37:07,942 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=457, PETRI_PLACES=155, PETRI_TRANSITIONS=132} [2022-01-18 22:37:07,943 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 11 predicate places. [2022-01-18 22:37:07,943 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 132 transitions, 457 flow [2022-01-18 22:37:07,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 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-18 22:37:07,944 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:07,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:37:07,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:37:07,944 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1645174383, now seen corresponding path program 2 times [2022-01-18 22:37:07,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:07,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473422079] [2022-01-18 22:37:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:07,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:37:08,079 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-18 22:37:08,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:37:08,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473422079] [2022-01-18 22:37:08,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473422079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:37:08,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:37:08,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:37:08,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12515670] [2022-01-18 22:37:08,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:37:08,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:37:08,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:37:08,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:37:08,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:37:08,082 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-01-18 22:37:08,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 132 transitions, 457 flow. Second operand has 9 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 0 states have call successors, (0), 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-18 22:37:08,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:37:08,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-01-18 22:37:08,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:37:08,415 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([931] L770-->L786: Formula: (let ((.cse23 (= (mod v_~y$r_buff1_thd2~0_129 256) 0)) (.cse26 (= (mod v_~y$r_buff0_thd2~0_176 256) 0)) (.cse31 (= (mod v_~y$w_buff1_used~0_286 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse8 (and .cse26 .cse31)) (.cse10 (and .cse26 .cse23)) (.cse17 (not .cse23)) (.cse2 (not .cse26)) (.cse30 (= (mod v_~y$w_buff0_used~0_366 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_365 256) 0)) (.cse24 (= (mod v_~y$w_buff1_used~0_285 256) 0))) (let ((.cse21 (not .cse24)) (.cse5 (or .cse26 .cse9)) (.cse4 (not .cse9)) (.cse15 (or .cse26 .cse30)) (.cse16 (not .cse30)) (.cse6 (or .cse2 (not .cse31))) (.cse7 (or .cse2 .cse17)) (.cse12 (or .cse30 .cse8 .cse10)) (.cse1 (not .cse11))) (and (= |v_P1Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_84) (let ((.cse0 (= |v_P1Thread1of1ForFork3_#t~ite16_1| |v_P1_#t~ite16_43|))) (or (and (= v_~y$w_buff1_used~0_286 v_~y$w_buff1_used~0_285) .cse0 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite17_1| |v_P1_#t~ite17_39|)) (and (or (and (let ((.cse3 (= |v_P1_#t~ite16_43| 0))) (or (and .cse2 .cse3 .cse4) (and .cse5 .cse3))) (= |v_P1_#t~ite17_39| |v_P1_#t~ite16_43|) .cse6 .cse4 .cse7) (and (or .cse8 .cse9 .cse10) .cse0 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_286))) .cse11 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_285)))) (= 0 v_~y$flush_delayed~0_40) (or (and (= v_~y~0_132 v_~y$mem_tmp~0_28) .cse1) (and (= v_~y~0_132 v_~__unbuffered_p1_EAX~0_16) .cse11)) (let ((.cse13 (= |v_P1_#t~ite7_45| |v_P1Thread1of1ForFork3_#t~ite7_1|))) (or (and (or (and .cse12 (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_86) .cse13) (and (= |v_P1_#t~ite8_43| |v_P1_#t~ite7_45|) (let ((.cse14 (= |v_P1_#t~ite7_45| v_~y$w_buff0~0_86))) (or (and .cse14 .cse15) (and .cse14 .cse2 .cse16))) .cse16 .cse6 .cse7)) (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_85) .cse11) (and (= |v_P1_#t~ite8_43| |v_P1Thread1of1ForFork3_#t~ite8_1|) (= v_~y$w_buff0~0_86 v_~y$w_buff0~0_85) .cse1 .cse13))) (let ((.cse22 (= |v_P1Thread1of1ForFork3_#t~ite22_1| |v_P1_#t~ite22_53|))) (or (and (let ((.cse20 (= (mod v_~y$r_buff0_thd2~0_175 256) 0))) (or (let ((.cse18 (not .cse20))) (and (or .cse17 .cse18) (let ((.cse19 (= |v_P1_#t~ite22_53| 0))) (or (and .cse19 (or .cse20 .cse9)) (and .cse19 .cse18 .cse4))) (or .cse21 .cse18) (= |v_P1_#t~ite22_53| |v_P1_#t~ite23_47|) .cse4)) (and .cse22 (or (and .cse20 .cse23) (and .cse20 .cse24) .cse9) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_129)))) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_128) .cse11) (and .cse22 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite23_1| |v_P1_#t~ite23_47|) (= v_~y$r_buff1_thd2~0_129 v_~y$r_buff1_thd2~0_128)))) (= v_~y~0_134 v_~y$mem_tmp~0_28) (let ((.cse25 (= |v_P1Thread1of1ForFork3_#t~ite19_1| |v_P1_#t~ite19_63|))) (or (and (or (and .cse25 (or .cse9 .cse10 (and .cse26 .cse24)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_176)) (and (= |v_P1_#t~ite19_63| |v_P1_#t~ite20_57|) (or .cse21 .cse2) (or (and .cse5 (= |v_P1_#t~ite19_63| v_~y$r_buff0_thd2~0_176)) (and .cse2 (= |v_P1_#t~ite19_63| 0) .cse4)) .cse4 .cse7)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_175) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite20_1| |v_P1_#t~ite20_57|) .cse25 (= v_~y$r_buff0_thd2~0_176 v_~y$r_buff0_thd2~0_175) .cse1))) (or (and .cse12 (= v_~y~0_134 v_~__unbuffered_p1_EAX~0_16) (= |v_P1_#t~ite5_47| |v_P1Thread1of1ForFork3_#t~ite5_1|)) (and (= |v_P1_#t~ite5_47| v_~__unbuffered_p1_EAX~0_16) .cse16 .cse6 (or (and (= |v_P1_#t~ite5_47| v_~y$w_buff1~0_97) .cse15) (and .cse2 .cse16 (= |v_P1_#t~ite5_47| v_~y$w_buff0~0_86))) .cse7)) (let ((.cse28 (= |v_P1Thread1of1ForFork3_#t~ite10_1| |v_P1_#t~ite10_49|))) (or (and (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_96) .cse11 (or (and (= |v_P1_#t~ite10_49| |v_P1_#t~ite11_45|) .cse16 (let ((.cse27 (= |v_P1_#t~ite10_49| v_~y$w_buff1~0_97))) (or (and .cse27 .cse2 .cse16) (and .cse27 .cse15))) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_97) .cse28))) (and (= v_~y$w_buff1~0_97 v_~y$w_buff1~0_96) .cse28 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite11_1| |v_P1_#t~ite11_45|)))) (= |v_P1Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_13) (let ((.cse29 (= |v_P1Thread1of1ForFork3_#t~ite13_1| |v_P1_#t~ite13_57|))) (or (and (or (and (= |v_P1_#t~ite13_57| |v_P1_#t~ite14_49|) .cse16 (or (and .cse15 (= |v_P1_#t~ite13_57| v_~y$w_buff0_used~0_366)) (and (= |v_P1_#t~ite13_57| 0) .cse2 .cse16)) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_366) .cse29)) (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_365) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite14_1| |v_P1_#t~ite14_49|) .cse29 .cse1 (= v_~y$w_buff0_used~0_366 v_~y$w_buff0_used~0_365)))))))) InVars {P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_1|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_1|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_366, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_1|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_1|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_1|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_1|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_1|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_1|, ~y$w_buff1~0=v_~y$w_buff1~0_97, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_1|, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_176, ~y~0=v_~y~0_134, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, P1Thread1of1ForFork3_#t~ite21=|v_P1Thread1of1ForFork3_#t~ite21_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_2|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_2|, P1Thread1of1ForFork3_#t~ite25=|v_P1Thread1of1ForFork3_#t~ite25_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_2|, P1Thread1of1ForFork3_#t~ite24=|v_P1Thread1of1ForFork3_#t~ite24_1|, ~y$mem_tmp~0=v_~y$mem_tmp~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_85, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_132, P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_2|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_2|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_2|, P1Thread1of1ForFork3_#t~ite18=|v_P1Thread1of1ForFork3_#t~ite18_1|, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_2|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_2|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_2|, P1Thread1of1ForFork3_#t~ite6=|v_P1Thread1of1ForFork3_#t~ite6_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_2|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_2|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_2|, P1Thread1of1ForFork3_#t~ite12=|v_P1Thread1of1ForFork3_#t~ite12_1|, P1Thread1of1ForFork3_#t~ite15=|v_P1Thread1of1ForFork3_#t~ite15_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_2|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_128, ~weak$$choice0~0=v_~weak$$choice0~0_13, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_2|, ~y$w_buff1~0=v_~y$w_buff1~0_96, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_2|, P1Thread1of1ForFork3_#t~ite9=|v_P1Thread1of1ForFork3_#t~ite9_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285} AuxVars[|v_P1_#t~ite23_47|, |v_P1_#t~ite22_53|, |v_P1_#t~ite7_45|, |v_P1_#t~ite10_49|, |v_P1_#t~ite5_47|, |v_P1_#t~ite8_43|, |v_P1_#t~ite17_39|, |v_P1_#t~ite11_45|, |v_P1_#t~ite19_63|, |v_P1_#t~ite14_49|, |v_P1_#t~ite13_57|, |v_P1_#t~ite20_57|, |v_P1_#t~ite16_43|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork3_#t~ite21, P1Thread1of1ForFork3_#t~ite22, P1Thread1of1ForFork3_#t~ite20, P1Thread1of1ForFork3_#t~ite25, P1Thread1of1ForFork3_#t~ite23, P1Thread1of1ForFork3_#t~ite24, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, P1Thread1of1ForFork3_#t~ite17, P1Thread1of1ForFork3_#t~ite16, P1Thread1of1ForFork3_#t~ite19, P1Thread1of1ForFork3_#t~ite18, P1Thread1of1ForFork3_#t~nondet4, P1Thread1of1ForFork3_#t~nondet3, P1Thread1of1ForFork3_#t~ite11, P1Thread1of1ForFork3_#t~ite6, P1Thread1of1ForFork3_#t~ite10, P1Thread1of1ForFork3_#t~ite5, P1Thread1of1ForFork3_#t~ite13, P1Thread1of1ForFork3_#t~ite12, P1Thread1of1ForFork3_#t~ite15, P1Thread1of1ForFork3_#t~ite14, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork3_#t~ite8, ~y$w_buff1~0, P1Thread1of1ForFork3_#t~ite7, P1Thread1of1ForFork3_#t~ite9, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~y$w_buff1_used~0][74], [18#L865-3true, Black: 189#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 187#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 109#L811true, 321#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 237#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 61#L786true, Black: 263#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork3InUse, 126#L763true, 261#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 281#(= ~x~0 1), Black: 289#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 291#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 27#L841true, Black: 293#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 295#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 287#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 231#(= ~a~0 1)]) [2022-01-18 22:37:08,415 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-01-18 22:37:08,415 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-18 22:37:08,415 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-18 22:37:08,415 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-18 22:37:08,458 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([931] L770-->L786: Formula: (let ((.cse23 (= (mod v_~y$r_buff1_thd2~0_129 256) 0)) (.cse26 (= (mod v_~y$r_buff0_thd2~0_176 256) 0)) (.cse31 (= (mod v_~y$w_buff1_used~0_286 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse8 (and .cse26 .cse31)) (.cse10 (and .cse26 .cse23)) (.cse17 (not .cse23)) (.cse2 (not .cse26)) (.cse30 (= (mod v_~y$w_buff0_used~0_366 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_365 256) 0)) (.cse24 (= (mod v_~y$w_buff1_used~0_285 256) 0))) (let ((.cse21 (not .cse24)) (.cse5 (or .cse26 .cse9)) (.cse4 (not .cse9)) (.cse15 (or .cse26 .cse30)) (.cse16 (not .cse30)) (.cse6 (or .cse2 (not .cse31))) (.cse7 (or .cse2 .cse17)) (.cse12 (or .cse30 .cse8 .cse10)) (.cse1 (not .cse11))) (and (= |v_P1Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_84) (let ((.cse0 (= |v_P1Thread1of1ForFork3_#t~ite16_1| |v_P1_#t~ite16_43|))) (or (and (= v_~y$w_buff1_used~0_286 v_~y$w_buff1_used~0_285) .cse0 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite17_1| |v_P1_#t~ite17_39|)) (and (or (and (let ((.cse3 (= |v_P1_#t~ite16_43| 0))) (or (and .cse2 .cse3 .cse4) (and .cse5 .cse3))) (= |v_P1_#t~ite17_39| |v_P1_#t~ite16_43|) .cse6 .cse4 .cse7) (and (or .cse8 .cse9 .cse10) .cse0 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_286))) .cse11 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_285)))) (= 0 v_~y$flush_delayed~0_40) (or (and (= v_~y~0_132 v_~y$mem_tmp~0_28) .cse1) (and (= v_~y~0_132 v_~__unbuffered_p1_EAX~0_16) .cse11)) (let ((.cse13 (= |v_P1_#t~ite7_45| |v_P1Thread1of1ForFork3_#t~ite7_1|))) (or (and (or (and .cse12 (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_86) .cse13) (and (= |v_P1_#t~ite8_43| |v_P1_#t~ite7_45|) (let ((.cse14 (= |v_P1_#t~ite7_45| v_~y$w_buff0~0_86))) (or (and .cse14 .cse15) (and .cse14 .cse2 .cse16))) .cse16 .cse6 .cse7)) (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_85) .cse11) (and (= |v_P1_#t~ite8_43| |v_P1Thread1of1ForFork3_#t~ite8_1|) (= v_~y$w_buff0~0_86 v_~y$w_buff0~0_85) .cse1 .cse13))) (let ((.cse22 (= |v_P1Thread1of1ForFork3_#t~ite22_1| |v_P1_#t~ite22_53|))) (or (and (let ((.cse20 (= (mod v_~y$r_buff0_thd2~0_175 256) 0))) (or (let ((.cse18 (not .cse20))) (and (or .cse17 .cse18) (let ((.cse19 (= |v_P1_#t~ite22_53| 0))) (or (and .cse19 (or .cse20 .cse9)) (and .cse19 .cse18 .cse4))) (or .cse21 .cse18) (= |v_P1_#t~ite22_53| |v_P1_#t~ite23_47|) .cse4)) (and .cse22 (or (and .cse20 .cse23) (and .cse20 .cse24) .cse9) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_129)))) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_128) .cse11) (and .cse22 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite23_1| |v_P1_#t~ite23_47|) (= v_~y$r_buff1_thd2~0_129 v_~y$r_buff1_thd2~0_128)))) (= v_~y~0_134 v_~y$mem_tmp~0_28) (let ((.cse25 (= |v_P1Thread1of1ForFork3_#t~ite19_1| |v_P1_#t~ite19_63|))) (or (and (or (and .cse25 (or .cse9 .cse10 (and .cse26 .cse24)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_176)) (and (= |v_P1_#t~ite19_63| |v_P1_#t~ite20_57|) (or .cse21 .cse2) (or (and .cse5 (= |v_P1_#t~ite19_63| v_~y$r_buff0_thd2~0_176)) (and .cse2 (= |v_P1_#t~ite19_63| 0) .cse4)) .cse4 .cse7)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_175) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite20_1| |v_P1_#t~ite20_57|) .cse25 (= v_~y$r_buff0_thd2~0_176 v_~y$r_buff0_thd2~0_175) .cse1))) (or (and .cse12 (= v_~y~0_134 v_~__unbuffered_p1_EAX~0_16) (= |v_P1_#t~ite5_47| |v_P1Thread1of1ForFork3_#t~ite5_1|)) (and (= |v_P1_#t~ite5_47| v_~__unbuffered_p1_EAX~0_16) .cse16 .cse6 (or (and (= |v_P1_#t~ite5_47| v_~y$w_buff1~0_97) .cse15) (and .cse2 .cse16 (= |v_P1_#t~ite5_47| v_~y$w_buff0~0_86))) .cse7)) (let ((.cse28 (= |v_P1Thread1of1ForFork3_#t~ite10_1| |v_P1_#t~ite10_49|))) (or (and (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_96) .cse11 (or (and (= |v_P1_#t~ite10_49| |v_P1_#t~ite11_45|) .cse16 (let ((.cse27 (= |v_P1_#t~ite10_49| v_~y$w_buff1~0_97))) (or (and .cse27 .cse2 .cse16) (and .cse27 .cse15))) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_97) .cse28))) (and (= v_~y$w_buff1~0_97 v_~y$w_buff1~0_96) .cse28 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite11_1| |v_P1_#t~ite11_45|)))) (= |v_P1Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_13) (let ((.cse29 (= |v_P1Thread1of1ForFork3_#t~ite13_1| |v_P1_#t~ite13_57|))) (or (and (or (and (= |v_P1_#t~ite13_57| |v_P1_#t~ite14_49|) .cse16 (or (and .cse15 (= |v_P1_#t~ite13_57| v_~y$w_buff0_used~0_366)) (and (= |v_P1_#t~ite13_57| 0) .cse2 .cse16)) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_366) .cse29)) (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_365) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite14_1| |v_P1_#t~ite14_49|) .cse29 .cse1 (= v_~y$w_buff0_used~0_366 v_~y$w_buff0_used~0_365)))))))) InVars {P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_1|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_1|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_366, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_1|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_1|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_1|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_1|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_1|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_1|, ~y$w_buff1~0=v_~y$w_buff1~0_97, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_1|, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_176, ~y~0=v_~y~0_134, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, P1Thread1of1ForFork3_#t~ite21=|v_P1Thread1of1ForFork3_#t~ite21_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_2|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_2|, P1Thread1of1ForFork3_#t~ite25=|v_P1Thread1of1ForFork3_#t~ite25_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_2|, P1Thread1of1ForFork3_#t~ite24=|v_P1Thread1of1ForFork3_#t~ite24_1|, ~y$mem_tmp~0=v_~y$mem_tmp~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_85, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_132, P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_2|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_2|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_2|, P1Thread1of1ForFork3_#t~ite18=|v_P1Thread1of1ForFork3_#t~ite18_1|, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_2|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_2|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_2|, P1Thread1of1ForFork3_#t~ite6=|v_P1Thread1of1ForFork3_#t~ite6_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_2|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_2|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_2|, P1Thread1of1ForFork3_#t~ite12=|v_P1Thread1of1ForFork3_#t~ite12_1|, P1Thread1of1ForFork3_#t~ite15=|v_P1Thread1of1ForFork3_#t~ite15_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_2|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_128, ~weak$$choice0~0=v_~weak$$choice0~0_13, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_2|, ~y$w_buff1~0=v_~y$w_buff1~0_96, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_2|, P1Thread1of1ForFork3_#t~ite9=|v_P1Thread1of1ForFork3_#t~ite9_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285} AuxVars[|v_P1_#t~ite23_47|, |v_P1_#t~ite22_53|, |v_P1_#t~ite7_45|, |v_P1_#t~ite10_49|, |v_P1_#t~ite5_47|, |v_P1_#t~ite8_43|, |v_P1_#t~ite17_39|, |v_P1_#t~ite11_45|, |v_P1_#t~ite19_63|, |v_P1_#t~ite14_49|, |v_P1_#t~ite13_57|, |v_P1_#t~ite20_57|, |v_P1_#t~ite16_43|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork3_#t~ite21, P1Thread1of1ForFork3_#t~ite22, P1Thread1of1ForFork3_#t~ite20, P1Thread1of1ForFork3_#t~ite25, P1Thread1of1ForFork3_#t~ite23, P1Thread1of1ForFork3_#t~ite24, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, P1Thread1of1ForFork3_#t~ite17, P1Thread1of1ForFork3_#t~ite16, P1Thread1of1ForFork3_#t~ite19, P1Thread1of1ForFork3_#t~ite18, P1Thread1of1ForFork3_#t~nondet4, P1Thread1of1ForFork3_#t~nondet3, P1Thread1of1ForFork3_#t~ite11, P1Thread1of1ForFork3_#t~ite6, P1Thread1of1ForFork3_#t~ite10, P1Thread1of1ForFork3_#t~ite5, P1Thread1of1ForFork3_#t~ite13, P1Thread1of1ForFork3_#t~ite12, P1Thread1of1ForFork3_#t~ite15, P1Thread1of1ForFork3_#t~ite14, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork3_#t~ite8, ~y$w_buff1~0, P1Thread1of1ForFork3_#t~ite7, P1Thread1of1ForFork3_#t~ite9, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~y$w_buff1_used~0][109], [323#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 18#L865-3true, Black: 189#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 187#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 109#L811true, 263#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 237#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 61#L786true, P1Thread1of1ForFork3InUse, 126#L763true, Black: 213#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 281#(= ~x~0 1), 99#L844true, Black: 289#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 291#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 293#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 295#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 287#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 231#(= ~a~0 1)]) [2022-01-18 22:37:08,459 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-01-18 22:37:08,459 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-18 22:37:08,459 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-18 22:37:08,459 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-18 22:37:08,678 INFO L129 PetriNetUnfolder]: 1087/2823 cut-off events. [2022-01-18 22:37:08,678 INFO L130 PetriNetUnfolder]: For 4930/5678 co-relation queries the response was YES. [2022-01-18 22:37:08,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8026 conditions, 2823 events. 1087/2823 cut-off events. For 4930/5678 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23374 event pairs, 107 based on Foata normal form. 171/2805 useless extension candidates. Maximal degree in co-relation 8003. Up to 544 conditions per place. [2022-01-18 22:37:08,698 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 37 selfloop transitions, 21 changer transitions 21/178 dead transitions. [2022-01-18 22:37:08,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 178 transitions, 876 flow [2022-01-18 22:37:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-18 22:37:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-18 22:37:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1419 transitions. [2022-01-18 22:37:08,702 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8631386861313869 [2022-01-18 22:37:08,702 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1419 transitions. [2022-01-18 22:37:08,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1419 transitions. [2022-01-18 22:37:08,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:37:08,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1419 transitions. [2022-01-18 22:37:08,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 118.25) internal successors, (1419), 12 states have internal predecessors, (1419), 0 states have call successors, (0), 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-18 22:37:08,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-18 22:37:08,708 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-18 22:37:08,708 INFO L186 Difference]: Start difference. First operand has 155 places, 132 transitions, 457 flow. Second operand 12 states and 1419 transitions. [2022-01-18 22:37:08,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 178 transitions, 876 flow [2022-01-18 22:37:08,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 178 transitions, 830 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-01-18 22:37:08,731 INFO L242 Difference]: Finished difference. Result has 160 places, 135 transitions, 515 flow [2022-01-18 22:37:08,731 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=515, PETRI_PLACES=160, PETRI_TRANSITIONS=135} [2022-01-18 22:37:08,732 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 16 predicate places. [2022-01-18 22:37:08,732 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 135 transitions, 515 flow [2022-01-18 22:37:08,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 0 states have call successors, (0), 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-18 22:37:08,732 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:08,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:37:08,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:37:08,733 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1861445836, now seen corresponding path program 1 times [2022-01-18 22:37:08,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988236034] [2022-01-18 22:37:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:08,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:37:08,924 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-18 22:37:08,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:37:08,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988236034] [2022-01-18 22:37:08,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988236034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:37:08,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:37:08,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:37:08,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287117878] [2022-01-18 22:37:08,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:37:08,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:37:08,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:37:08,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:37:08,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:37:08,927 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137 [2022-01-18 22:37:08,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 135 transitions, 515 flow. Second operand has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 0 states have call successors, (0), 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-18 22:37:08,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:37:08,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137 [2022-01-18 22:37:08,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:37:09,477 INFO L129 PetriNetUnfolder]: 916/2961 cut-off events. [2022-01-18 22:37:09,478 INFO L130 PetriNetUnfolder]: For 5398/5616 co-relation queries the response was YES. [2022-01-18 22:37:09,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8753 conditions, 2961 events. 916/2961 cut-off events. For 5398/5616 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 26808 event pairs, 81 based on Foata normal form. 3/2872 useless extension candidates. Maximal degree in co-relation 8668. Up to 552 conditions per place. [2022-01-18 22:37:09,499 INFO L132 encePairwiseOnDemand]: 122/137 looper letters, 34 selfloop transitions, 24 changer transitions 18/177 dead transitions. [2022-01-18 22:37:09,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 903 flow [2022-01-18 22:37:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:37:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:37:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1098 transitions. [2022-01-18 22:37:09,502 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8014598540145985 [2022-01-18 22:37:09,502 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1098 transitions. [2022-01-18 22:37:09,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1098 transitions. [2022-01-18 22:37:09,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:37:09,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1098 transitions. [2022-01-18 22:37:09,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 109.8) internal successors, (1098), 10 states have internal predecessors, (1098), 0 states have call successors, (0), 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-18 22:37:09,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 22:37:09,507 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 22:37:09,507 INFO L186 Difference]: Start difference. First operand has 160 places, 135 transitions, 515 flow. Second operand 10 states and 1098 transitions. [2022-01-18 22:37:09,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 177 transitions, 903 flow [2022-01-18 22:37:09,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 177 transitions, 758 flow, removed 60 selfloop flow, removed 12 redundant places. [2022-01-18 22:37:09,539 INFO L242 Difference]: Finished difference. Result has 162 places, 152 transitions, 609 flow [2022-01-18 22:37:09,540 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=609, PETRI_PLACES=162, PETRI_TRANSITIONS=152} [2022-01-18 22:37:09,540 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 18 predicate places. [2022-01-18 22:37:09,540 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 152 transitions, 609 flow [2022-01-18 22:37:09,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 0 states have call successors, (0), 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-18 22:37:09,541 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:09,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:37:09,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 22:37:09,541 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash 368274850, now seen corresponding path program 2 times [2022-01-18 22:37:09,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:09,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865992946] [2022-01-18 22:37:09,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:09,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:37:09,695 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-18 22:37:09,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:37:09,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865992946] [2022-01-18 22:37:09,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865992946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:37:09,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:37:09,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:37:09,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957455231] [2022-01-18 22:37:09,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:37:09,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:37:09,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:37:09,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:37:09,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:37:09,697 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-01-18 22:37:09,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 152 transitions, 609 flow. Second operand has 9 states, 9 states have (on average 112.44444444444444) internal successors, (1012), 9 states have internal predecessors, (1012), 0 states have call successors, (0), 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-18 22:37:09,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:37:09,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-01-18 22:37:09,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:37:09,924 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([931] L770-->L786: Formula: (let ((.cse23 (= (mod v_~y$r_buff1_thd2~0_129 256) 0)) (.cse26 (= (mod v_~y$r_buff0_thd2~0_176 256) 0)) (.cse31 (= (mod v_~y$w_buff1_used~0_286 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse8 (and .cse26 .cse31)) (.cse10 (and .cse26 .cse23)) (.cse17 (not .cse23)) (.cse2 (not .cse26)) (.cse30 (= (mod v_~y$w_buff0_used~0_366 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_365 256) 0)) (.cse24 (= (mod v_~y$w_buff1_used~0_285 256) 0))) (let ((.cse21 (not .cse24)) (.cse5 (or .cse26 .cse9)) (.cse4 (not .cse9)) (.cse15 (or .cse26 .cse30)) (.cse16 (not .cse30)) (.cse6 (or .cse2 (not .cse31))) (.cse7 (or .cse2 .cse17)) (.cse12 (or .cse30 .cse8 .cse10)) (.cse1 (not .cse11))) (and (= |v_P1Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_84) (let ((.cse0 (= |v_P1Thread1of1ForFork3_#t~ite16_1| |v_P1_#t~ite16_43|))) (or (and (= v_~y$w_buff1_used~0_286 v_~y$w_buff1_used~0_285) .cse0 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite17_1| |v_P1_#t~ite17_39|)) (and (or (and (let ((.cse3 (= |v_P1_#t~ite16_43| 0))) (or (and .cse2 .cse3 .cse4) (and .cse5 .cse3))) (= |v_P1_#t~ite17_39| |v_P1_#t~ite16_43|) .cse6 .cse4 .cse7) (and (or .cse8 .cse9 .cse10) .cse0 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_286))) .cse11 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_285)))) (= 0 v_~y$flush_delayed~0_40) (or (and (= v_~y~0_132 v_~y$mem_tmp~0_28) .cse1) (and (= v_~y~0_132 v_~__unbuffered_p1_EAX~0_16) .cse11)) (let ((.cse13 (= |v_P1_#t~ite7_45| |v_P1Thread1of1ForFork3_#t~ite7_1|))) (or (and (or (and .cse12 (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_86) .cse13) (and (= |v_P1_#t~ite8_43| |v_P1_#t~ite7_45|) (let ((.cse14 (= |v_P1_#t~ite7_45| v_~y$w_buff0~0_86))) (or (and .cse14 .cse15) (and .cse14 .cse2 .cse16))) .cse16 .cse6 .cse7)) (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_85) .cse11) (and (= |v_P1_#t~ite8_43| |v_P1Thread1of1ForFork3_#t~ite8_1|) (= v_~y$w_buff0~0_86 v_~y$w_buff0~0_85) .cse1 .cse13))) (let ((.cse22 (= |v_P1Thread1of1ForFork3_#t~ite22_1| |v_P1_#t~ite22_53|))) (or (and (let ((.cse20 (= (mod v_~y$r_buff0_thd2~0_175 256) 0))) (or (let ((.cse18 (not .cse20))) (and (or .cse17 .cse18) (let ((.cse19 (= |v_P1_#t~ite22_53| 0))) (or (and .cse19 (or .cse20 .cse9)) (and .cse19 .cse18 .cse4))) (or .cse21 .cse18) (= |v_P1_#t~ite22_53| |v_P1_#t~ite23_47|) .cse4)) (and .cse22 (or (and .cse20 .cse23) (and .cse20 .cse24) .cse9) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_129)))) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_128) .cse11) (and .cse22 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite23_1| |v_P1_#t~ite23_47|) (= v_~y$r_buff1_thd2~0_129 v_~y$r_buff1_thd2~0_128)))) (= v_~y~0_134 v_~y$mem_tmp~0_28) (let ((.cse25 (= |v_P1Thread1of1ForFork3_#t~ite19_1| |v_P1_#t~ite19_63|))) (or (and (or (and .cse25 (or .cse9 .cse10 (and .cse26 .cse24)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_176)) (and (= |v_P1_#t~ite19_63| |v_P1_#t~ite20_57|) (or .cse21 .cse2) (or (and .cse5 (= |v_P1_#t~ite19_63| v_~y$r_buff0_thd2~0_176)) (and .cse2 (= |v_P1_#t~ite19_63| 0) .cse4)) .cse4 .cse7)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_175) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite20_1| |v_P1_#t~ite20_57|) .cse25 (= v_~y$r_buff0_thd2~0_176 v_~y$r_buff0_thd2~0_175) .cse1))) (or (and .cse12 (= v_~y~0_134 v_~__unbuffered_p1_EAX~0_16) (= |v_P1_#t~ite5_47| |v_P1Thread1of1ForFork3_#t~ite5_1|)) (and (= |v_P1_#t~ite5_47| v_~__unbuffered_p1_EAX~0_16) .cse16 .cse6 (or (and (= |v_P1_#t~ite5_47| v_~y$w_buff1~0_97) .cse15) (and .cse2 .cse16 (= |v_P1_#t~ite5_47| v_~y$w_buff0~0_86))) .cse7)) (let ((.cse28 (= |v_P1Thread1of1ForFork3_#t~ite10_1| |v_P1_#t~ite10_49|))) (or (and (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_96) .cse11 (or (and (= |v_P1_#t~ite10_49| |v_P1_#t~ite11_45|) .cse16 (let ((.cse27 (= |v_P1_#t~ite10_49| v_~y$w_buff1~0_97))) (or (and .cse27 .cse2 .cse16) (and .cse27 .cse15))) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_97) .cse28))) (and (= v_~y$w_buff1~0_97 v_~y$w_buff1~0_96) .cse28 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite11_1| |v_P1_#t~ite11_45|)))) (= |v_P1Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_13) (let ((.cse29 (= |v_P1Thread1of1ForFork3_#t~ite13_1| |v_P1_#t~ite13_57|))) (or (and (or (and (= |v_P1_#t~ite13_57| |v_P1_#t~ite14_49|) .cse16 (or (and .cse15 (= |v_P1_#t~ite13_57| v_~y$w_buff0_used~0_366)) (and (= |v_P1_#t~ite13_57| 0) .cse2 .cse16)) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_366) .cse29)) (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_365) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite14_1| |v_P1_#t~ite14_49|) .cse29 .cse1 (= v_~y$w_buff0_used~0_366 v_~y$w_buff0_used~0_365)))))))) InVars {P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_1|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_1|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_366, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_1|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_1|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_1|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_1|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_1|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_1|, ~y$w_buff1~0=v_~y$w_buff1~0_97, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_1|, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_176, ~y~0=v_~y~0_134, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, P1Thread1of1ForFork3_#t~ite21=|v_P1Thread1of1ForFork3_#t~ite21_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_2|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_2|, P1Thread1of1ForFork3_#t~ite25=|v_P1Thread1of1ForFork3_#t~ite25_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_2|, P1Thread1of1ForFork3_#t~ite24=|v_P1Thread1of1ForFork3_#t~ite24_1|, ~y$mem_tmp~0=v_~y$mem_tmp~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_85, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_132, P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_2|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_2|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_2|, P1Thread1of1ForFork3_#t~ite18=|v_P1Thread1of1ForFork3_#t~ite18_1|, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_2|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_2|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_2|, P1Thread1of1ForFork3_#t~ite6=|v_P1Thread1of1ForFork3_#t~ite6_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_2|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_2|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_2|, P1Thread1of1ForFork3_#t~ite12=|v_P1Thread1of1ForFork3_#t~ite12_1|, P1Thread1of1ForFork3_#t~ite15=|v_P1Thread1of1ForFork3_#t~ite15_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_2|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_128, ~weak$$choice0~0=v_~weak$$choice0~0_13, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_2|, ~y$w_buff1~0=v_~y$w_buff1~0_96, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_2|, P1Thread1of1ForFork3_#t~ite9=|v_P1Thread1of1ForFork3_#t~ite9_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285} AuxVars[|v_P1_#t~ite23_47|, |v_P1_#t~ite22_53|, |v_P1_#t~ite7_45|, |v_P1_#t~ite10_49|, |v_P1_#t~ite5_47|, |v_P1_#t~ite8_43|, |v_P1_#t~ite17_39|, |v_P1_#t~ite11_45|, |v_P1_#t~ite19_63|, |v_P1_#t~ite14_49|, |v_P1_#t~ite13_57|, |v_P1_#t~ite20_57|, |v_P1_#t~ite16_43|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork3_#t~ite21, P1Thread1of1ForFork3_#t~ite22, P1Thread1of1ForFork3_#t~ite20, P1Thread1of1ForFork3_#t~ite25, P1Thread1of1ForFork3_#t~ite23, P1Thread1of1ForFork3_#t~ite24, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, P1Thread1of1ForFork3_#t~ite17, P1Thread1of1ForFork3_#t~ite16, P1Thread1of1ForFork3_#t~ite19, P1Thread1of1ForFork3_#t~ite18, P1Thread1of1ForFork3_#t~nondet4, P1Thread1of1ForFork3_#t~nondet3, P1Thread1of1ForFork3_#t~ite11, P1Thread1of1ForFork3_#t~ite6, P1Thread1of1ForFork3_#t~ite10, P1Thread1of1ForFork3_#t~ite5, P1Thread1of1ForFork3_#t~ite13, P1Thread1of1ForFork3_#t~ite12, P1Thread1of1ForFork3_#t~ite15, P1Thread1of1ForFork3_#t~ite14, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork3_#t~ite8, ~y$w_buff1~0, P1Thread1of1ForFork3_#t~ite7, P1Thread1of1ForFork3_#t~ite9, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~y$w_buff1_used~0][136], [18#L865-3true, 370#(= ~y$r_buff0_thd2~0 0), 187#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 109#L811true, Black: 329#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 315#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 325#(and (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 327#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 231#(= ~a~0 1), Black: 263#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 61#L786true, P1Thread1of1ForFork3InUse, 281#(= ~x~0 1), Black: 213#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 353#(and (= ~z~0 ~y$r_buff0_thd3~0) (= ~y$r_buff0_thd3~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~y$w_buff0_used~0 1)), 62#L758true, Black: 359#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 351#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 344#(and (= ~z~0 ~y$r_buff0_thd3~0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0_used~0 1)), Black: 357#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 343#(= ~z~0 1), Black: 355#(and (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), 27#L841true, Black: 287#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 237#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2022-01-18 22:37:09,924 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-18 22:37:09,924 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-18 22:37:09,924 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-18 22:37:09,925 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-18 22:37:10,130 INFO L129 PetriNetUnfolder]: 635/2734 cut-off events. [2022-01-18 22:37:10,130 INFO L130 PetriNetUnfolder]: For 2421/2591 co-relation queries the response was YES. [2022-01-18 22:37:10,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6733 conditions, 2734 events. 635/2734 cut-off events. For 2421/2591 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 27665 event pairs, 44 based on Foata normal form. 28/2654 useless extension candidates. Maximal degree in co-relation 6708. Up to 383 conditions per place. [2022-01-18 22:37:10,148 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 30 selfloop transitions, 15 changer transitions 7/172 dead transitions. [2022-01-18 22:37:10,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 172 transitions, 817 flow [2022-01-18 22:37:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:37:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:37:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1139 transitions. [2022-01-18 22:37:10,151 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8313868613138686 [2022-01-18 22:37:10,151 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1139 transitions. [2022-01-18 22:37:10,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1139 transitions. [2022-01-18 22:37:10,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:37:10,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1139 transitions. [2022-01-18 22:37:10,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.9) internal successors, (1139), 10 states have internal predecessors, (1139), 0 states have call successors, (0), 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-18 22:37:10,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 22:37:10,156 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 22:37:10,156 INFO L186 Difference]: Start difference. First operand has 162 places, 152 transitions, 609 flow. Second operand 10 states and 1139 transitions. [2022-01-18 22:37:10,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 172 transitions, 817 flow [2022-01-18 22:37:10,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 172 transitions, 762 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-01-18 22:37:10,188 INFO L242 Difference]: Finished difference. Result has 166 places, 160 transitions, 683 flow [2022-01-18 22:37:10,188 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=683, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2022-01-18 22:37:10,189 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 22 predicate places. [2022-01-18 22:37:10,189 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 683 flow [2022-01-18 22:37:10,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.44444444444444) internal successors, (1012), 9 states have internal predecessors, (1012), 0 states have call successors, (0), 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-18 22:37:10,189 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:10,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:37:10,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 22:37:10,190 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:10,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1266678160, now seen corresponding path program 3 times [2022-01-18 22:37:10,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:10,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659599126] [2022-01-18 22:37:10,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:10,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:37:10,408 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-18 22:37:10,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:37:10,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659599126] [2022-01-18 22:37:10,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659599126] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:37:10,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:37:10,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-18 22:37:10,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851993228] [2022-01-18 22:37:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:37:10,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-18 22:37:10,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:37:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-18 22:37:10,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-18 22:37:10,411 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2022-01-18 22:37:10,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 683 flow. Second operand has 11 states, 11 states have (on average 110.18181818181819) internal successors, (1212), 11 states have internal predecessors, (1212), 0 states have call successors, (0), 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-18 22:37:10,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:37:10,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2022-01-18 22:37:10,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:37:10,604 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([931] L770-->L786: Formula: (let ((.cse23 (= (mod v_~y$r_buff1_thd2~0_129 256) 0)) (.cse26 (= (mod v_~y$r_buff0_thd2~0_176 256) 0)) (.cse31 (= (mod v_~y$w_buff1_used~0_286 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse8 (and .cse26 .cse31)) (.cse10 (and .cse26 .cse23)) (.cse17 (not .cse23)) (.cse2 (not .cse26)) (.cse30 (= (mod v_~y$w_buff0_used~0_366 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_365 256) 0)) (.cse24 (= (mod v_~y$w_buff1_used~0_285 256) 0))) (let ((.cse21 (not .cse24)) (.cse5 (or .cse26 .cse9)) (.cse4 (not .cse9)) (.cse15 (or .cse26 .cse30)) (.cse16 (not .cse30)) (.cse6 (or .cse2 (not .cse31))) (.cse7 (or .cse2 .cse17)) (.cse12 (or .cse30 .cse8 .cse10)) (.cse1 (not .cse11))) (and (= |v_P1Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_84) (let ((.cse0 (= |v_P1Thread1of1ForFork3_#t~ite16_1| |v_P1_#t~ite16_43|))) (or (and (= v_~y$w_buff1_used~0_286 v_~y$w_buff1_used~0_285) .cse0 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite17_1| |v_P1_#t~ite17_39|)) (and (or (and (let ((.cse3 (= |v_P1_#t~ite16_43| 0))) (or (and .cse2 .cse3 .cse4) (and .cse5 .cse3))) (= |v_P1_#t~ite17_39| |v_P1_#t~ite16_43|) .cse6 .cse4 .cse7) (and (or .cse8 .cse9 .cse10) .cse0 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_286))) .cse11 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_285)))) (= 0 v_~y$flush_delayed~0_40) (or (and (= v_~y~0_132 v_~y$mem_tmp~0_28) .cse1) (and (= v_~y~0_132 v_~__unbuffered_p1_EAX~0_16) .cse11)) (let ((.cse13 (= |v_P1_#t~ite7_45| |v_P1Thread1of1ForFork3_#t~ite7_1|))) (or (and (or (and .cse12 (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_86) .cse13) (and (= |v_P1_#t~ite8_43| |v_P1_#t~ite7_45|) (let ((.cse14 (= |v_P1_#t~ite7_45| v_~y$w_buff0~0_86))) (or (and .cse14 .cse15) (and .cse14 .cse2 .cse16))) .cse16 .cse6 .cse7)) (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_85) .cse11) (and (= |v_P1_#t~ite8_43| |v_P1Thread1of1ForFork3_#t~ite8_1|) (= v_~y$w_buff0~0_86 v_~y$w_buff0~0_85) .cse1 .cse13))) (let ((.cse22 (= |v_P1Thread1of1ForFork3_#t~ite22_1| |v_P1_#t~ite22_53|))) (or (and (let ((.cse20 (= (mod v_~y$r_buff0_thd2~0_175 256) 0))) (or (let ((.cse18 (not .cse20))) (and (or .cse17 .cse18) (let ((.cse19 (= |v_P1_#t~ite22_53| 0))) (or (and .cse19 (or .cse20 .cse9)) (and .cse19 .cse18 .cse4))) (or .cse21 .cse18) (= |v_P1_#t~ite22_53| |v_P1_#t~ite23_47|) .cse4)) (and .cse22 (or (and .cse20 .cse23) (and .cse20 .cse24) .cse9) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_129)))) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_128) .cse11) (and .cse22 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite23_1| |v_P1_#t~ite23_47|) (= v_~y$r_buff1_thd2~0_129 v_~y$r_buff1_thd2~0_128)))) (= v_~y~0_134 v_~y$mem_tmp~0_28) (let ((.cse25 (= |v_P1Thread1of1ForFork3_#t~ite19_1| |v_P1_#t~ite19_63|))) (or (and (or (and .cse25 (or .cse9 .cse10 (and .cse26 .cse24)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_176)) (and (= |v_P1_#t~ite19_63| |v_P1_#t~ite20_57|) (or .cse21 .cse2) (or (and .cse5 (= |v_P1_#t~ite19_63| v_~y$r_buff0_thd2~0_176)) (and .cse2 (= |v_P1_#t~ite19_63| 0) .cse4)) .cse4 .cse7)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_175) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite20_1| |v_P1_#t~ite20_57|) .cse25 (= v_~y$r_buff0_thd2~0_176 v_~y$r_buff0_thd2~0_175) .cse1))) (or (and .cse12 (= v_~y~0_134 v_~__unbuffered_p1_EAX~0_16) (= |v_P1_#t~ite5_47| |v_P1Thread1of1ForFork3_#t~ite5_1|)) (and (= |v_P1_#t~ite5_47| v_~__unbuffered_p1_EAX~0_16) .cse16 .cse6 (or (and (= |v_P1_#t~ite5_47| v_~y$w_buff1~0_97) .cse15) (and .cse2 .cse16 (= |v_P1_#t~ite5_47| v_~y$w_buff0~0_86))) .cse7)) (let ((.cse28 (= |v_P1Thread1of1ForFork3_#t~ite10_1| |v_P1_#t~ite10_49|))) (or (and (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_96) .cse11 (or (and (= |v_P1_#t~ite10_49| |v_P1_#t~ite11_45|) .cse16 (let ((.cse27 (= |v_P1_#t~ite10_49| v_~y$w_buff1~0_97))) (or (and .cse27 .cse2 .cse16) (and .cse27 .cse15))) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_97) .cse28))) (and (= v_~y$w_buff1~0_97 v_~y$w_buff1~0_96) .cse28 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite11_1| |v_P1_#t~ite11_45|)))) (= |v_P1Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_13) (let ((.cse29 (= |v_P1Thread1of1ForFork3_#t~ite13_1| |v_P1_#t~ite13_57|))) (or (and (or (and (= |v_P1_#t~ite13_57| |v_P1_#t~ite14_49|) .cse16 (or (and .cse15 (= |v_P1_#t~ite13_57| v_~y$w_buff0_used~0_366)) (and (= |v_P1_#t~ite13_57| 0) .cse2 .cse16)) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_366) .cse29)) (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_365) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite14_1| |v_P1_#t~ite14_49|) .cse29 .cse1 (= v_~y$w_buff0_used~0_366 v_~y$w_buff0_used~0_365)))))))) InVars {P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_1|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_1|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_366, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_1|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_1|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_1|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_1|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_1|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_1|, ~y$w_buff1~0=v_~y$w_buff1~0_97, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_1|, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_176, ~y~0=v_~y~0_134, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, P1Thread1of1ForFork3_#t~ite21=|v_P1Thread1of1ForFork3_#t~ite21_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_2|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_2|, P1Thread1of1ForFork3_#t~ite25=|v_P1Thread1of1ForFork3_#t~ite25_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_2|, P1Thread1of1ForFork3_#t~ite24=|v_P1Thread1of1ForFork3_#t~ite24_1|, ~y$mem_tmp~0=v_~y$mem_tmp~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_85, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_132, P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_2|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_2|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_2|, P1Thread1of1ForFork3_#t~ite18=|v_P1Thread1of1ForFork3_#t~ite18_1|, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_2|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_2|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_2|, P1Thread1of1ForFork3_#t~ite6=|v_P1Thread1of1ForFork3_#t~ite6_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_2|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_2|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_2|, P1Thread1of1ForFork3_#t~ite12=|v_P1Thread1of1ForFork3_#t~ite12_1|, P1Thread1of1ForFork3_#t~ite15=|v_P1Thread1of1ForFork3_#t~ite15_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_2|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_128, ~weak$$choice0~0=v_~weak$$choice0~0_13, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_2|, ~y$w_buff1~0=v_~y$w_buff1~0_96, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_2|, P1Thread1of1ForFork3_#t~ite9=|v_P1Thread1of1ForFork3_#t~ite9_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285} AuxVars[|v_P1_#t~ite23_47|, |v_P1_#t~ite22_53|, |v_P1_#t~ite7_45|, |v_P1_#t~ite10_49|, |v_P1_#t~ite5_47|, |v_P1_#t~ite8_43|, |v_P1_#t~ite17_39|, |v_P1_#t~ite11_45|, |v_P1_#t~ite19_63|, |v_P1_#t~ite14_49|, |v_P1_#t~ite13_57|, |v_P1_#t~ite20_57|, |v_P1_#t~ite16_43|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork3_#t~ite21, P1Thread1of1ForFork3_#t~ite22, P1Thread1of1ForFork3_#t~ite20, P1Thread1of1ForFork3_#t~ite25, P1Thread1of1ForFork3_#t~ite23, P1Thread1of1ForFork3_#t~ite24, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, P1Thread1of1ForFork3_#t~ite17, P1Thread1of1ForFork3_#t~ite16, P1Thread1of1ForFork3_#t~ite19, P1Thread1of1ForFork3_#t~ite18, P1Thread1of1ForFork3_#t~nondet4, P1Thread1of1ForFork3_#t~nondet3, P1Thread1of1ForFork3_#t~ite11, P1Thread1of1ForFork3_#t~ite6, P1Thread1of1ForFork3_#t~ite10, P1Thread1of1ForFork3_#t~ite5, P1Thread1of1ForFork3_#t~ite13, P1Thread1of1ForFork3_#t~ite12, P1Thread1of1ForFork3_#t~ite15, P1Thread1of1ForFork3_#t~ite14, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork3_#t~ite8, ~y$w_buff1~0, P1Thread1of1ForFork3_#t~ite7, P1Thread1of1ForFork3_#t~ite9, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~y$w_buff1_used~0][128], [42#L828true, 18#L865-3true, 407#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (not (= ~__unbuffered_p1_EAX~0 0)) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd4~0 0) (not (= ~y~0 0))), Black: 382#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 372#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 380#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$r_buff0_thd2~0 0)), Black: 384#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 386#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 371#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), 187#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 329#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 315#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 325#(and (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 327#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 61#L786true, 231#(= ~a~0 1), P1Thread1of1ForFork3InUse, 281#(= ~x~0 1), 378#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 353#(and (= ~z~0 ~y$r_buff0_thd3~0) (= ~y$r_buff0_thd3~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~y$w_buff0_used~0 1)), 62#L758true, Black: 351#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 344#(and (= ~z~0 ~y$r_buff0_thd3~0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0_used~0 1)), 343#(= ~z~0 1), 40#L818true, Black: 287#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1))]) [2022-01-18 22:37:10,604 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is not cut-off event [2022-01-18 22:37:10,604 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-01-18 22:37:10,604 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-01-18 22:37:10,605 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-01-18 22:37:10,658 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([931] L770-->L786: Formula: (let ((.cse23 (= (mod v_~y$r_buff1_thd2~0_129 256) 0)) (.cse26 (= (mod v_~y$r_buff0_thd2~0_176 256) 0)) (.cse31 (= (mod v_~y$w_buff1_used~0_286 256) 0))) (let ((.cse11 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse8 (and .cse26 .cse31)) (.cse10 (and .cse26 .cse23)) (.cse17 (not .cse23)) (.cse2 (not .cse26)) (.cse30 (= (mod v_~y$w_buff0_used~0_366 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_365 256) 0)) (.cse24 (= (mod v_~y$w_buff1_used~0_285 256) 0))) (let ((.cse21 (not .cse24)) (.cse5 (or .cse26 .cse9)) (.cse4 (not .cse9)) (.cse15 (or .cse26 .cse30)) (.cse16 (not .cse30)) (.cse6 (or .cse2 (not .cse31))) (.cse7 (or .cse2 .cse17)) (.cse12 (or .cse30 .cse8 .cse10)) (.cse1 (not .cse11))) (and (= |v_P1Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_84) (let ((.cse0 (= |v_P1Thread1of1ForFork3_#t~ite16_1| |v_P1_#t~ite16_43|))) (or (and (= v_~y$w_buff1_used~0_286 v_~y$w_buff1_used~0_285) .cse0 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite17_1| |v_P1_#t~ite17_39|)) (and (or (and (let ((.cse3 (= |v_P1_#t~ite16_43| 0))) (or (and .cse2 .cse3 .cse4) (and .cse5 .cse3))) (= |v_P1_#t~ite17_39| |v_P1_#t~ite16_43|) .cse6 .cse4 .cse7) (and (or .cse8 .cse9 .cse10) .cse0 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_286))) .cse11 (= |v_P1_#t~ite17_39| v_~y$w_buff1_used~0_285)))) (= 0 v_~y$flush_delayed~0_40) (or (and (= v_~y~0_132 v_~y$mem_tmp~0_28) .cse1) (and (= v_~y~0_132 v_~__unbuffered_p1_EAX~0_16) .cse11)) (let ((.cse13 (= |v_P1_#t~ite7_45| |v_P1Thread1of1ForFork3_#t~ite7_1|))) (or (and (or (and .cse12 (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_86) .cse13) (and (= |v_P1_#t~ite8_43| |v_P1_#t~ite7_45|) (let ((.cse14 (= |v_P1_#t~ite7_45| v_~y$w_buff0~0_86))) (or (and .cse14 .cse15) (and .cse14 .cse2 .cse16))) .cse16 .cse6 .cse7)) (= |v_P1_#t~ite8_43| v_~y$w_buff0~0_85) .cse11) (and (= |v_P1_#t~ite8_43| |v_P1Thread1of1ForFork3_#t~ite8_1|) (= v_~y$w_buff0~0_86 v_~y$w_buff0~0_85) .cse1 .cse13))) (let ((.cse22 (= |v_P1Thread1of1ForFork3_#t~ite22_1| |v_P1_#t~ite22_53|))) (or (and (let ((.cse20 (= (mod v_~y$r_buff0_thd2~0_175 256) 0))) (or (let ((.cse18 (not .cse20))) (and (or .cse17 .cse18) (let ((.cse19 (= |v_P1_#t~ite22_53| 0))) (or (and .cse19 (or .cse20 .cse9)) (and .cse19 .cse18 .cse4))) (or .cse21 .cse18) (= |v_P1_#t~ite22_53| |v_P1_#t~ite23_47|) .cse4)) (and .cse22 (or (and .cse20 .cse23) (and .cse20 .cse24) .cse9) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_129)))) (= |v_P1_#t~ite23_47| v_~y$r_buff1_thd2~0_128) .cse11) (and .cse22 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite23_1| |v_P1_#t~ite23_47|) (= v_~y$r_buff1_thd2~0_129 v_~y$r_buff1_thd2~0_128)))) (= v_~y~0_134 v_~y$mem_tmp~0_28) (let ((.cse25 (= |v_P1Thread1of1ForFork3_#t~ite19_1| |v_P1_#t~ite19_63|))) (or (and (or (and .cse25 (or .cse9 .cse10 (and .cse26 .cse24)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_176)) (and (= |v_P1_#t~ite19_63| |v_P1_#t~ite20_57|) (or .cse21 .cse2) (or (and .cse5 (= |v_P1_#t~ite19_63| v_~y$r_buff0_thd2~0_176)) (and .cse2 (= |v_P1_#t~ite19_63| 0) .cse4)) .cse4 .cse7)) (= |v_P1_#t~ite20_57| v_~y$r_buff0_thd2~0_175) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite20_1| |v_P1_#t~ite20_57|) .cse25 (= v_~y$r_buff0_thd2~0_176 v_~y$r_buff0_thd2~0_175) .cse1))) (or (and .cse12 (= v_~y~0_134 v_~__unbuffered_p1_EAX~0_16) (= |v_P1_#t~ite5_47| |v_P1Thread1of1ForFork3_#t~ite5_1|)) (and (= |v_P1_#t~ite5_47| v_~__unbuffered_p1_EAX~0_16) .cse16 .cse6 (or (and (= |v_P1_#t~ite5_47| v_~y$w_buff1~0_97) .cse15) (and .cse2 .cse16 (= |v_P1_#t~ite5_47| v_~y$w_buff0~0_86))) .cse7)) (let ((.cse28 (= |v_P1Thread1of1ForFork3_#t~ite10_1| |v_P1_#t~ite10_49|))) (or (and (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_96) .cse11 (or (and (= |v_P1_#t~ite10_49| |v_P1_#t~ite11_45|) .cse16 (let ((.cse27 (= |v_P1_#t~ite10_49| v_~y$w_buff1~0_97))) (or (and .cse27 .cse2 .cse16) (and .cse27 .cse15))) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite11_45| v_~y$w_buff1~0_97) .cse28))) (and (= v_~y$w_buff1~0_97 v_~y$w_buff1~0_96) .cse28 .cse1 (= |v_P1Thread1of1ForFork3_#t~ite11_1| |v_P1_#t~ite11_45|)))) (= |v_P1Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_13) (let ((.cse29 (= |v_P1Thread1of1ForFork3_#t~ite13_1| |v_P1_#t~ite13_57|))) (or (and (or (and (= |v_P1_#t~ite13_57| |v_P1_#t~ite14_49|) .cse16 (or (and .cse15 (= |v_P1_#t~ite13_57| v_~y$w_buff0_used~0_366)) (and (= |v_P1_#t~ite13_57| 0) .cse2 .cse16)) .cse6 .cse7) (and .cse12 (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_366) .cse29)) (= |v_P1_#t~ite14_49| v_~y$w_buff0_used~0_365) .cse11) (and (= |v_P1Thread1of1ForFork3_#t~ite14_1| |v_P1_#t~ite14_49|) .cse29 .cse1 (= v_~y$w_buff0_used~0_366 v_~y$w_buff0_used~0_365)))))))) InVars {P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_1|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_1|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_366, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_1|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_1|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_1|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_1|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_1|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_1|, ~y$w_buff1~0=v_~y$w_buff1~0_97, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_1|, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_176, ~y~0=v_~y~0_134, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_365, P1Thread1of1ForFork3_#t~ite21=|v_P1Thread1of1ForFork3_#t~ite21_1|, P1Thread1of1ForFork3_#t~ite22=|v_P1Thread1of1ForFork3_#t~ite22_2|, P1Thread1of1ForFork3_#t~ite20=|v_P1Thread1of1ForFork3_#t~ite20_2|, P1Thread1of1ForFork3_#t~ite25=|v_P1Thread1of1ForFork3_#t~ite25_1|, P1Thread1of1ForFork3_#t~ite23=|v_P1Thread1of1ForFork3_#t~ite23_2|, P1Thread1of1ForFork3_#t~ite24=|v_P1Thread1of1ForFork3_#t~ite24_1|, ~y$mem_tmp~0=v_~y$mem_tmp~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_85, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_132, P1Thread1of1ForFork3_#t~ite17=|v_P1Thread1of1ForFork3_#t~ite17_2|, P1Thread1of1ForFork3_#t~ite16=|v_P1Thread1of1ForFork3_#t~ite16_2|, P1Thread1of1ForFork3_#t~ite19=|v_P1Thread1of1ForFork3_#t~ite19_2|, P1Thread1of1ForFork3_#t~ite18=|v_P1Thread1of1ForFork3_#t~ite18_1|, P1Thread1of1ForFork3_#t~nondet4=|v_P1Thread1of1ForFork3_#t~nondet4_2|, P1Thread1of1ForFork3_#t~nondet3=|v_P1Thread1of1ForFork3_#t~nondet3_2|, P1Thread1of1ForFork3_#t~ite11=|v_P1Thread1of1ForFork3_#t~ite11_2|, P1Thread1of1ForFork3_#t~ite6=|v_P1Thread1of1ForFork3_#t~ite6_1|, P1Thread1of1ForFork3_#t~ite10=|v_P1Thread1of1ForFork3_#t~ite10_2|, P1Thread1of1ForFork3_#t~ite5=|v_P1Thread1of1ForFork3_#t~ite5_2|, P1Thread1of1ForFork3_#t~ite13=|v_P1Thread1of1ForFork3_#t~ite13_2|, P1Thread1of1ForFork3_#t~ite12=|v_P1Thread1of1ForFork3_#t~ite12_1|, P1Thread1of1ForFork3_#t~ite15=|v_P1Thread1of1ForFork3_#t~ite15_1|, P1Thread1of1ForFork3_#t~ite14=|v_P1Thread1of1ForFork3_#t~ite14_2|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_128, ~weak$$choice0~0=v_~weak$$choice0~0_13, P1Thread1of1ForFork3_#t~ite8=|v_P1Thread1of1ForFork3_#t~ite8_2|, ~y$w_buff1~0=v_~y$w_buff1~0_96, P1Thread1of1ForFork3_#t~ite7=|v_P1Thread1of1ForFork3_#t~ite7_2|, P1Thread1of1ForFork3_#t~ite9=|v_P1Thread1of1ForFork3_#t~ite9_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285} AuxVars[|v_P1_#t~ite23_47|, |v_P1_#t~ite22_53|, |v_P1_#t~ite7_45|, |v_P1_#t~ite10_49|, |v_P1_#t~ite5_47|, |v_P1_#t~ite8_43|, |v_P1_#t~ite17_39|, |v_P1_#t~ite11_45|, |v_P1_#t~ite19_63|, |v_P1_#t~ite14_49|, |v_P1_#t~ite13_57|, |v_P1_#t~ite20_57|, |v_P1_#t~ite16_43|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork3_#t~ite21, P1Thread1of1ForFork3_#t~ite22, P1Thread1of1ForFork3_#t~ite20, P1Thread1of1ForFork3_#t~ite25, P1Thread1of1ForFork3_#t~ite23, P1Thread1of1ForFork3_#t~ite24, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, P1Thread1of1ForFork3_#t~ite17, P1Thread1of1ForFork3_#t~ite16, P1Thread1of1ForFork3_#t~ite19, P1Thread1of1ForFork3_#t~ite18, P1Thread1of1ForFork3_#t~nondet4, P1Thread1of1ForFork3_#t~nondet3, P1Thread1of1ForFork3_#t~ite11, P1Thread1of1ForFork3_#t~ite6, P1Thread1of1ForFork3_#t~ite10, P1Thread1of1ForFork3_#t~ite5, P1Thread1of1ForFork3_#t~ite13, P1Thread1of1ForFork3_#t~ite12, P1Thread1of1ForFork3_#t~ite15, P1Thread1of1ForFork3_#t~ite14, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork3_#t~ite8, ~y$w_buff1~0, P1Thread1of1ForFork3_#t~ite7, P1Thread1of1ForFork3_#t~ite9, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~y$w_buff1_used~0][121], [18#L865-3true, Black: 378#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 370#(= ~y$r_buff0_thd2~0 0), Black: 382#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 372#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), Black: 380#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y$r_buff0_thd2~0 0)), Black: 384#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 386#(and (= ~__unbuffered_p1_EAX~0 1) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~y$r_buff0_thd2~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 371#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 1) (= ~y$w_buff0_used~0 1)), 109#L811true, 187#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 329#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 315#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 325#(and (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 327#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 231#(= ~a~0 1), 61#L786true, P1Thread1of1ForFork3InUse, 281#(= ~x~0 1), 399#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0~0 ~y$r_buff0_thd3~0) (= ~y$w_buff0_used~0 1)), Black: 353#(and (= ~z~0 ~y$r_buff0_thd3~0) (= ~y$r_buff0_thd3~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~y$w_buff0_used~0 1)), 62#L758true, Black: 351#(and (= ~z~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 344#(and (= ~z~0 ~y$r_buff0_thd3~0) (= ~y$r_buff0_thd3~0 1) (= ~y$w_buff0_used~0 1)), 343#(= ~z~0 1), 27#L841true, Black: 287#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1))]) [2022-01-18 22:37:10,658 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-18 22:37:10,658 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-18 22:37:10,658 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-18 22:37:10,658 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-18 22:37:10,882 INFO L129 PetriNetUnfolder]: 663/2882 cut-off events. [2022-01-18 22:37:10,882 INFO L130 PetriNetUnfolder]: For 2764/2899 co-relation queries the response was YES. [2022-01-18 22:37:10,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6582 conditions, 2882 events. 663/2882 cut-off events. For 2764/2899 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 29587 event pairs, 43 based on Foata normal form. 48/2812 useless extension candidates. Maximal degree in co-relation 6556. Up to 384 conditions per place. [2022-01-18 22:37:10,901 INFO L132 encePairwiseOnDemand]: 127/137 looper letters, 31 selfloop transitions, 14 changer transitions 10/173 dead transitions. [2022-01-18 22:37:10,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 173 transitions, 873 flow [2022-01-18 22:37:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:37:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:37:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1226 transitions. [2022-01-18 22:37:10,904 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8135368281353683 [2022-01-18 22:37:10,904 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1226 transitions. [2022-01-18 22:37:10,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1226 transitions. [2022-01-18 22:37:10,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:37:10,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1226 transitions. [2022-01-18 22:37:10,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 111.45454545454545) internal successors, (1226), 11 states have internal predecessors, (1226), 0 states have call successors, (0), 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-18 22:37:10,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-18 22:37:10,910 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-18 22:37:10,910 INFO L186 Difference]: Start difference. First operand has 166 places, 160 transitions, 683 flow. Second operand 11 states and 1226 transitions. [2022-01-18 22:37:10,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 173 transitions, 873 flow [2022-01-18 22:37:10,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 173 transitions, 856 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-01-18 22:37:10,927 INFO L242 Difference]: Finished difference. Result has 174 places, 160 transitions, 722 flow [2022-01-18 22:37:10,927 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=722, PETRI_PLACES=174, PETRI_TRANSITIONS=160} [2022-01-18 22:37:10,928 INFO L334 CegarLoopForPetriNet]: 144 programPoint places, 30 predicate places. [2022-01-18 22:37:10,928 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 160 transitions, 722 flow [2022-01-18 22:37:10,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.18181818181819) internal successors, (1212), 11 states have internal predecessors, (1212), 0 states have call successors, (0), 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-18 22:37:10,928 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:37:10,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:37:10,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 22:37:10,929 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:37:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:37:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1411168236, now seen corresponding path program 4 times [2022-01-18 22:37:10,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:37:10,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669853103] [2022-01-18 22:37:10,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:37:10,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:37:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:37:10,979 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:37:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:37:11,093 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:37:11,093 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:37:11,094 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-18 22:37:11,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-18 22:37:11,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-18 22:37:11,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-18 22:37:11,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-18 22:37:11,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-18 22:37:11,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-18 22:37:11,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-18 22:37:11,099 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1] [2022-01-18 22:37:11,103 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:37:11,103 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:37:11,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:37:11 BasicIcfg [2022-01-18 22:37:11,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:37:11,261 INFO L158 Benchmark]: Toolchain (without parser) took 10612.12ms. Allocated memory was 388.0MB in the beginning and 849.3MB in the end (delta: 461.4MB). Free memory was 331.9MB in the beginning and 586.8MB in the end (delta: -254.9MB). Peak memory consumption was 208.3MB. Max. memory is 16.0GB. [2022-01-18 22:37:11,261 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 388.0MB. Free memory is still 350.6MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:37:11,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.76ms. Allocated memory is still 388.0MB. Free memory was 331.8MB in the beginning and 347.2MB in the end (delta: -15.5MB). Peak memory consumption was 17.9MB. Max. memory is 16.0GB. [2022-01-18 22:37:11,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.40ms. Allocated memory is still 388.0MB. Free memory was 347.2MB in the beginning and 344.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 22:37:11,262 INFO L158 Benchmark]: Boogie Preprocessor took 25.17ms. Allocated memory is still 388.0MB. Free memory was 344.1MB in the beginning and 342.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:37:11,262 INFO L158 Benchmark]: RCFGBuilder took 841.13ms. Allocated memory is still 388.0MB. Free memory was 342.0MB in the beginning and 268.6MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. [2022-01-18 22:37:11,263 INFO L158 Benchmark]: TraceAbstraction took 9172.45ms. Allocated memory was 388.0MB in the beginning and 849.3MB in the end (delta: 461.4MB). Free memory was 268.6MB in the beginning and 586.8MB in the end (delta: -318.2MB). Peak memory consumption was 144.2MB. Max. memory is 16.0GB. [2022-01-18 22:37:11,264 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.17ms. Allocated memory is still 388.0MB. Free memory is still 350.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 499.76ms. Allocated memory is still 388.0MB. Free memory was 331.8MB in the beginning and 347.2MB in the end (delta: -15.5MB). Peak memory consumption was 17.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.40ms. Allocated memory is still 388.0MB. Free memory was 347.2MB in the beginning and 344.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.17ms. Allocated memory is still 388.0MB. Free memory was 344.1MB in the beginning and 342.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 841.13ms. Allocated memory is still 388.0MB. Free memory was 342.0MB in the beginning and 268.6MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. * TraceAbstraction took 9172.45ms. Allocated memory was 388.0MB in the beginning and 849.3MB in the end (delta: 461.4MB). Free memory was 268.6MB in the beginning and 586.8MB in the end (delta: -318.2MB). Peak memory consumption was 144.2MB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L730] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L731] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L732] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L733] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L734] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L735] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L736] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L737] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L738] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L739] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L740] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L741] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L742] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L743] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L744] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L745] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L746] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t437; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t437={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=8, t437={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t438; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=9, t437={5:0}, t438={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t439; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=10, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 0 pthread_t t440; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=11, t437={5:0}, t438={6:0}, t439={7:0}, t440={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 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) [L776] 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) [L777] 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)) [L777] 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)) [L778] 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)) [L778] 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)) [L779] 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)) [L779] 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)) [L780] 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)) [L780] 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)) [L781] 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)) [L781] 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)) [L782] 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)) [L782] 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)) [L783] 2 __unbuffered_p1_EAX = y [L784] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 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) [L813] 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) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 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 [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 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 [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L836] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L871] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L871] 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) [L871] 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) [L872] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L873] 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 [L874] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L875] 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 [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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: 863]: 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: 859]: 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: 865]: 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: 861]: 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 9 procedures, 172 locations, 7 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: 8.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 590 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 590 mSDsluCounter, 634 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1154 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1572 IncrementalHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 129 mSDtfsCounter, 1572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=722occurred in iteration=11, InterpolantAutomatonStates: 104, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1155 NumberOfCodeBlocks, 1155 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1038 ConstructedInterpolants, 0 QuantifiedInterpolants, 4921 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-18 22:37:11,296 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...