/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 -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/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:07:48,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:07:48,340 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 12:07:48,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:07:48,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:07:48,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:07:48,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:07:48,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:07:48,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:07:48,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:07:48,358 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:07:48,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:07:48,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:07:48,359 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:07:48,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:07:48,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:07:48,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:07:48,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:07:48,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:07:48,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:07:48,360 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:07:48,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:07:48,361 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:07:48,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:07:48,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:07:48,361 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:07:48,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:07:48,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:07:48,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:07:48,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:07:48,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:07:48,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:07:48,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:07:48,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:07:48,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:07:48,363 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.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 12:07:48,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:07:48,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:07:48,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:07:48,608 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:07:48,609 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:07:48,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-08-26 12:07:49,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:07:49,791 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:07:49,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-08-26 12:07:49,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727db45f4/b36f997750184d94956fd8036d62605c/FLAG850c90a95 [2023-08-26 12:07:49,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727db45f4/b36f997750184d94956fd8036d62605c [2023-08-26 12:07:49,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:07:49,814 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:07:49,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:07:49,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:07:49,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:07:49,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:07:49" (1/1) ... [2023-08-26 12:07:49,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49befbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:49, skipping insertion in model container [2023-08-26 12:07:49,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:07:49" (1/1) ... [2023-08-26 12:07:49,841 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:07:50,131 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:07:50,138 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:07:50,149 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:07:50,150 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:07:50,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:07:50,194 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:07:50,194 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:07:50,198 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:07:50,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50 WrapperNode [2023-08-26 12:07:50,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:07:50,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:07:50,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:07:50,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:07:50,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (1/1) ... [2023-08-26 12:07:50,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (1/1) ... [2023-08-26 12:07:50,235 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 166 [2023-08-26 12:07:50,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:07:50,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:07:50,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:07:50,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:07:50,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (1/1) ... [2023-08-26 12:07:50,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (1/1) ... [2023-08-26 12:07:50,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (1/1) ... [2023-08-26 12:07:50,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (1/1) ... [2023-08-26 12:07:50,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (1/1) ... [2023-08-26 12:07:50,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (1/1) ... [2023-08-26 12:07:50,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (1/1) ... [2023-08-26 12:07:50,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (1/1) ... [2023-08-26 12:07:50,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:07:50,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:07:50,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:07:50,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:07:50,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (1/1) ... [2023-08-26 12:07:50,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:07:50,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:07:50,298 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 12:07:50,299 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 12:07:50,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:07:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:07:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:07:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:07:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:07:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:07:50,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:07:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:07:50,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:07:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:07:50,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:07:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 12:07:50,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 12:07:50,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:07:50,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:07:50,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:07:50,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:07:50,323 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 12:07:50,429 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:07:50,430 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:07:50,720 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:07:50,822 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:07:50,822 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:07:50,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:07:50 BoogieIcfgContainer [2023-08-26 12:07:50,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:07:50,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:07:50,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:07:50,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:07:50,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:07:49" (1/3) ... [2023-08-26 12:07:50,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3253489e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:07:50, skipping insertion in model container [2023-08-26 12:07:50,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:07:50" (2/3) ... [2023-08-26 12:07:50,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3253489e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:07:50, skipping insertion in model container [2023-08-26 12:07:50,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:07:50" (3/3) ... [2023-08-26 12:07:50,831 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2023-08-26 12:07:50,842 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:07:50,842 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 12:07:50,844 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:07:50,892 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:07:50,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 300 flow [2023-08-26 12:07:50,974 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-26 12:07:50,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:50,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 12:07:50,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 140 transitions, 300 flow [2023-08-26 12:07:50,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 136 transitions, 284 flow [2023-08-26 12:07:50,986 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:07:50,994 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-26 12:07:50,997 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-26 12:07:50,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 136 transitions, 284 flow [2023-08-26 12:07:51,033 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-26 12:07:51,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:51,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 12:07:51,037 INFO L119 LiptonReduction]: Number of co-enabled transitions 3452 [2023-08-26 12:07:54,627 INFO L134 LiptonReduction]: Checked pairs total: 10171 [2023-08-26 12:07:54,627 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-26 12:07:54,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:07:54,639 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;@5d8fb11f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:07:54,639 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 12:07:54,640 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:07:54,640 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:07:54,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:54,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:54,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:07:54,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:54,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:54,643 INFO L85 PathProgramCache]: Analyzing trace with hash 621, now seen corresponding path program 1 times [2023-08-26 12:07:54,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:54,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546904033] [2023-08-26 12:07:54,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:54,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:54,714 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 12:07:54,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:54,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546904033] [2023-08-26 12:07:54,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546904033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:54,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:54,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:07:54,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305759318] [2023-08-26 12:07:54,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:54,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:07:54,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:54,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:07:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:07:54,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-26 12:07:54,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 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 12:07:54,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:54,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-26 12:07:54,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:55,592 INFO L124 PetriNetUnfolderBase]: 6949/9498 cut-off events. [2023-08-26 12:07:55,593 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-08-26 12:07:55,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19112 conditions, 9498 events. 6949/9498 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 49153 event pairs, 6949 based on Foata normal form. 320/8550 useless extension candidates. Maximal degree in co-relation 19100. Up to 9399 conditions per place. [2023-08-26 12:07:55,634 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-26 12:07:55,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-26 12:07:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:07:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:07:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 284 transitions. [2023-08-26 12:07:55,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2023-08-26 12:07:55,646 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 284 transitions. [2023-08-26 12:07:55,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 284 transitions. [2023-08-26 12:07:55,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:55,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 284 transitions. [2023-08-26 12:07:55,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 142.0) internal successors, (284), 2 states have internal predecessors, (284), 0 states have call successors, (0), 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 12:07:55,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 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 12:07:55,656 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 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 12:07:55,657 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 284 transitions. [2023-08-26 12:07:55,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-26 12:07:55,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:07:55,661 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-26 12:07:55,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-26 12:07:55,664 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-26 12:07:55,665 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-26 12:07:55,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 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 12:07:55,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:55,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:07:55,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:07:55,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:55,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:55,666 INFO L85 PathProgramCache]: Analyzing trace with hash 588388494, now seen corresponding path program 1 times [2023-08-26 12:07:55,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:55,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373803692] [2023-08-26 12:07:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:55,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:55,895 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 12:07:55,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373803692] [2023-08-26 12:07:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373803692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:55,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:07:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431313197] [2023-08-26 12:07:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:55,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:07:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:55,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:07:55,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:07:55,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 280 [2023-08-26 12:07:55,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:07:55,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:55,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 280 [2023-08-26 12:07:55,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:56,492 INFO L124 PetriNetUnfolderBase]: 5463/7582 cut-off events. [2023-08-26 12:07:56,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:07:56,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15179 conditions, 7582 events. 5463/7582 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 38577 event pairs, 2045 based on Foata normal form. 0/7041 useless extension candidates. Maximal degree in co-relation 15176. Up to 5923 conditions per place. [2023-08-26 12:07:56,517 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 39 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2023-08-26 12:07:56,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 200 flow [2023-08-26 12:07:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:07:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:07:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-26 12:07:56,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2023-08-26 12:07:56,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-26 12:07:56,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-26 12:07:56,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:56,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-26 12:07:56,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 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 12:07:56,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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 12:07:56,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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 12:07:56,524 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 415 transitions. [2023-08-26 12:07:56,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 200 flow [2023-08-26 12:07:56,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:07:56,527 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 68 flow [2023-08-26 12:07:56,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-26 12:07:56,528 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-26 12:07:56,528 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 68 flow [2023-08-26 12:07:56,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:07:56,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:56,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:56,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:07:56,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:56,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:56,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1566875919, now seen corresponding path program 1 times [2023-08-26 12:07:56,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:56,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40750571] [2023-08-26 12:07:56,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:56,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:56,886 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 12:07:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:56,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40750571] [2023-08-26 12:07:56,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40750571] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:56,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:56,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:07:56,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866319797] [2023-08-26 12:07:56,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:56,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:07:56,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:56,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:07:56,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:07:56,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 280 [2023-08-26 12:07:56,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 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 12:07:56,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:56,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 280 [2023-08-26 12:07:56,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:07:58,214 INFO L124 PetriNetUnfolderBase]: 13353/18049 cut-off events. [2023-08-26 12:07:58,215 INFO L125 PetriNetUnfolderBase]: For 923/923 co-relation queries the response was YES. [2023-08-26 12:07:58,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37384 conditions, 18049 events. 13353/18049 cut-off events. For 923/923 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 88741 event pairs, 2114 based on Foata normal form. 747/18796 useless extension candidates. Maximal degree in co-relation 37380. Up to 13062 conditions per place. [2023-08-26 12:07:58,279 INFO L140 encePairwiseOnDemand]: 267/280 looper letters, 48 selfloop transitions, 13 changer transitions 42/103 dead transitions. [2023-08-26 12:07:58,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 103 transitions, 438 flow [2023-08-26 12:07:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:07:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:07:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2023-08-26 12:07:58,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4362244897959184 [2023-08-26 12:07:58,281 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2023-08-26 12:07:58,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2023-08-26 12:07:58,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:07:58,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2023-08-26 12:07:58,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 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 12:07:58,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:07:58,286 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:07:58,286 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 68 flow. Second operand 7 states and 855 transitions. [2023-08-26 12:07:58,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 103 transitions, 438 flow [2023-08-26 12:07:58,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 103 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:07:58,288 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 168 flow [2023-08-26 12:07:58,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-26 12:07:58,289 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-26 12:07:58,289 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 168 flow [2023-08-26 12:07:58,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 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 12:07:58,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:07:58,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:07:58,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:07:58,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:07:58,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:07:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1328463062, now seen corresponding path program 1 times [2023-08-26 12:07:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:07:58,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093641070] [2023-08-26 12:07:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:07:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:07:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:07:58,749 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 12:07:58,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:07:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093641070] [2023-08-26 12:07:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093641070] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:07:58,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:07:58,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:07:58,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960597636] [2023-08-26 12:07:58,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:07:58,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:07:58,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:07:58,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:07:58,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:07:58,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 280 [2023-08-26 12:07:58,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 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 12:07:58,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:07:58,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 280 [2023-08-26 12:07:58,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:00,172 INFO L124 PetriNetUnfolderBase]: 12960/17573 cut-off events. [2023-08-26 12:08:00,172 INFO L125 PetriNetUnfolderBase]: For 14965/14965 co-relation queries the response was YES. [2023-08-26 12:08:00,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55255 conditions, 17573 events. 12960/17573 cut-off events. For 14965/14965 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 87572 event pairs, 4143 based on Foata normal form. 679/18252 useless extension candidates. Maximal degree in co-relation 55246. Up to 13655 conditions per place. [2023-08-26 12:08:00,261 INFO L140 encePairwiseOnDemand]: 266/280 looper letters, 61 selfloop transitions, 27 changer transitions 51/139 dead transitions. [2023-08-26 12:08:00,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 139 transitions, 866 flow [2023-08-26 12:08:00,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:08:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:08:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2023-08-26 12:08:00,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403061224489796 [2023-08-26 12:08:00,263 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 863 transitions. [2023-08-26 12:08:00,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 863 transitions. [2023-08-26 12:08:00,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:00,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 863 transitions. [2023-08-26 12:08:00,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 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 12:08:00,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:00,269 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:00,269 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 168 flow. Second operand 7 states and 863 transitions. [2023-08-26 12:08:00,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 139 transitions, 866 flow [2023-08-26 12:08:00,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 139 transitions, 858 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 12:08:00,385 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 426 flow [2023-08-26 12:08:00,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=426, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2023-08-26 12:08:00,397 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-26 12:08:00,397 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 426 flow [2023-08-26 12:08:00,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 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 12:08:00,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:00,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:08:00,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:08:00,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:00,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash -289410965, now seen corresponding path program 1 times [2023-08-26 12:08:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:00,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529721943] [2023-08-26 12:08:00,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:00,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:01,063 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 12:08:01,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:01,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529721943] [2023-08-26 12:08:01,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529721943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:01,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:01,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:08:01,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496887041] [2023-08-26 12:08:01,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:01,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:08:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:01,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:08:01,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:08:01,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 280 [2023-08-26 12:08:01,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 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 12:08:01,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:01,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 280 [2023-08-26 12:08:01,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:02,721 INFO L124 PetriNetUnfolderBase]: 13741/18586 cut-off events. [2023-08-26 12:08:02,721 INFO L125 PetriNetUnfolderBase]: For 42942/42942 co-relation queries the response was YES. [2023-08-26 12:08:02,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75019 conditions, 18586 events. 13741/18586 cut-off events. For 42942/42942 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 92639 event pairs, 3893 based on Foata normal form. 698/19284 useless extension candidates. Maximal degree in co-relation 75006. Up to 13432 conditions per place. [2023-08-26 12:08:02,815 INFO L140 encePairwiseOnDemand]: 266/280 looper letters, 75 selfloop transitions, 35 changer transitions 53/163 dead transitions. [2023-08-26 12:08:02,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 163 transitions, 1374 flow [2023-08-26 12:08:02,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:08:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:08:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2023-08-26 12:08:02,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4433673469387755 [2023-08-26 12:08:02,817 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2023-08-26 12:08:02,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2023-08-26 12:08:02,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:02,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2023-08-26 12:08:02,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 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 12:08:02,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:02,822 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:02,822 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 426 flow. Second operand 7 states and 869 transitions. [2023-08-26 12:08:02,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 163 transitions, 1374 flow [2023-08-26 12:08:02,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 163 transitions, 1370 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-26 12:08:02,882 INFO L231 Difference]: Finished difference. Result has 65 places, 75 transitions, 751 flow [2023-08-26 12:08:02,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=751, PETRI_PLACES=65, PETRI_TRANSITIONS=75} [2023-08-26 12:08:02,884 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2023-08-26 12:08:02,884 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 75 transitions, 751 flow [2023-08-26 12:08:02,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 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 12:08:02,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:02,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:08:02,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:08:02,885 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:02,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1671510381, now seen corresponding path program 2 times [2023-08-26 12:08:02,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:02,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069376362] [2023-08-26 12:08:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:03,241 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 12:08:03,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:03,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069376362] [2023-08-26 12:08:03,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069376362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:03,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:03,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:08:03,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506040024] [2023-08-26 12:08:03,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:03,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:08:03,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:03,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:08:03,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:08:03,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 280 [2023-08-26 12:08:03,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 75 transitions, 751 flow. Second operand has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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 12:08:03,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:03,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 280 [2023-08-26 12:08:03,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:04,913 INFO L124 PetriNetUnfolderBase]: 12287/16904 cut-off events. [2023-08-26 12:08:04,913 INFO L125 PetriNetUnfolderBase]: For 81247/83244 co-relation queries the response was YES. [2023-08-26 12:08:04,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88114 conditions, 16904 events. 12287/16904 cut-off events. For 81247/83244 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 89769 event pairs, 4226 based on Foata normal form. 2010/18650 useless extension candidates. Maximal degree in co-relation 88095. Up to 12181 conditions per place. [2023-08-26 12:08:05,053 INFO L140 encePairwiseOnDemand]: 270/280 looper letters, 95 selfloop transitions, 46 changer transitions 44/199 dead transitions. [2023-08-26 12:08:05,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 199 transitions, 2199 flow [2023-08-26 12:08:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:08:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:08:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1026 transitions. [2023-08-26 12:08:05,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45803571428571427 [2023-08-26 12:08:05,056 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1026 transitions. [2023-08-26 12:08:05,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1026 transitions. [2023-08-26 12:08:05,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:05,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1026 transitions. [2023-08-26 12:08:05,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.25) internal successors, (1026), 8 states have internal predecessors, (1026), 0 states have call successors, (0), 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 12:08:05,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 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 12:08:05,061 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 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 12:08:05,061 INFO L175 Difference]: Start difference. First operand has 65 places, 75 transitions, 751 flow. Second operand 8 states and 1026 transitions. [2023-08-26 12:08:05,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 199 transitions, 2199 flow [2023-08-26 12:08:05,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 199 transitions, 2167 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-26 12:08:05,141 INFO L231 Difference]: Finished difference. Result has 73 places, 109 transitions, 1334 flow [2023-08-26 12:08:05,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1334, PETRI_PLACES=73, PETRI_TRANSITIONS=109} [2023-08-26 12:08:05,142 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2023-08-26 12:08:05,142 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 109 transitions, 1334 flow [2023-08-26 12:08:05,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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 12:08:05,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:05,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:08:05,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:08:05,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:05,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1766534061, now seen corresponding path program 3 times [2023-08-26 12:08:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:05,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676415092] [2023-08-26 12:08:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:05,637 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 12:08:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:05,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676415092] [2023-08-26 12:08:05,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676415092] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:05,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:05,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:08:05,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333380154] [2023-08-26 12:08:05,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:05,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:08:05,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:05,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:08:05,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:08:05,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 280 [2023-08-26 12:08:05,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 109 transitions, 1334 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 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 12:08:05,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:05,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 280 [2023-08-26 12:08:05,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:07,668 INFO L124 PetriNetUnfolderBase]: 15064/20345 cut-off events. [2023-08-26 12:08:07,668 INFO L125 PetriNetUnfolderBase]: For 135423/135423 co-relation queries the response was YES. [2023-08-26 12:08:07,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116269 conditions, 20345 events. 15064/20345 cut-off events. For 135423/135423 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 102113 event pairs, 4248 based on Foata normal form. 661/21006 useless extension candidates. Maximal degree in co-relation 116245. Up to 14864 conditions per place. [2023-08-26 12:08:07,832 INFO L140 encePairwiseOnDemand]: 268/280 looper letters, 132 selfloop transitions, 76 changer transitions 59/267 dead transitions. [2023-08-26 12:08:07,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 267 transitions, 3484 flow [2023-08-26 12:08:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:08:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:08:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1010 transitions. [2023-08-26 12:08:07,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2023-08-26 12:08:07,835 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1010 transitions. [2023-08-26 12:08:07,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1010 transitions. [2023-08-26 12:08:07,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:07,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1010 transitions. [2023-08-26 12:08:07,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.25) internal successors, (1010), 8 states have internal predecessors, (1010), 0 states have call successors, (0), 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 12:08:07,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 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 12:08:07,840 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 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 12:08:07,840 INFO L175 Difference]: Start difference. First operand has 73 places, 109 transitions, 1334 flow. Second operand 8 states and 1010 transitions. [2023-08-26 12:08:07,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 267 transitions, 3484 flow [2023-08-26 12:08:08,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 267 transitions, 3462 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-26 12:08:08,034 INFO L231 Difference]: Finished difference. Result has 79 places, 149 transitions, 2199 flow [2023-08-26 12:08:08,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2199, PETRI_PLACES=79, PETRI_TRANSITIONS=149} [2023-08-26 12:08:08,035 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2023-08-26 12:08:08,035 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 149 transitions, 2199 flow [2023-08-26 12:08:08,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 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 12:08:08,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:08,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:08:08,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:08:08,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:08,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1026964156, now seen corresponding path program 1 times [2023-08-26 12:08:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572302001] [2023-08-26 12:08:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:08,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:08,514 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 12:08:08,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572302001] [2023-08-26 12:08:08,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572302001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:08,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:08,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:08:08,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348631535] [2023-08-26 12:08:08,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:08,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:08:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:08:08,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:08:08,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-26 12:08:08,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 149 transitions, 2199 flow. Second operand has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 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 12:08:08,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:08,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-26 12:08:08,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:10,484 INFO L124 PetriNetUnfolderBase]: 12533/17271 cut-off events. [2023-08-26 12:08:10,484 INFO L125 PetriNetUnfolderBase]: For 174974/176380 co-relation queries the response was YES. [2023-08-26 12:08:10,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119265 conditions, 17271 events. 12533/17271 cut-off events. For 174974/176380 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 91675 event pairs, 3443 based on Foata normal form. 1143/18168 useless extension candidates. Maximal degree in co-relation 119238. Up to 11918 conditions per place. [2023-08-26 12:08:10,600 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 157 selfloop transitions, 44 changer transitions 37/258 dead transitions. [2023-08-26 12:08:10,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 258 transitions, 4089 flow [2023-08-26 12:08:10,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:08:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:08:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 904 transitions. [2023-08-26 12:08:10,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46122448979591835 [2023-08-26 12:08:10,603 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 904 transitions. [2023-08-26 12:08:10,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 904 transitions. [2023-08-26 12:08:10,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:10,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 904 transitions. [2023-08-26 12:08:10,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.14285714285714) internal successors, (904), 7 states have internal predecessors, (904), 0 states have call successors, (0), 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 12:08:10,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:10,607 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:10,607 INFO L175 Difference]: Start difference. First operand has 79 places, 149 transitions, 2199 flow. Second operand 7 states and 904 transitions. [2023-08-26 12:08:10,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 258 transitions, 4089 flow [2023-08-26 12:08:10,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 258 transitions, 3919 flow, removed 79 selfloop flow, removed 2 redundant places. [2023-08-26 12:08:10,843 INFO L231 Difference]: Finished difference. Result has 84 places, 168 transitions, 2583 flow [2023-08-26 12:08:10,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=2081, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2583, PETRI_PLACES=84, PETRI_TRANSITIONS=168} [2023-08-26 12:08:10,844 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2023-08-26 12:08:10,844 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 168 transitions, 2583 flow [2023-08-26 12:08:10,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 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 12:08:10,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:10,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:08:10,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:08:10,845 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:10,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:10,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1029287854, now seen corresponding path program 1 times [2023-08-26 12:08:10,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:10,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418114544] [2023-08-26 12:08:10,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:10,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:11,180 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 12:08:11,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:11,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418114544] [2023-08-26 12:08:11,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418114544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:11,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:11,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:08:11,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737984379] [2023-08-26 12:08:11,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:11,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:08:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:11,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:08:11,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:08:11,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 280 [2023-08-26 12:08:11,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 168 transitions, 2583 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 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 12:08:11,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:11,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 280 [2023-08-26 12:08:11,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:14,051 INFO L124 PetriNetUnfolderBase]: 16870/22743 cut-off events. [2023-08-26 12:08:14,052 INFO L125 PetriNetUnfolderBase]: For 262910/262910 co-relation queries the response was YES. [2023-08-26 12:08:14,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161805 conditions, 22743 events. 16870/22743 cut-off events. For 262910/262910 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 116148 event pairs, 4677 based on Foata normal form. 377/23120 useless extension candidates. Maximal degree in co-relation 161774. Up to 17782 conditions per place. [2023-08-26 12:08:14,269 INFO L140 encePairwiseOnDemand]: 268/280 looper letters, 234 selfloop transitions, 141 changer transitions 53/428 dead transitions. [2023-08-26 12:08:14,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 428 transitions, 7238 flow [2023-08-26 12:08:14,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:08:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:08:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1238 transitions. [2023-08-26 12:08:14,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421428571428571 [2023-08-26 12:08:14,272 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1238 transitions. [2023-08-26 12:08:14,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1238 transitions. [2023-08-26 12:08:14,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:14,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1238 transitions. [2023-08-26 12:08:14,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.8) internal successors, (1238), 10 states have internal predecessors, (1238), 0 states have call successors, (0), 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 12:08:14,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 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 12:08:14,278 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 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 12:08:14,278 INFO L175 Difference]: Start difference. First operand has 84 places, 168 transitions, 2583 flow. Second operand 10 states and 1238 transitions. [2023-08-26 12:08:14,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 428 transitions, 7238 flow [2023-08-26 12:08:14,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 428 transitions, 7177 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-26 12:08:14,756 INFO L231 Difference]: Finished difference. Result has 93 places, 281 transitions, 5142 flow [2023-08-26 12:08:14,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5142, PETRI_PLACES=93, PETRI_TRANSITIONS=281} [2023-08-26 12:08:14,757 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 41 predicate places. [2023-08-26 12:08:14,757 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 281 transitions, 5142 flow [2023-08-26 12:08:14,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 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 12:08:14,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:14,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:08:14,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:08:14,758 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:14,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1025511124, now seen corresponding path program 2 times [2023-08-26 12:08:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:14,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546111229] [2023-08-26 12:08:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:14,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:15,139 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 12:08:15,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:15,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546111229] [2023-08-26 12:08:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546111229] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:15,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:15,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:08:15,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445036315] [2023-08-26 12:08:15,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:15,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:08:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:15,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:08:15,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:08:15,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 280 [2023-08-26 12:08:15,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 281 transitions, 5142 flow. Second operand has 7 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 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 12:08:15,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:15,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 280 [2023-08-26 12:08:15,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:18,274 INFO L124 PetriNetUnfolderBase]: 14657/20251 cut-off events. [2023-08-26 12:08:18,275 INFO L125 PetriNetUnfolderBase]: For 311898/314383 co-relation queries the response was YES. [2023-08-26 12:08:18,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163558 conditions, 20251 events. 14657/20251 cut-off events. For 311898/314383 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 110604 event pairs, 3952 based on Foata normal form. 1744/21896 useless extension candidates. Maximal degree in co-relation 163523. Up to 14030 conditions per place. [2023-08-26 12:08:18,436 INFO L140 encePairwiseOnDemand]: 270/280 looper letters, 247 selfloop transitions, 101 changer transitions 27/398 dead transitions. [2023-08-26 12:08:18,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 398 transitions, 7611 flow [2023-08-26 12:08:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:08:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:08:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 892 transitions. [2023-08-26 12:08:18,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45510204081632655 [2023-08-26 12:08:18,438 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 892 transitions. [2023-08-26 12:08:18,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 892 transitions. [2023-08-26 12:08:18,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:18,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 892 transitions. [2023-08-26 12:08:18,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.42857142857143) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 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 12:08:18,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:18,443 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:18,443 INFO L175 Difference]: Start difference. First operand has 93 places, 281 transitions, 5142 flow. Second operand 7 states and 892 transitions. [2023-08-26 12:08:18,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 398 transitions, 7611 flow [2023-08-26 12:08:18,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 398 transitions, 7420 flow, removed 95 selfloop flow, removed 4 redundant places. [2023-08-26 12:08:18,955 INFO L231 Difference]: Finished difference. Result has 96 places, 315 transitions, 6085 flow [2023-08-26 12:08:18,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=5021, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6085, PETRI_PLACES=96, PETRI_TRANSITIONS=315} [2023-08-26 12:08:18,956 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 44 predicate places. [2023-08-26 12:08:18,956 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 315 transitions, 6085 flow [2023-08-26 12:08:18,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 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 12:08:18,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:18,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:08:18,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:08:18,957 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:18,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1393519756, now seen corresponding path program 1 times [2023-08-26 12:08:18,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:18,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132470622] [2023-08-26 12:08:18,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:18,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:19,049 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 12:08:19,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:19,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132470622] [2023-08-26 12:08:19,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132470622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:19,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:19,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:08:19,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806019257] [2023-08-26 12:08:19,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:19,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:08:19,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:19,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:08:19,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:08:19,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 280 [2023-08-26 12:08:19,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 315 transitions, 6085 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 12:08:19,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:19,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 280 [2023-08-26 12:08:19,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:20,734 INFO L124 PetriNetUnfolderBase]: 7884/11057 cut-off events. [2023-08-26 12:08:20,734 INFO L125 PetriNetUnfolderBase]: For 271557/278243 co-relation queries the response was YES. [2023-08-26 12:08:20,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97621 conditions, 11057 events. 7884/11057 cut-off events. For 271557/278243 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 59397 event pairs, 1893 based on Foata normal form. 1696/12381 useless extension candidates. Maximal degree in co-relation 97585. Up to 8076 conditions per place. [2023-08-26 12:08:20,817 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 292 selfloop transitions, 5 changer transitions 0/326 dead transitions. [2023-08-26 12:08:20,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 326 transitions, 6759 flow [2023-08-26 12:08:20,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:08:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:08:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-26 12:08:20,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726190476190476 [2023-08-26 12:08:20,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-26 12:08:20,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-26 12:08:20,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:20,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-26 12:08:20,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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 12:08:20,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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 12:08:20,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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 12:08:20,821 INFO L175 Difference]: Start difference. First operand has 96 places, 315 transitions, 6085 flow. Second operand 3 states and 397 transitions. [2023-08-26 12:08:20,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 326 transitions, 6759 flow [2023-08-26 12:08:20,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 326 transitions, 6634 flow, removed 32 selfloop flow, removed 4 redundant places. [2023-08-26 12:08:20,978 INFO L231 Difference]: Finished difference. Result has 93 places, 246 transitions, 4534 flow [2023-08-26 12:08:20,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4534, PETRI_PLACES=93, PETRI_TRANSITIONS=246} [2023-08-26 12:08:20,979 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 41 predicate places. [2023-08-26 12:08:20,979 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 246 transitions, 4534 flow [2023-08-26 12:08:20,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 12:08:20,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:20,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:08:20,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:08:20,979 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:20,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:20,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1756425485, now seen corresponding path program 1 times [2023-08-26 12:08:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:20,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838568753] [2023-08-26 12:08:20,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:20,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:21,071 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 12:08:21,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:21,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838568753] [2023-08-26 12:08:21,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838568753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:21,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:21,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:08:21,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673675605] [2023-08-26 12:08:21,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:21,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:08:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:21,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:08:21,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:08:21,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 280 [2023-08-26 12:08:21,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 246 transitions, 4534 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 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 12:08:21,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:21,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 280 [2023-08-26 12:08:21,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:21,937 INFO L124 PetriNetUnfolderBase]: 3864/5680 cut-off events. [2023-08-26 12:08:21,937 INFO L125 PetriNetUnfolderBase]: For 129957/132445 co-relation queries the response was YES. [2023-08-26 12:08:21,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50042 conditions, 5680 events. 3864/5680 cut-off events. For 129957/132445 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 29412 event pairs, 553 based on Foata normal form. 839/6362 useless extension candidates. Maximal degree in co-relation 50007. Up to 3344 conditions per place. [2023-08-26 12:08:21,977 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 304 selfloop transitions, 9 changer transitions 0/342 dead transitions. [2023-08-26 12:08:21,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 342 transitions, 6882 flow [2023-08-26 12:08:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:08:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:08:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2023-08-26 12:08:21,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47410714285714284 [2023-08-26 12:08:21,979 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2023-08-26 12:08:21,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2023-08-26 12:08:21,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:21,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2023-08-26 12:08:21,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 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 12:08:21,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 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 12:08:21,982 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 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 12:08:21,982 INFO L175 Difference]: Start difference. First operand has 93 places, 246 transitions, 4534 flow. Second operand 4 states and 531 transitions. [2023-08-26 12:08:21,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 342 transitions, 6882 flow [2023-08-26 12:08:22,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 342 transitions, 6850 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:08:22,075 INFO L231 Difference]: Finished difference. Result has 95 places, 223 transitions, 4008 flow [2023-08-26 12:08:22,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=3956, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4008, PETRI_PLACES=95, PETRI_TRANSITIONS=223} [2023-08-26 12:08:22,076 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2023-08-26 12:08:22,076 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 223 transitions, 4008 flow [2023-08-26 12:08:22,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 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 12:08:22,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:22,076 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 12:08:22,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:08:22,076 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:22,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:22,077 INFO L85 PathProgramCache]: Analyzing trace with hash -210741203, now seen corresponding path program 1 times [2023-08-26 12:08:22,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:22,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640879070] [2023-08-26 12:08:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:22,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:22,283 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 12:08:22,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:22,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640879070] [2023-08-26 12:08:22,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640879070] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:22,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:22,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:08:22,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381364765] [2023-08-26 12:08:22,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:22,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:08:22,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:22,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:08:22,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:08:22,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 280 [2023-08-26 12:08:22,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 223 transitions, 4008 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 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 12:08:22,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:22,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 280 [2023-08-26 12:08:22,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:23,496 INFO L124 PetriNetUnfolderBase]: 6395/9470 cut-off events. [2023-08-26 12:08:23,496 INFO L125 PetriNetUnfolderBase]: For 155745/155745 co-relation queries the response was YES. [2023-08-26 12:08:23,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79218 conditions, 9470 events. 6395/9470 cut-off events. For 155745/155745 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 50549 event pairs, 837 based on Foata normal form. 143/9613 useless extension candidates. Maximal degree in co-relation 79183. Up to 4962 conditions per place. [2023-08-26 12:08:23,567 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 233 selfloop transitions, 19 changer transitions 135/387 dead transitions. [2023-08-26 12:08:23,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 387 transitions, 7502 flow [2023-08-26 12:08:23,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:08:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:08:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2023-08-26 12:08:23,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2023-08-26 12:08:23,569 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 732 transitions. [2023-08-26 12:08:23,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 732 transitions. [2023-08-26 12:08:23,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:23,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 732 transitions. [2023-08-26 12:08:23,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 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 12:08:23,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 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 12:08:23,672 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 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 12:08:23,672 INFO L175 Difference]: Start difference. First operand has 95 places, 223 transitions, 4008 flow. Second operand 6 states and 732 transitions. [2023-08-26 12:08:23,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 387 transitions, 7502 flow [2023-08-26 12:08:23,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 387 transitions, 7468 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-26 12:08:23,828 INFO L231 Difference]: Finished difference. Result has 102 places, 187 transitions, 3299 flow [2023-08-26 12:08:23,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=3990, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3299, PETRI_PLACES=102, PETRI_TRANSITIONS=187} [2023-08-26 12:08:23,829 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 50 predicate places. [2023-08-26 12:08:23,829 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 187 transitions, 3299 flow [2023-08-26 12:08:23,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 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 12:08:23,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:23,829 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 12:08:23,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:08:23,829 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:23,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2115506593, now seen corresponding path program 1 times [2023-08-26 12:08:23,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:23,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781655220] [2023-08-26 12:08:23,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:23,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:24,022 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 12:08:24,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:24,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781655220] [2023-08-26 12:08:24,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781655220] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:24,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:24,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:08:24,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834556741] [2023-08-26 12:08:24,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:24,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:08:24,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:24,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:08:24,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:08:24,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 280 [2023-08-26 12:08:24,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 187 transitions, 3299 flow. Second operand has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 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 12:08:24,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:24,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 280 [2023-08-26 12:08:24,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:25,685 INFO L124 PetriNetUnfolderBase]: 8105/12172 cut-off events. [2023-08-26 12:08:25,685 INFO L125 PetriNetUnfolderBase]: For 232784/232784 co-relation queries the response was YES. [2023-08-26 12:08:25,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102891 conditions, 12172 events. 8105/12172 cut-off events. For 232784/232784 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 70557 event pairs, 939 based on Foata normal form. 124/12296 useless extension candidates. Maximal degree in co-relation 102852. Up to 6477 conditions per place. [2023-08-26 12:08:25,759 INFO L140 encePairwiseOnDemand]: 266/280 looper letters, 228 selfloop transitions, 64 changer transitions 159/451 dead transitions. [2023-08-26 12:08:25,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 451 transitions, 8378 flow [2023-08-26 12:08:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:08:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:08:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 858 transitions. [2023-08-26 12:08:25,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377551020408163 [2023-08-26 12:08:25,761 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 858 transitions. [2023-08-26 12:08:25,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 858 transitions. [2023-08-26 12:08:25,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:25,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 858 transitions. [2023-08-26 12:08:25,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 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 12:08:25,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:25,764 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:25,764 INFO L175 Difference]: Start difference. First operand has 102 places, 187 transitions, 3299 flow. Second operand 7 states and 858 transitions. [2023-08-26 12:08:25,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 451 transitions, 8378 flow [2023-08-26 12:08:26,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 451 transitions, 8342 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-26 12:08:26,039 INFO L231 Difference]: Finished difference. Result has 109 places, 200 transitions, 3767 flow [2023-08-26 12:08:26,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=3285, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3767, PETRI_PLACES=109, PETRI_TRANSITIONS=200} [2023-08-26 12:08:26,040 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2023-08-26 12:08:26,040 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 200 transitions, 3767 flow [2023-08-26 12:08:26,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 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 12:08:26,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:26,040 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 12:08:26,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:08:26,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:26,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:26,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1755461931, now seen corresponding path program 1 times [2023-08-26 12:08:26,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:26,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003319658] [2023-08-26 12:08:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:26,168 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 12:08:26,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:26,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003319658] [2023-08-26 12:08:26,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003319658] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:26,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:26,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:08:26,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052342321] [2023-08-26 12:08:26,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:26,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:08:26,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:26,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:08:26,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:08:26,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 280 [2023-08-26 12:08:26,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 200 transitions, 3767 flow. Second operand has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 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 12:08:26,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:26,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 280 [2023-08-26 12:08:26,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:27,148 INFO L124 PetriNetUnfolderBase]: 4514/6828 cut-off events. [2023-08-26 12:08:27,148 INFO L125 PetriNetUnfolderBase]: For 191131/193015 co-relation queries the response was YES. [2023-08-26 12:08:27,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62379 conditions, 6828 events. 4514/6828 cut-off events. For 191131/193015 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 39698 event pairs, 408 based on Foata normal form. 718/7363 useless extension candidates. Maximal degree in co-relation 62336. Up to 3902 conditions per place. [2023-08-26 12:08:27,192 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 250 selfloop transitions, 13 changer transitions 32/321 dead transitions. [2023-08-26 12:08:27,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 321 transitions, 6754 flow [2023-08-26 12:08:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:08:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:08:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-26 12:08:27,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735714285714286 [2023-08-26 12:08:27,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-26 12:08:27,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-26 12:08:27,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:27,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-26 12:08:27,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 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 12:08:27,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 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 12:08:27,196 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 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 12:08:27,196 INFO L175 Difference]: Start difference. First operand has 109 places, 200 transitions, 3767 flow. Second operand 5 states and 663 transitions. [2023-08-26 12:08:27,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 321 transitions, 6754 flow [2023-08-26 12:08:27,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 321 transitions, 6546 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-26 12:08:27,560 INFO L231 Difference]: Finished difference. Result has 108 places, 182 transitions, 3307 flow [2023-08-26 12:08:27,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=3471, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3307, PETRI_PLACES=108, PETRI_TRANSITIONS=182} [2023-08-26 12:08:27,561 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 56 predicate places. [2023-08-26 12:08:27,561 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 182 transitions, 3307 flow [2023-08-26 12:08:27,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 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 12:08:27,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:27,561 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 12:08:27,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:08:27,561 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:27,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:27,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1418712282, now seen corresponding path program 1 times [2023-08-26 12:08:27,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:27,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236944387] [2023-08-26 12:08:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:27,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:28,369 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 12:08:28,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:28,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236944387] [2023-08-26 12:08:28,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236944387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:28,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:28,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:08:28,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62291261] [2023-08-26 12:08:28,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:28,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:08:28,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:28,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:08:28,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:08:28,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 280 [2023-08-26 12:08:28,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 182 transitions, 3307 flow. Second operand has 10 states, 10 states have (on average 104.4) internal successors, (1044), 10 states have internal predecessors, (1044), 0 states have call successors, (0), 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 12:08:28,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:28,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 280 [2023-08-26 12:08:28,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:30,434 INFO L124 PetriNetUnfolderBase]: 7960/12243 cut-off events. [2023-08-26 12:08:30,434 INFO L125 PetriNetUnfolderBase]: For 236311/236311 co-relation queries the response was YES. [2023-08-26 12:08:30,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103434 conditions, 12243 events. 7960/12243 cut-off events. For 236311/236311 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 74861 event pairs, 990 based on Foata normal form. 23/12266 useless extension candidates. Maximal degree in co-relation 103392. Up to 5739 conditions per place. [2023-08-26 12:08:30,698 INFO L140 encePairwiseOnDemand]: 268/280 looper letters, 219 selfloop transitions, 112 changer transitions 60/391 dead transitions. [2023-08-26 12:08:30,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 391 transitions, 6961 flow [2023-08-26 12:08:30,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 12:08:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 12:08:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1487 transitions. [2023-08-26 12:08:30,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4085164835164835 [2023-08-26 12:08:30,702 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1487 transitions. [2023-08-26 12:08:30,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1487 transitions. [2023-08-26 12:08:30,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:30,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1487 transitions. [2023-08-26 12:08:30,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.38461538461539) internal successors, (1487), 13 states have internal predecessors, (1487), 0 states have call successors, (0), 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 12:08:30,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 280.0) internal successors, (3920), 14 states have internal predecessors, (3920), 0 states have call successors, (0), 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 12:08:30,717 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 280.0) internal successors, (3920), 14 states have internal predecessors, (3920), 0 states have call successors, (0), 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 12:08:30,717 INFO L175 Difference]: Start difference. First operand has 108 places, 182 transitions, 3307 flow. Second operand 13 states and 1487 transitions. [2023-08-26 12:08:30,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 391 transitions, 6961 flow [2023-08-26 12:08:31,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 391 transitions, 6654 flow, removed 64 selfloop flow, removed 6 redundant places. [2023-08-26 12:08:31,235 INFO L231 Difference]: Finished difference. Result has 123 places, 213 transitions, 4268 flow [2023-08-26 12:08:31,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=3204, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4268, PETRI_PLACES=123, PETRI_TRANSITIONS=213} [2023-08-26 12:08:31,236 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 71 predicate places. [2023-08-26 12:08:31,236 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 213 transitions, 4268 flow [2023-08-26 12:08:31,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 104.4) internal successors, (1044), 10 states have internal predecessors, (1044), 0 states have call successors, (0), 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 12:08:31,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:31,237 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 12:08:31,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:08:31,237 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:31,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:31,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1940576714, now seen corresponding path program 2 times [2023-08-26 12:08:31,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:31,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326234344] [2023-08-26 12:08:31,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:31,362 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 12:08:31,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:31,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326234344] [2023-08-26 12:08:31,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326234344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:31,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:31,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:08:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463054487] [2023-08-26 12:08:31,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:31,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:08:31,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:31,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:08:31,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:08:31,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 280 [2023-08-26 12:08:31,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 213 transitions, 4268 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 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 12:08:31,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:31,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 280 [2023-08-26 12:08:31,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:32,539 INFO L124 PetriNetUnfolderBase]: 4941/7681 cut-off events. [2023-08-26 12:08:32,539 INFO L125 PetriNetUnfolderBase]: For 193524/195545 co-relation queries the response was YES. [2023-08-26 12:08:32,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68257 conditions, 7681 events. 4941/7681 cut-off events. For 193524/195545 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 47762 event pairs, 511 based on Foata normal form. 444/7960 useless extension candidates. Maximal degree in co-relation 68209. Up to 3884 conditions per place. [2023-08-26 12:08:32,586 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 198 selfloop transitions, 17 changer transitions 123/358 dead transitions. [2023-08-26 12:08:32,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 358 transitions, 8015 flow [2023-08-26 12:08:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:08:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:08:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 781 transitions. [2023-08-26 12:08:32,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648809523809524 [2023-08-26 12:08:32,588 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 781 transitions. [2023-08-26 12:08:32,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 781 transitions. [2023-08-26 12:08:32,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:32,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 781 transitions. [2023-08-26 12:08:32,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 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 12:08:32,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 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 12:08:32,591 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 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 12:08:32,591 INFO L175 Difference]: Start difference. First operand has 123 places, 213 transitions, 4268 flow. Second operand 6 states and 781 transitions. [2023-08-26 12:08:32,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 358 transitions, 8015 flow [2023-08-26 12:08:33,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 358 transitions, 7769 flow, removed 119 selfloop flow, removed 6 redundant places. [2023-08-26 12:08:33,007 INFO L231 Difference]: Finished difference. Result has 119 places, 135 transitions, 2385 flow [2023-08-26 12:08:33,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=4090, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2385, PETRI_PLACES=119, PETRI_TRANSITIONS=135} [2023-08-26 12:08:33,007 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 67 predicate places. [2023-08-26 12:08:33,007 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 135 transitions, 2385 flow [2023-08-26 12:08:33,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 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 12:08:33,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:33,008 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 12:08:33,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:08:33,008 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:33,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:33,008 INFO L85 PathProgramCache]: Analyzing trace with hash 65162359, now seen corresponding path program 1 times [2023-08-26 12:08:33,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:33,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233249425] [2023-08-26 12:08:33,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:33,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:33,358 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 12:08:33,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:33,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233249425] [2023-08-26 12:08:33,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233249425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:33,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:33,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:08:33,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308415552] [2023-08-26 12:08:33,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:33,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:08:33,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:33,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:08:33,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:08:33,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 280 [2023-08-26 12:08:33,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 135 transitions, 2385 flow. Second operand has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 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 12:08:33,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:33,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 280 [2023-08-26 12:08:33,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:34,402 INFO L124 PetriNetUnfolderBase]: 4050/6333 cut-off events. [2023-08-26 12:08:34,402 INFO L125 PetriNetUnfolderBase]: For 123753/123753 co-relation queries the response was YES. [2023-08-26 12:08:34,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52146 conditions, 6333 events. 4050/6333 cut-off events. For 123753/123753 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 36170 event pairs, 797 based on Foata normal form. 2/6335 useless extension candidates. Maximal degree in co-relation 52102. Up to 3556 conditions per place. [2023-08-26 12:08:34,444 INFO L140 encePairwiseOnDemand]: 268/280 looper letters, 111 selfloop transitions, 79 changer transitions 69/259 dead transitions. [2023-08-26 12:08:34,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 259 transitions, 4751 flow [2023-08-26 12:08:34,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:08:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:08:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1149 transitions. [2023-08-26 12:08:34,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41035714285714286 [2023-08-26 12:08:34,445 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1149 transitions. [2023-08-26 12:08:34,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1149 transitions. [2023-08-26 12:08:34,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:34,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1149 transitions. [2023-08-26 12:08:34,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.9) internal successors, (1149), 10 states have internal predecessors, (1149), 0 states have call successors, (0), 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 12:08:34,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 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 12:08:34,449 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 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 12:08:34,449 INFO L175 Difference]: Start difference. First operand has 119 places, 135 transitions, 2385 flow. Second operand 10 states and 1149 transitions. [2023-08-26 12:08:34,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 259 transitions, 4751 flow [2023-08-26 12:08:34,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 259 transitions, 3815 flow, removed 368 selfloop flow, removed 19 redundant places. [2023-08-26 12:08:34,847 INFO L231 Difference]: Finished difference. Result has 110 places, 158 transitions, 2542 flow [2023-08-26 12:08:34,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2542, PETRI_PLACES=110, PETRI_TRANSITIONS=158} [2023-08-26 12:08:34,848 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2023-08-26 12:08:34,848 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 158 transitions, 2542 flow [2023-08-26 12:08:34,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 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 12:08:34,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:34,848 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 12:08:34,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:08:34,848 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:34,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:34,848 INFO L85 PathProgramCache]: Analyzing trace with hash -64413085, now seen corresponding path program 2 times [2023-08-26 12:08:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617614092] [2023-08-26 12:08:34,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:34,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:35,084 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 12:08:35,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:35,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617614092] [2023-08-26 12:08:35,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617614092] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:35,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:35,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:08:35,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441272457] [2023-08-26 12:08:35,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:35,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:08:35,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:35,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:08:35,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:08:35,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 280 [2023-08-26 12:08:35,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 158 transitions, 2542 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 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 12:08:35,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:35,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 280 [2023-08-26 12:08:35,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:36,021 INFO L124 PetriNetUnfolderBase]: 3876/6090 cut-off events. [2023-08-26 12:08:36,021 INFO L125 PetriNetUnfolderBase]: For 54790/54790 co-relation queries the response was YES. [2023-08-26 12:08:36,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38902 conditions, 6090 events. 3876/6090 cut-off events. For 54790/54790 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 35054 event pairs, 779 based on Foata normal form. 2/6092 useless extension candidates. Maximal degree in co-relation 38867. Up to 2896 conditions per place. [2023-08-26 12:08:36,058 INFO L140 encePairwiseOnDemand]: 270/280 looper letters, 68 selfloop transitions, 10 changer transitions 165/243 dead transitions. [2023-08-26 12:08:36,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 243 transitions, 4011 flow [2023-08-26 12:08:36,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:08:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:08:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 806 transitions. [2023-08-26 12:08:36,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41122448979591836 [2023-08-26 12:08:36,060 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 806 transitions. [2023-08-26 12:08:36,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 806 transitions. [2023-08-26 12:08:36,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:36,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 806 transitions. [2023-08-26 12:08:36,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 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 12:08:36,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:36,063 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 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 12:08:36,063 INFO L175 Difference]: Start difference. First operand has 110 places, 158 transitions, 2542 flow. Second operand 7 states and 806 transitions. [2023-08-26 12:08:36,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 243 transitions, 4011 flow [2023-08-26 12:08:36,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 243 transitions, 3737 flow, removed 83 selfloop flow, removed 5 redundant places. [2023-08-26 12:08:36,220 INFO L231 Difference]: Finished difference. Result has 111 places, 68 transitions, 815 flow [2023-08-26 12:08:36,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=2338, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=815, PETRI_PLACES=111, PETRI_TRANSITIONS=68} [2023-08-26 12:08:36,222 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 59 predicate places. [2023-08-26 12:08:36,222 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 68 transitions, 815 flow [2023-08-26 12:08:36,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 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 12:08:36,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:36,222 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 12:08:36,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 12:08:36,222 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:36,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:36,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1666601447, now seen corresponding path program 3 times [2023-08-26 12:08:36,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:36,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545635579] [2023-08-26 12:08:36,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:36,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:08:37,147 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 12:08:37,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:08:37,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545635579] [2023-08-26 12:08:37,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545635579] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:08:37,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:08:37,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 12:08:37,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508608742] [2023-08-26 12:08:37,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:08:37,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 12:08:37,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:08:37,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 12:08:37,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-08-26 12:08:37,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 280 [2023-08-26 12:08:37,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 68 transitions, 815 flow. Second operand has 11 states, 11 states have (on average 102.54545454545455) internal successors, (1128), 11 states have internal predecessors, (1128), 0 states have call successors, (0), 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 12:08:37,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:08:37,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 280 [2023-08-26 12:08:37,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:08:37,656 INFO L124 PetriNetUnfolderBase]: 1373/2266 cut-off events. [2023-08-26 12:08:37,656 INFO L125 PetriNetUnfolderBase]: For 15967/15967 co-relation queries the response was YES. [2023-08-26 12:08:37,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12686 conditions, 2266 events. 1373/2266 cut-off events. For 15967/15967 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11323 event pairs, 186 based on Foata normal form. 2/2268 useless extension candidates. Maximal degree in co-relation 12651. Up to 975 conditions per place. [2023-08-26 12:08:37,667 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 68 selfloop transitions, 14 changer transitions 56/138 dead transitions. [2023-08-26 12:08:37,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 138 transitions, 1589 flow [2023-08-26 12:08:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:08:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:08:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 881 transitions. [2023-08-26 12:08:37,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3933035714285714 [2023-08-26 12:08:37,668 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 881 transitions. [2023-08-26 12:08:37,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 881 transitions. [2023-08-26 12:08:37,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:08:37,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 881 transitions. [2023-08-26 12:08:37,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.125) internal successors, (881), 8 states have internal predecessors, (881), 0 states have call successors, (0), 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 12:08:37,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 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 12:08:37,671 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 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 12:08:37,671 INFO L175 Difference]: Start difference. First operand has 111 places, 68 transitions, 815 flow. Second operand 8 states and 881 transitions. [2023-08-26 12:08:37,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 138 transitions, 1589 flow [2023-08-26 12:08:37,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 138 transitions, 1322 flow, removed 56 selfloop flow, removed 29 redundant places. [2023-08-26 12:08:37,700 INFO L231 Difference]: Finished difference. Result has 85 places, 58 transitions, 513 flow [2023-08-26 12:08:37,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=513, PETRI_PLACES=85, PETRI_TRANSITIONS=58} [2023-08-26 12:08:37,701 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 33 predicate places. [2023-08-26 12:08:37,701 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 58 transitions, 513 flow [2023-08-26 12:08:37,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 102.54545454545455) internal successors, (1128), 11 states have internal predecessors, (1128), 0 states have call successors, (0), 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 12:08:37,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:08:37,701 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 12:08:37,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 12:08:37,701 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:08:37,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:08:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash 637585769, now seen corresponding path program 4 times [2023-08-26 12:08:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:08:37,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118777538] [2023-08-26 12:08:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:08:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:08:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:08:37,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:08:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:08:37,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:08:37,785 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:08:37,785 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 12:08:37,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 12:08:37,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 12:08:37,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 12:08:37,788 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:08:37,791 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:08:37,792 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:08:37,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:08:37 BasicIcfg [2023-08-26 12:08:37,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:08:37,863 INFO L158 Benchmark]: Toolchain (without parser) took 48049.17ms. Allocated memory was 343.9MB in the beginning and 7.8GB in the end (delta: 7.4GB). Free memory was 318.2MB in the beginning and 5.2GB in the end (delta: -4.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-26 12:08:37,863 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 343.9MB. Free memory was 320.4MB in the beginning and 320.3MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:08:37,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.41ms. Allocated memory is still 343.9MB. Free memory was 317.9MB in the beginning and 293.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:08:37,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.72ms. Allocated memory is still 343.9MB. Free memory was 293.9MB in the beginning and 291.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:08:37,863 INFO L158 Benchmark]: Boogie Preprocessor took 25.83ms. Allocated memory is still 343.9MB. Free memory was 290.9MB in the beginning and 289.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:08:37,863 INFO L158 Benchmark]: RCFGBuilder took 561.79ms. Allocated memory is still 343.9MB. Free memory was 288.8MB in the beginning and 294.6MB in the end (delta: -5.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 12:08:37,864 INFO L158 Benchmark]: TraceAbstraction took 47036.23ms. Allocated memory was 343.9MB in the beginning and 7.8GB in the end (delta: 7.4GB). Free memory was 293.5MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-26 12:08:37,864 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 343.9MB. Free memory was 320.4MB in the beginning and 320.3MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 384.41ms. Allocated memory is still 343.9MB. Free memory was 317.9MB in the beginning and 293.9MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.72ms. Allocated memory is still 343.9MB. Free memory was 293.9MB in the beginning and 291.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.83ms. Allocated memory is still 343.9MB. Free memory was 290.9MB in the beginning and 289.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 561.79ms. Allocated memory is still 343.9MB. Free memory was 288.8MB in the beginning and 294.6MB in the end (delta: -5.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 47036.23ms. Allocated memory was 343.9MB in the beginning and 7.8GB in the end (delta: 7.4GB). Free memory was 293.5MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 2.5GB. 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.6s, 146 PlacesBefore, 52 PlacesAfterwards, 136 TransitionsBefore, 40 TransitionsAfterwards, 3452 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 140 TotalNumberOfCompositions, 10171 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3552, independent: 3319, independent conditional: 0, independent unconditional: 3319, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1829, independent: 1783, independent conditional: 0, independent unconditional: 1783, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3552, independent: 1536, independent conditional: 0, independent unconditional: 1536, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 1829, unknown conditional: 0, unknown unconditional: 1829] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1481, ((void *)0), P0, ((void *)0))=-2, t1481={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1482, ((void *)0), P1, ((void *)0))=-1, t1481={5:0}, t1482={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1483; [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1483, ((void *)0), P2, ((void *)0))=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1484; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1484, ((void *)0), P3, ((void *)0))=1, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L804] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L881] 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", "mix055_tso.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_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - 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: 847]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 175 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: 46.9s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 36.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1014 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1014 mSDsluCounter, 378 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 250 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3750 IncrementalHoareTripleChecker+Invalid, 3932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 128 mSDtfsCounter, 3750 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6085occurred in iteration=10, InterpolantAutomatonStates: 135, 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, 6.4s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 4150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 12:08:37,882 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...