/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-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix036.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:15:13,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:15:13,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:15:13,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:15:13,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:15:13,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:15:13,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:15:13,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:15:13,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:15:13,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:15:13,580 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:15:13,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:15:13,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:15:13,581 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:15:13,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:15:13,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:15:13,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:15:13,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:15:13,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:15:13,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:15:13,582 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:15:13,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:15:13,586 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:15:13,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:15:13,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:15:13,586 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:15:13,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:15:13,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:15:13,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:15:13,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:15:13,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:15:13,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:15:13,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:15:13,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:15:13,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:15:13,588 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:15:13,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:15:13,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:15:13,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:15:13,851 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:15:13,851 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:15:13,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2023-08-26 18:15:14,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:15:15,099 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:15:15,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2023-08-26 18:15:15,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ae587b2/208123a172b744718afbc02a703bb8f5/FLAG5f198641f [2023-08-26 18:15:15,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ae587b2/208123a172b744718afbc02a703bb8f5 [2023-08-26 18:15:15,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:15:15,419 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:15:15,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:15:15,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:15:15,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:15:15,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b42bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15, skipping insertion in model container [2023-08-26 18:15:15,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,452 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:15:15,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:15:15,726 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:15:15,753 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:15:15,754 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:15:15,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:15:15,827 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:15:15,827 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:15:15,832 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:15:15,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15 WrapperNode [2023-08-26 18:15:15,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:15:15,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:15:15,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:15:15,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:15:15,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,898 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2023-08-26 18:15:15,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:15:15,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:15:15,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:15:15,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:15:15,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:15:15,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:15:15,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:15:15,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:15:15,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (1/1) ... [2023-08-26 18:15:15,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:15:15,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:15:15,977 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) [2023-08-26 18:15:15,980 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 [2023-08-26 18:15:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:15:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:15:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:15:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:15:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:15:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:15:16,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:15:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:15:16,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:15:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:15:16,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:15:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:15:16,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:15:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:15:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:15:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:15:16,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:15:16,013 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:15:16,109 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:15:16,111 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:15:16,387 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:15:16,450 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:15:16,450 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:15:16,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:15:16 BoogieIcfgContainer [2023-08-26 18:15:16,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:15:16,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:15:16,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:15:16,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:15:16,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:15:15" (1/3) ... [2023-08-26 18:15:16,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae02757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:15:16, skipping insertion in model container [2023-08-26 18:15:16,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:15" (2/3) ... [2023-08-26 18:15:16,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae02757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:15:16, skipping insertion in model container [2023-08-26 18:15:16,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:15:16" (3/3) ... [2023-08-26 18:15:16,462 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2023-08-26 18:15:16,472 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:15:16,472 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:15:16,473 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:15:16,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:15:16,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 312 flow [2023-08-26 18:15:16,603 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2023-08-26 18:15:16,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:16,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 3/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 18:15:16,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 146 transitions, 312 flow [2023-08-26 18:15:16,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 142 transitions, 296 flow [2023-08-26 18:15:16,616 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:15:16,622 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 142 transitions, 296 flow [2023-08-26 18:15:16,624 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 142 transitions, 296 flow [2023-08-26 18:15:16,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 296 flow [2023-08-26 18:15:16,654 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2023-08-26 18:15:16,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:16,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 3/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 18:15:16,658 INFO L119 LiptonReduction]: Number of co-enabled transitions 3698 [2023-08-26 18:15:20,421 INFO L134 LiptonReduction]: Checked pairs total: 11127 [2023-08-26 18:15:20,421 INFO L136 LiptonReduction]: Total number of compositions: 154 [2023-08-26 18:15:20,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:15:20,433 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d1284e5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:15:20,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:15:20,434 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:15:20,434 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:15:20,434 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:20,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:20,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:15:20,435 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:20,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:20,438 INFO L85 PathProgramCache]: Analyzing trace with hash 650, now seen corresponding path program 1 times [2023-08-26 18:15:20,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:20,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549895146] [2023-08-26 18:15:20,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:20,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:20,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:20,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549895146] [2023-08-26 18:15:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549895146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:20,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:20,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:15:20,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608015352] [2023-08-26 18:15:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:20,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:15:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:20,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:15:20,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:15:20,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 300 [2023-08-26 18:15:20,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:20,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:20,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 300 [2023-08-26 18:15:20,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:21,909 INFO L124 PetriNetUnfolderBase]: 7479/10115 cut-off events. [2023-08-26 18:15:21,909 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-08-26 18:15:21,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20423 conditions, 10115 events. 7479/10115 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 50409 event pairs, 7479 based on Foata normal form. 0/9093 useless extension candidates. Maximal degree in co-relation 20411. Up to 10091 conditions per place. [2023-08-26 18:15:21,949 INFO L140 encePairwiseOnDemand]: 291/300 looper letters, 27 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-26 18:15:21,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 126 flow [2023-08-26 18:15:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:15:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:15:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2023-08-26 18:15:21,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-08-26 18:15:21,961 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2023-08-26 18:15:21,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2023-08-26 18:15:21,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:21,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2023-08-26 18:15:21,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:21,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:21,971 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:21,972 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 296 transitions. [2023-08-26 18:15:21,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 126 flow [2023-08-26 18:15:21,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:15:21,979 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-26 18:15:21,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 18:15:21,982 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-26 18:15:21,982 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-26 18:15:21,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:21,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:21,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:15:21,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:15:21,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:21,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash 637665, now seen corresponding path program 1 times [2023-08-26 18:15:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:21,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077943420] [2023-08-26 18:15:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:22,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:22,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077943420] [2023-08-26 18:15:22,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077943420] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:22,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:22,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:15:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307552777] [2023-08-26 18:15:22,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:22,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:15:22,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:15:22,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:15:22,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 300 [2023-08-26 18:15:22,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:22,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:22,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 300 [2023-08-26 18:15:22,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:22,783 INFO L124 PetriNetUnfolderBase]: 5879/8107 cut-off events. [2023-08-26 18:15:22,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:22,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16248 conditions, 8107 events. 5879/8107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 40594 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16245. Up to 6367 conditions per place. [2023-08-26 18:15:22,814 INFO L140 encePairwiseOnDemand]: 297/300 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-26 18:15:22,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 208 flow [2023-08-26 18:15:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:15:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:15:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-26 18:15:22,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-26 18:15:22,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-26 18:15:22,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-26 18:15:22,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:22,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-26 18:15:22,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:22,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:22,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:22,822 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 435 transitions. [2023-08-26 18:15:22,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 208 flow [2023-08-26 18:15:22,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:15:22,825 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-26 18:15:22,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-26 18:15:22,825 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-26 18:15:22,826 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-26 18:15:22,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:22,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:22,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:22,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:15:22,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:22,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash 319235631, now seen corresponding path program 1 times [2023-08-26 18:15:22,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:22,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119752328] [2023-08-26 18:15:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:23,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119752328] [2023-08-26 18:15:23,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119752328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:23,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:23,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:15:23,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55407932] [2023-08-26 18:15:23,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:23,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:15:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:23,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:15:23,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:15:23,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 300 [2023-08-26 18:15:23,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:23,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:23,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 300 [2023-08-26 18:15:23,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:23,479 INFO L124 PetriNetUnfolderBase]: 4279/5876 cut-off events. [2023-08-26 18:15:23,479 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2023-08-26 18:15:23,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12301 conditions, 5876 events. 4279/5876 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 27882 event pairs, 1463 based on Foata normal form. 128/5988 useless extension candidates. Maximal degree in co-relation 12297. Up to 4033 conditions per place. [2023-08-26 18:15:23,550 INFO L140 encePairwiseOnDemand]: 297/300 looper letters, 34 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-08-26 18:15:23,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 164 flow [2023-08-26 18:15:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:15:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:15:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-26 18:15:23,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46444444444444444 [2023-08-26 18:15:23,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-26 18:15:23,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-26 18:15:23,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:23,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-26 18:15:23,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:23,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:23,555 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:23,555 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 418 transitions. [2023-08-26 18:15:23,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 164 flow [2023-08-26 18:15:23,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:23,557 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 72 flow [2023-08-26 18:15:23,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-26 18:15:23,557 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-26 18:15:23,557 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 72 flow [2023-08-26 18:15:23,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:23,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:23,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:23,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:15:23,558 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:23,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1839380908, now seen corresponding path program 1 times [2023-08-26 18:15:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:23,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104547457] [2023-08-26 18:15:23,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:23,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:23,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104547457] [2023-08-26 18:15:23,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104547457] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:23,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:23,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:15:23,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960880538] [2023-08-26 18:15:23,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:23,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:23,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:23,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:23,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:23,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 300 [2023-08-26 18:15:23,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:23,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:23,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 300 [2023-08-26 18:15:23,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:24,307 INFO L124 PetriNetUnfolderBase]: 3810/5437 cut-off events. [2023-08-26 18:15:24,308 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2023-08-26 18:15:24,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11612 conditions, 5437 events. 3810/5437 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28277 event pairs, 701 based on Foata normal form. 384/5808 useless extension candidates. Maximal degree in co-relation 11607. Up to 3508 conditions per place. [2023-08-26 18:15:24,323 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 40 selfloop transitions, 5 changer transitions 29/77 dead transitions. [2023-08-26 18:15:24,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 77 transitions, 333 flow [2023-08-26 18:15:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:15:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:15:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2023-08-26 18:15:24,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573333333333333 [2023-08-26 18:15:24,325 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2023-08-26 18:15:24,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2023-08-26 18:15:24,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:24,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2023-08-26 18:15:24,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:24,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:24,328 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:24,328 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 72 flow. Second operand 5 states and 686 transitions. [2023-08-26 18:15:24,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 77 transitions, 333 flow [2023-08-26 18:15:24,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 77 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:24,331 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 113 flow [2023-08-26 18:15:24,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-08-26 18:15:24,332 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-26 18:15:24,332 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 113 flow [2023-08-26 18:15:24,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:24,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:24,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:24,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:15:24,333 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:24,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:24,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2070807840, now seen corresponding path program 1 times [2023-08-26 18:15:24,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:24,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331321459] [2023-08-26 18:15:24,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:24,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:24,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:24,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331321459] [2023-08-26 18:15:24,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331321459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:24,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:15:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760705747] [2023-08-26 18:15:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:24,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:15:24,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:15:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:15:24,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 300 [2023-08-26 18:15:24,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:24,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:24,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 300 [2023-08-26 18:15:24,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:24,874 INFO L124 PetriNetUnfolderBase]: 2136/3196 cut-off events. [2023-08-26 18:15:24,874 INFO L125 PetriNetUnfolderBase]: For 1056/1056 co-relation queries the response was YES. [2023-08-26 18:15:24,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8741 conditions, 3196 events. 2136/3196 cut-off events. For 1056/1056 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 16165 event pairs, 428 based on Foata normal form. 249/3432 useless extension candidates. Maximal degree in co-relation 8733. Up to 1060 conditions per place. [2023-08-26 18:15:24,883 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 54 selfloop transitions, 9 changer transitions 29/95 dead transitions. [2023-08-26 18:15:24,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 95 transitions, 487 flow [2023-08-26 18:15:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:15:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:15:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 826 transitions. [2023-08-26 18:15:24,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4588888888888889 [2023-08-26 18:15:24,885 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 826 transitions. [2023-08-26 18:15:24,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 826 transitions. [2023-08-26 18:15:24,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:24,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 826 transitions. [2023-08-26 18:15:24,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.66666666666666) internal successors, (826), 6 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:24,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:24,890 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:24,890 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 113 flow. Second operand 6 states and 826 transitions. [2023-08-26 18:15:24,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 95 transitions, 487 flow [2023-08-26 18:15:24,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 95 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:24,898 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 178 flow [2023-08-26 18:15:24,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-08-26 18:15:24,899 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-26 18:15:24,899 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 178 flow [2023-08-26 18:15:24,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:24,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:24,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:24,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:15:24,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:24,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1172902351, now seen corresponding path program 1 times [2023-08-26 18:15:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:24,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438057984] [2023-08-26 18:15:24,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:25,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:25,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438057984] [2023-08-26 18:15:25,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438057984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:25,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:25,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:15:25,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456015004] [2023-08-26 18:15:25,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:25,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:15:25,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:25,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:15:25,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:15:25,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 300 [2023-08-26 18:15:25,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:25,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:25,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 300 [2023-08-26 18:15:25,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:25,900 INFO L124 PetriNetUnfolderBase]: 5300/7873 cut-off events. [2023-08-26 18:15:25,901 INFO L125 PetriNetUnfolderBase]: For 8815/8815 co-relation queries the response was YES. [2023-08-26 18:15:25,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24123 conditions, 7873 events. 5300/7873 cut-off events. For 8815/8815 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 41734 event pairs, 634 based on Foata normal form. 56/7929 useless extension candidates. Maximal degree in co-relation 24113. Up to 4120 conditions per place. [2023-08-26 18:15:25,924 INFO L140 encePairwiseOnDemand]: 287/300 looper letters, 127 selfloop transitions, 27 changer transitions 2/156 dead transitions. [2023-08-26 18:15:25,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 156 transitions, 1080 flow [2023-08-26 18:15:25,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:15:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:15:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 934 transitions. [2023-08-26 18:15:25,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44476190476190475 [2023-08-26 18:15:25,927 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 934 transitions. [2023-08-26 18:15:25,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 934 transitions. [2023-08-26 18:15:25,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:25,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 934 transitions. [2023-08-26 18:15:25,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.42857142857142) internal successors, (934), 7 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:25,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:25,931 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:25,931 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 178 flow. Second operand 7 states and 934 transitions. [2023-08-26 18:15:25,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 156 transitions, 1080 flow [2023-08-26 18:15:26,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 156 transitions, 914 flow, removed 64 selfloop flow, removed 4 redundant places. [2023-08-26 18:15:26,008 INFO L231 Difference]: Finished difference. Result has 54 places, 65 transitions, 336 flow [2023-08-26 18:15:26,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=54, PETRI_TRANSITIONS=65} [2023-08-26 18:15:26,009 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-26 18:15:26,009 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 65 transitions, 336 flow [2023-08-26 18:15:26,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:26,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:26,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:26,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:15:26,009 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:26,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1745905057, now seen corresponding path program 2 times [2023-08-26 18:15:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:26,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115275026] [2023-08-26 18:15:26,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:26,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:26,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:26,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115275026] [2023-08-26 18:15:26,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115275026] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:26,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:15:26,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366302837] [2023-08-26 18:15:26,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:26,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:15:26,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:26,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:15:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:15:26,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 300 [2023-08-26 18:15:26,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 65 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:26,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:26,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 300 [2023-08-26 18:15:26,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:26,769 INFO L124 PetriNetUnfolderBase]: 3445/5449 cut-off events. [2023-08-26 18:15:26,769 INFO L125 PetriNetUnfolderBase]: For 5700/5992 co-relation queries the response was YES. [2023-08-26 18:15:26,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18206 conditions, 5449 events. 3445/5449 cut-off events. For 5700/5992 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 32215 event pairs, 564 based on Foata normal form. 355/5659 useless extension candidates. Maximal degree in co-relation 18194. Up to 1900 conditions per place. [2023-08-26 18:15:26,829 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 144 selfloop transitions, 18 changer transitions 31/203 dead transitions. [2023-08-26 18:15:26,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 203 transitions, 1346 flow [2023-08-26 18:15:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:15:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:15:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 964 transitions. [2023-08-26 18:15:26,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45904761904761904 [2023-08-26 18:15:26,831 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 964 transitions. [2023-08-26 18:15:26,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 964 transitions. [2023-08-26 18:15:26,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:26,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 964 transitions. [2023-08-26 18:15:26,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.71428571428572) internal successors, (964), 7 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) [2023-08-26 18:15:26,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:26,850 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:26,850 INFO L175 Difference]: Start difference. First operand has 54 places, 65 transitions, 336 flow. Second operand 7 states and 964 transitions. [2023-08-26 18:15:26,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 203 transitions, 1346 flow [2023-08-26 18:15:26,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 203 transitions, 1346 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:15:26,861 INFO L231 Difference]: Finished difference. Result has 63 places, 73 transitions, 478 flow [2023-08-26 18:15:26,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=478, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2023-08-26 18:15:26,861 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2023-08-26 18:15:26,861 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 73 transitions, 478 flow [2023-08-26 18:15:26,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:26,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:26,862 INFO L208 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] [2023-08-26 18:15:26,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:15:26,862 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:26,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash 218360427, now seen corresponding path program 1 times [2023-08-26 18:15:26,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:26,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636419334] [2023-08-26 18:15:26,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:26,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:27,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:27,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636419334] [2023-08-26 18:15:27,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636419334] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:27,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:27,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:15:27,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743629914] [2023-08-26 18:15:27,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:27,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:15:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:27,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:15:27,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:15:27,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 300 [2023-08-26 18:15:27,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 73 transitions, 478 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:27,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:27,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 300 [2023-08-26 18:15:27,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:27,934 INFO L124 PetriNetUnfolderBase]: 4013/6625 cut-off events. [2023-08-26 18:15:27,934 INFO L125 PetriNetUnfolderBase]: For 13356/13581 co-relation queries the response was YES. [2023-08-26 18:15:27,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25499 conditions, 6625 events. 4013/6625 cut-off events. For 13356/13581 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 42018 event pairs, 870 based on Foata normal form. 154/6708 useless extension candidates. Maximal degree in co-relation 25483. Up to 2475 conditions per place. [2023-08-26 18:15:27,962 INFO L140 encePairwiseOnDemand]: 292/300 looper letters, 101 selfloop transitions, 17 changer transitions 75/201 dead transitions. [2023-08-26 18:15:27,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 201 transitions, 1826 flow [2023-08-26 18:15:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:15:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:15:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 944 transitions. [2023-08-26 18:15:27,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44952380952380955 [2023-08-26 18:15:27,965 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 944 transitions. [2023-08-26 18:15:27,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 944 transitions. [2023-08-26 18:15:27,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:27,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 944 transitions. [2023-08-26 18:15:27,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:27,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:27,970 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:27,970 INFO L175 Difference]: Start difference. First operand has 63 places, 73 transitions, 478 flow. Second operand 7 states and 944 transitions. [2023-08-26 18:15:27,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 201 transitions, 1826 flow [2023-08-26 18:15:28,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 201 transitions, 1520 flow, removed 124 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:28,106 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 452 flow [2023-08-26 18:15:28,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=452, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2023-08-26 18:15:28,106 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-26 18:15:28,106 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 452 flow [2023-08-26 18:15:28,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:28,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:28,107 INFO L208 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] [2023-08-26 18:15:28,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:15:28,107 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:28,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash -434875537, now seen corresponding path program 2 times [2023-08-26 18:15:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:28,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976741201] [2023-08-26 18:15:28,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:28,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:28,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:28,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976741201] [2023-08-26 18:15:28,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976741201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:28,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:28,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:15:28,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328144265] [2023-08-26 18:15:28,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:28,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:15:28,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:15:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:15:28,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 300 [2023-08-26 18:15:28,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 452 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:28,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:28,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 300 [2023-08-26 18:15:28,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:29,040 INFO L124 PetriNetUnfolderBase]: 6201/9331 cut-off events. [2023-08-26 18:15:29,041 INFO L125 PetriNetUnfolderBase]: For 18123/18123 co-relation queries the response was YES. [2023-08-26 18:15:29,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36499 conditions, 9331 events. 6201/9331 cut-off events. For 18123/18123 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 52607 event pairs, 1047 based on Foata normal form. 16/9347 useless extension candidates. Maximal degree in co-relation 36480. Up to 4309 conditions per place. [2023-08-26 18:15:29,073 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 110 selfloop transitions, 15 changer transitions 61/186 dead transitions. [2023-08-26 18:15:29,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 186 transitions, 1508 flow [2023-08-26 18:15:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:15:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:15:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2023-08-26 18:15:29,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445 [2023-08-26 18:15:29,086 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2023-08-26 18:15:29,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2023-08-26 18:15:29,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:29,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2023-08-26 18:15:29,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,099 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,099 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 452 flow. Second operand 6 states and 801 transitions. [2023-08-26 18:15:29,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 186 transitions, 1508 flow [2023-08-26 18:15:29,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 186 transitions, 1475 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-26 18:15:29,326 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 480 flow [2023-08-26 18:15:29,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2023-08-26 18:15:29,327 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2023-08-26 18:15:29,327 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 480 flow [2023-08-26 18:15:29,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:29,328 INFO L208 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] [2023-08-26 18:15:29,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:15:29,328 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:29,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1295230777, now seen corresponding path program 3 times [2023-08-26 18:15:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:29,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165528714] [2023-08-26 18:15:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:29,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:29,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:29,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165528714] [2023-08-26 18:15:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165528714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:29,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:29,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:15:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788195271] [2023-08-26 18:15:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:29,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:15:29,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:29,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:15:29,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:15:29,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 300 [2023-08-26 18:15:29,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 480 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:29,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 300 [2023-08-26 18:15:29,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:30,652 INFO L124 PetriNetUnfolderBase]: 4490/7278 cut-off events. [2023-08-26 18:15:30,652 INFO L125 PetriNetUnfolderBase]: For 13887/14380 co-relation queries the response was YES. [2023-08-26 18:15:30,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28079 conditions, 7278 events. 4490/7278 cut-off events. For 13887/14380 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 46839 event pairs, 808 based on Foata normal form. 244/7417 useless extension candidates. Maximal degree in co-relation 28060. Up to 2682 conditions per place. [2023-08-26 18:15:30,692 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 112 selfloop transitions, 20 changer transitions 28/171 dead transitions. [2023-08-26 18:15:30,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 171 transitions, 1391 flow [2023-08-26 18:15:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:15:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:15:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 925 transitions. [2023-08-26 18:15:30,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2023-08-26 18:15:30,694 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 925 transitions. [2023-08-26 18:15:30,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 925 transitions. [2023-08-26 18:15:30,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:30,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 925 transitions. [2023-08-26 18:15:30,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:30,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:30,698 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:30,698 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 480 flow. Second operand 7 states and 925 transitions. [2023-08-26 18:15:30,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 171 transitions, 1391 flow [2023-08-26 18:15:30,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 171 transitions, 1355 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:30,806 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 576 flow [2023-08-26 18:15:30,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2023-08-26 18:15:30,806 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2023-08-26 18:15:30,807 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 576 flow [2023-08-26 18:15:30,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:30,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:30,807 INFO L208 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] [2023-08-26 18:15:30,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:15:30,807 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:30,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash -456691212, now seen corresponding path program 1 times [2023-08-26 18:15:30,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:30,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350411455] [2023-08-26 18:15:30,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:30,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:31,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:31,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350411455] [2023-08-26 18:15:31,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350411455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:31,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:31,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:15:31,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426021965] [2023-08-26 18:15:31,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:31,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:15:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:31,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:15:31,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:15:31,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 300 [2023-08-26 18:15:31,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 576 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:31,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:31,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 300 [2023-08-26 18:15:31,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:32,061 INFO L124 PetriNetUnfolderBase]: 4780/7822 cut-off events. [2023-08-26 18:15:32,061 INFO L125 PetriNetUnfolderBase]: For 21176/21476 co-relation queries the response was YES. [2023-08-26 18:15:32,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32742 conditions, 7822 events. 4780/7822 cut-off events. For 21176/21476 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 51442 event pairs, 1145 based on Foata normal form. 200/7900 useless extension candidates. Maximal degree in co-relation 32721. Up to 3336 conditions per place. [2023-08-26 18:15:32,096 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 114 selfloop transitions, 20 changer transitions 33/178 dead transitions. [2023-08-26 18:15:32,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 178 transitions, 1507 flow [2023-08-26 18:15:32,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:15:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:15:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 925 transitions. [2023-08-26 18:15:32,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2023-08-26 18:15:32,098 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 925 transitions. [2023-08-26 18:15:32,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 925 transitions. [2023-08-26 18:15:32,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:32,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 925 transitions. [2023-08-26 18:15:32,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:32,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:32,102 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:32,102 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 576 flow. Second operand 7 states and 925 transitions. [2023-08-26 18:15:32,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 178 transitions, 1507 flow [2023-08-26 18:15:32,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 178 transitions, 1498 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-26 18:15:32,252 INFO L231 Difference]: Finished difference. Result has 83 places, 83 transitions, 677 flow [2023-08-26 18:15:32,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=677, PETRI_PLACES=83, PETRI_TRANSITIONS=83} [2023-08-26 18:15:32,253 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-26 18:15:32,253 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 83 transitions, 677 flow [2023-08-26 18:15:32,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:32,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:32,253 INFO L208 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] [2023-08-26 18:15:32,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:15:32,253 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:32,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:32,254 INFO L85 PathProgramCache]: Analyzing trace with hash 572861405, now seen corresponding path program 4 times [2023-08-26 18:15:32,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:32,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485858291] [2023-08-26 18:15:32,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:32,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:32,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:32,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485858291] [2023-08-26 18:15:32,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485858291] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:32,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:32,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:15:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309130802] [2023-08-26 18:15:32,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:32,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:15:32,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:32,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:15:32,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:15:32,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 300 [2023-08-26 18:15:32,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 677 flow. Second operand has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:32,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:32,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 300 [2023-08-26 18:15:32,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:33,046 INFO L124 PetriNetUnfolderBase]: 4464/7107 cut-off events. [2023-08-26 18:15:33,046 INFO L125 PetriNetUnfolderBase]: For 30010/30324 co-relation queries the response was YES. [2023-08-26 18:15:33,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32089 conditions, 7107 events. 4464/7107 cut-off events. For 30010/30324 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 45790 event pairs, 678 based on Foata normal form. 149/7031 useless extension candidates. Maximal degree in co-relation 32065. Up to 2808 conditions per place. [2023-08-26 18:15:33,074 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 121 selfloop transitions, 18 changer transitions 51/196 dead transitions. [2023-08-26 18:15:33,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 196 transitions, 1902 flow [2023-08-26 18:15:33,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:15:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:15:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1072 transitions. [2023-08-26 18:15:33,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2023-08-26 18:15:33,077 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1072 transitions. [2023-08-26 18:15:33,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1072 transitions. [2023-08-26 18:15:33,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:33,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1072 transitions. [2023-08-26 18:15:33,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 300.0) internal successors, (2700), 9 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,082 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 300.0) internal successors, (2700), 9 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,082 INFO L175 Difference]: Start difference. First operand has 83 places, 83 transitions, 677 flow. Second operand 8 states and 1072 transitions. [2023-08-26 18:15:33,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 196 transitions, 1902 flow [2023-08-26 18:15:33,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 196 transitions, 1862 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-26 18:15:33,303 INFO L231 Difference]: Finished difference. Result has 87 places, 67 transitions, 544 flow [2023-08-26 18:15:33,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=544, PETRI_PLACES=87, PETRI_TRANSITIONS=67} [2023-08-26 18:15:33,304 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2023-08-26 18:15:33,304 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 67 transitions, 544 flow [2023-08-26 18:15:33,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:33,304 INFO L208 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] [2023-08-26 18:15:33,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:15:33,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:33,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash -948313226, now seen corresponding path program 1 times [2023-08-26 18:15:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:33,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400279548] [2023-08-26 18:15:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:33,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:33,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:33,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400279548] [2023-08-26 18:15:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400279548] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:33,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:15:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758422193] [2023-08-26 18:15:33,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:33,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:15:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:15:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:15:33,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 300 [2023-08-26 18:15:33,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 67 transitions, 544 flow. Second operand has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:33,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 300 [2023-08-26 18:15:33,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:33,912 INFO L124 PetriNetUnfolderBase]: 3518/5445 cut-off events. [2023-08-26 18:15:33,913 INFO L125 PetriNetUnfolderBase]: For 22248/22248 co-relation queries the response was YES. [2023-08-26 18:15:33,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25467 conditions, 5445 events. 3518/5445 cut-off events. For 22248/22248 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 30017 event pairs, 412 based on Foata normal form. 1/5446 useless extension candidates. Maximal degree in co-relation 25443. Up to 2832 conditions per place. [2023-08-26 18:15:33,930 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 88 selfloop transitions, 5 changer transitions 68/161 dead transitions. [2023-08-26 18:15:33,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 161 transitions, 1589 flow [2023-08-26 18:15:33,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:15:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:15:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 788 transitions. [2023-08-26 18:15:33,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43777777777777777 [2023-08-26 18:15:33,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 788 transitions. [2023-08-26 18:15:33,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 788 transitions. [2023-08-26 18:15:33,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:33,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 788 transitions. [2023-08-26 18:15:33,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,935 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,935 INFO L175 Difference]: Start difference. First operand has 87 places, 67 transitions, 544 flow. Second operand 6 states and 788 transitions. [2023-08-26 18:15:33,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 161 transitions, 1589 flow [2023-08-26 18:15:33,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 161 transitions, 1423 flow, removed 40 selfloop flow, removed 9 redundant places. [2023-08-26 18:15:33,992 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 435 flow [2023-08-26 18:15:33,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=435, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2023-08-26 18:15:33,992 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2023-08-26 18:15:33,992 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 435 flow [2023-08-26 18:15:33,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:33,993 INFO L208 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] [2023-08-26 18:15:33,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:15:33,993 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:33,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash 411014020, now seen corresponding path program 2 times [2023-08-26 18:15:33,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:33,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997542583] [2023-08-26 18:15:33,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:33,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:34,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:34,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997542583] [2023-08-26 18:15:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997542583] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:34,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:15:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388492988] [2023-08-26 18:15:34,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:34,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:15:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:15:34,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:15:34,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 300 [2023-08-26 18:15:34,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:34,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 300 [2023-08-26 18:15:34,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:34,420 INFO L124 PetriNetUnfolderBase]: 2005/3132 cut-off events. [2023-08-26 18:15:34,420 INFO L125 PetriNetUnfolderBase]: For 11085/11085 co-relation queries the response was YES. [2023-08-26 18:15:34,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13843 conditions, 3132 events. 2005/3132 cut-off events. For 11085/11085 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15489 event pairs, 365 based on Foata normal form. 1/3133 useless extension candidates. Maximal degree in co-relation 13821. Up to 1392 conditions per place. [2023-08-26 18:15:34,430 INFO L140 encePairwiseOnDemand]: 294/300 looper letters, 79 selfloop transitions, 3 changer transitions 57/139 dead transitions. [2023-08-26 18:15:34,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 139 transitions, 1283 flow [2023-08-26 18:15:34,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:15:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:15:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 774 transitions. [2023-08-26 18:15:34,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2023-08-26 18:15:34,432 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 774 transitions. [2023-08-26 18:15:34,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 774 transitions. [2023-08-26 18:15:34,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:34,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 774 transitions. [2023-08-26 18:15:34,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,435 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,435 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 435 flow. Second operand 6 states and 774 transitions. [2023-08-26 18:15:34,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 139 transitions, 1283 flow [2023-08-26 18:15:34,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 139 transitions, 1214 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-26 18:15:34,455 INFO L231 Difference]: Finished difference. Result has 79 places, 55 transitions, 370 flow [2023-08-26 18:15:34,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=370, PETRI_PLACES=79, PETRI_TRANSITIONS=55} [2023-08-26 18:15:34,456 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-26 18:15:34,456 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 55 transitions, 370 flow [2023-08-26 18:15:34,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:34,457 INFO L208 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] [2023-08-26 18:15:34,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:15:34,457 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:34,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1650897006, now seen corresponding path program 3 times [2023-08-26 18:15:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:34,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499141494] [2023-08-26 18:15:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:34,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:35,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:35,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499141494] [2023-08-26 18:15:35,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499141494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:35,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:35,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:15:35,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333392795] [2023-08-26 18:15:35,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:35,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:15:35,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:35,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:15:35,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:15:35,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 300 [2023-08-26 18:15:35,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 55 transitions, 370 flow. Second operand has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:35,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 300 [2023-08-26 18:15:35,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:35,559 INFO L124 PetriNetUnfolderBase]: 1029/1651 cut-off events. [2023-08-26 18:15:35,559 INFO L125 PetriNetUnfolderBase]: For 5129/5204 co-relation queries the response was YES. [2023-08-26 18:15:35,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6889 conditions, 1651 events. 1029/1651 cut-off events. For 5129/5204 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7679 event pairs, 179 based on Foata normal form. 52/1675 useless extension candidates. Maximal degree in co-relation 6866. Up to 1146 conditions per place. [2023-08-26 18:15:35,564 INFO L140 encePairwiseOnDemand]: 295/300 looper letters, 59 selfloop transitions, 6 changer transitions 33/101 dead transitions. [2023-08-26 18:15:35,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 101 transitions, 793 flow [2023-08-26 18:15:35,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:15:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:15:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2023-08-26 18:15:35,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2023-08-26 18:15:35,565 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2023-08-26 18:15:35,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2023-08-26 18:15:35,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:35,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2023-08-26 18:15:35,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,569 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,569 INFO L175 Difference]: Start difference. First operand has 79 places, 55 transitions, 370 flow. Second operand 6 states and 770 transitions. [2023-08-26 18:15:35,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 101 transitions, 793 flow [2023-08-26 18:15:35,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 101 transitions, 783 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-26 18:15:35,580 INFO L231 Difference]: Finished difference. Result has 79 places, 52 transitions, 349 flow [2023-08-26 18:15:35,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=79, PETRI_TRANSITIONS=52} [2023-08-26 18:15:35,581 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-26 18:15:35,581 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 52 transitions, 349 flow [2023-08-26 18:15:35,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:35,582 INFO L208 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] [2023-08-26 18:15:35,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:15:35,582 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:35,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:35,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1504693854, now seen corresponding path program 4 times [2023-08-26 18:15:35,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:35,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532318133] [2023-08-26 18:15:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:35,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:15:35,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:15:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:15:35,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:15:35,669 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:15:35,670 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:15:35,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:15:35,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:15:35,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:15:35,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:15:35,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:15:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:15:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:15:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:15:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:15:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:15:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:15:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:15:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:15:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:15:35,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:15:35,674 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:35,678 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:15:35,678 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:15:35,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:15:35 BasicIcfg [2023-08-26 18:15:35,750 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:15:35,750 INFO L158 Benchmark]: Toolchain (without parser) took 20331.32ms. Allocated memory was 419.4MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 394.6MB in the beginning and 967.0MB in the end (delta: -572.4MB). Peak memory consumption was 482.9MB. Max. memory is 16.0GB. [2023-08-26 18:15:35,750 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 419.4MB. Free memory is still 395.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:15:35,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.97ms. Allocated memory is still 419.4MB. Free memory was 394.6MB in the beginning and 370.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:15:35,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.57ms. Allocated memory is still 419.4MB. Free memory was 370.2MB in the beginning and 367.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:15:35,751 INFO L158 Benchmark]: Boogie Preprocessor took 42.39ms. Allocated memory is still 419.4MB. Free memory was 367.8MB in the beginning and 365.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:15:35,751 INFO L158 Benchmark]: RCFGBuilder took 509.50ms. Allocated memory is still 419.4MB. Free memory was 365.7MB in the beginning and 372.4MB in the end (delta: -6.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 18:15:35,751 INFO L158 Benchmark]: TraceAbstraction took 19295.43ms. Allocated memory was 419.4MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 371.2MB in the beginning and 967.0MB in the end (delta: -595.8MB). Peak memory consumption was 457.8MB. Max. memory is 16.0GB. [2023-08-26 18:15:35,752 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 419.4MB. Free memory is still 395.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 412.97ms. Allocated memory is still 419.4MB. Free memory was 394.6MB in the beginning and 370.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.57ms. Allocated memory is still 419.4MB. Free memory was 370.2MB in the beginning and 367.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.39ms. Allocated memory is still 419.4MB. Free memory was 367.8MB in the beginning and 365.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 509.50ms. Allocated memory is still 419.4MB. Free memory was 365.7MB in the beginning and 372.4MB in the end (delta: -6.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 19295.43ms. Allocated memory was 419.4MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 371.2MB in the beginning and 967.0MB in the end (delta: -595.8MB). Peak memory consumption was 457.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 152 PlacesBefore, 51 PlacesAfterwards, 142 TransitionsBefore, 39 TransitionsAfterwards, 3698 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 154 TotalNumberOfCompositions, 11127 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4975, independent: 4719, independent conditional: 0, independent unconditional: 4719, dependent: 256, dependent conditional: 0, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2094, independent: 2044, independent conditional: 0, independent unconditional: 2044, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4975, independent: 2675, independent conditional: 0, independent unconditional: 2675, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 2094, unknown conditional: 0, unknown unconditional: 2094] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t937, ((void *)0), P0, ((void *)0))=-1, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t938, ((void *)0), P1, ((void *)0))=0, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t939, ((void *)0), P2, ((void *)0))=1, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t940, ((void *)0), P3, ((void *)0))=2, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x 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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y 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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 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}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = 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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 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}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0: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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix036.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0: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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 876]: 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: 880]: 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: 874]: 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, 183 locations, 15 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: 19.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 692 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 692 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2299 IncrementalHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 26 mSDtfsCounter, 2299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=677occurred in iteration=11, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 2545 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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! [2023-08-26 18:15:35,770 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...