/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 16:23:43,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 16:23:43,377 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 16:23:43,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 16:23:43,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 16:23:43,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 16:23:43,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 16:23:43,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 16:23:43,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 16:23:43,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 16:23:43,407 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 16:23:43,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 16:23:43,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 16:23:43,409 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 16:23:43,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 16:23:43,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 16:23:43,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 16:23:43,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 16:23:43,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 16:23:43,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 16:23:43,410 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 16:23:43,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 16:23:43,411 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 16:23:43,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 16:23:43,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 16:23:43,411 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 16:23:43,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 16:23:43,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 16:23:43,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 16:23:43,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 16:23:43,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 16:23:43,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 16:23:43,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 16:23:43,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 16:23:43,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 16:23:43,413 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 16:23:43,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 16:23:43,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 16:23:43,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 16:23:43,677 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 16:23:43,677 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 16:23:43,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2023-08-26 16:23:44,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 16:23:44,813 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 16:23:44,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2023-08-26 16:23:44,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083562fa2/078e6ec0ba284906be604c7614248ce9/FLAG08e0263c5 [2023-08-26 16:23:44,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083562fa2/078e6ec0ba284906be604c7614248ce9 [2023-08-26 16:23:44,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 16:23:44,828 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 16:23:44,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 16:23:44,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 16:23:44,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 16:23:44,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:44,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63636f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44, skipping insertion in model container [2023-08-26 16:23:44,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:44,845 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 16:23:44,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 16:23:44,945 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 16:23:44,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 16:23:44,970 INFO L206 MainTranslator]: Completed translation [2023-08-26 16:23:44,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44 WrapperNode [2023-08-26 16:23:44,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 16:23:44,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 16:23:44,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 16:23:44,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 16:23:44,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:44,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:45,010 INFO L138 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2023-08-26 16:23:45,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 16:23:45,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 16:23:45,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 16:23:45,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 16:23:45,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:45,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:45,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:45,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:45,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:45,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:45,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:45,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:45,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 16:23:45,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 16:23:45,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 16:23:45,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 16:23:45,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (1/1) ... [2023-08-26 16:23:45,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 16:23:45,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:23:45,064 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 16:23:45,080 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 16:23:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 16:23:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 16:23:45,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 16:23:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 16:23:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 16:23:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 16:23:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 16:23:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 16:23:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 16:23:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 16:23:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-26 16:23:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-26 16:23:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-26 16:23:45,101 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-26 16:23:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 16:23:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 16:23:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 16:23:45,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 16:23:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 16:23:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 16:23:45,104 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 16:23:45,174 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 16:23:45,175 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 16:23:45,454 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 16:23:45,461 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 16:23:45,461 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-26 16:23:45,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:23:45 BoogieIcfgContainer [2023-08-26 16:23:45,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 16:23:45,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 16:23:45,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 16:23:45,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 16:23:45,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 04:23:44" (1/3) ... [2023-08-26 16:23:45,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b2ac8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:23:45, skipping insertion in model container [2023-08-26 16:23:45,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:23:44" (2/3) ... [2023-08-26 16:23:45,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b2ac8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:23:45, skipping insertion in model container [2023-08-26 16:23:45,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:23:45" (3/3) ... [2023-08-26 16:23:45,468 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2023-08-26 16:23:45,478 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 16:23:45,478 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-08-26 16:23:45,478 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 16:23:45,539 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-26 16:23:45,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 194 transitions, 436 flow [2023-08-26 16:23:45,620 INFO L124 PetriNetUnfolderBase]: 14/188 cut-off events. [2023-08-26 16:23:45,620 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 16:23:45,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 188 events. 14/188 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 132 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2023-08-26 16:23:45,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 194 transitions, 436 flow [2023-08-26 16:23:45,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 171 transitions, 378 flow [2023-08-26 16:23:45,631 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 16:23:45,636 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 171 transitions, 378 flow [2023-08-26 16:23:45,638 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 171 transitions, 378 flow [2023-08-26 16:23:45,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 171 transitions, 378 flow [2023-08-26 16:23:45,659 INFO L124 PetriNetUnfolderBase]: 14/171 cut-off events. [2023-08-26 16:23:45,659 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 16:23:45,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 171 events. 14/171 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 131 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2023-08-26 16:23:45,662 INFO L119 LiptonReduction]: Number of co-enabled transitions 3780 [2023-08-26 16:23:51,659 INFO L134 LiptonReduction]: Checked pairs total: 4775 [2023-08-26 16:23:51,659 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-08-26 16:23:51,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 16:23:51,680 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;@756b564, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 16:23:51,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-08-26 16:23:51,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 16:23:51,683 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 16:23:51,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:51,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:51,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 16:23:51,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:51,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:51,705 INFO L85 PathProgramCache]: Analyzing trace with hash 676, now seen corresponding path program 1 times [2023-08-26 16:23:51,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402940390] [2023-08-26 16:23:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:51,789 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 16:23:51,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:51,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402940390] [2023-08-26 16:23:51,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402940390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:51,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:51,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 16:23:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561800409] [2023-08-26 16:23:51,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:51,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 16:23:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 16:23:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 16:23:51,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 352 [2023-08-26 16:23:51,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 158 flow. Second operand has 2 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 0 states have call successors, (0), 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 16:23:51,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:51,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 352 [2023-08-26 16:23:51,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:52,167 INFO L124 PetriNetUnfolderBase]: 3537/4292 cut-off events. [2023-08-26 16:23:52,167 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-08-26 16:23:52,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8781 conditions, 4292 events. 3537/4292 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11032 event pairs, 1737 based on Foata normal form. 0/2116 useless extension candidates. Maximal degree in co-relation 6140. Up to 4293 conditions per place. [2023-08-26 16:23:52,188 INFO L140 encePairwiseOnDemand]: 350/352 looper letters, 59 selfloop transitions, 0 changer transitions 0/59 dead transitions. [2023-08-26 16:23:52,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 59 transitions, 272 flow [2023-08-26 16:23:52,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 16:23:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 16:23:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 407 transitions. [2023-08-26 16:23:52,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.578125 [2023-08-26 16:23:52,203 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 407 transitions. [2023-08-26 16:23:52,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 407 transitions. [2023-08-26 16:23:52,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:52,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 407 transitions. [2023-08-26 16:23:52,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 203.5) internal successors, (407), 2 states have internal predecessors, (407), 0 states have call successors, (0), 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 16:23:52,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 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 16:23:52,215 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 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 16:23:52,216 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 158 flow. Second operand 2 states and 407 transitions. [2023-08-26 16:23:52,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 59 transitions, 272 flow [2023-08-26 16:23:52,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 248 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-26 16:23:52,223 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 130 flow [2023-08-26 16:23:52,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2023-08-26 16:23:52,228 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-08-26 16:23:52,228 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 130 flow [2023-08-26 16:23:52,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 0 states have call successors, (0), 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 16:23:52,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:52,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 16:23:52,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 16:23:52,229 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:52,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash 666036, now seen corresponding path program 1 times [2023-08-26 16:23:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:52,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229975925] [2023-08-26 16:23:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:52,738 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 16:23:52,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:52,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229975925] [2023-08-26 16:23:52,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229975925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:52,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:52,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:23:52,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97806129] [2023-08-26 16:23:52,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:52,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:23:52,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:52,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:23:52,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:23:52,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 352 [2023-08-26 16:23:52,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 16:23:52,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:52,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 352 [2023-08-26 16:23:52,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:52,972 INFO L124 PetriNetUnfolderBase]: 3375/4096 cut-off events. [2023-08-26 16:23:52,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:52,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8258 conditions, 4096 events. 3375/4096 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10426 event pairs, 1656 based on Foata normal form. 0/2035 useless extension candidates. Maximal degree in co-relation 8255. Up to 4096 conditions per place. [2023-08-26 16:23:52,987 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 56 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-08-26 16:23:52,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 240 flow [2023-08-26 16:23:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-26 16:23:52,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4251893939393939 [2023-08-26 16:23:52,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-26 16:23:52,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-26 16:23:52,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:52,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-26 16:23:52,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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 16:23:52,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:52,994 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:52,994 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 130 flow. Second operand 3 states and 449 transitions. [2023-08-26 16:23:52,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 240 flow [2023-08-26 16:23:52,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 240 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 16:23:52,998 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 128 flow [2023-08-26 16:23:52,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2023-08-26 16:23:52,999 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-08-26 16:23:52,999 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 128 flow [2023-08-26 16:23:53,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 16:23:53,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:53,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 16:23:53,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 16:23:53,003 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:53,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash 666035, now seen corresponding path program 1 times [2023-08-26 16:23:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:53,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877555798] [2023-08-26 16:23:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:53,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:53,182 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 16:23:53,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:53,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877555798] [2023-08-26 16:23:53,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877555798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:53,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:53,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:23:53,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969609011] [2023-08-26 16:23:53,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:53,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:23:53,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:53,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:23:53,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:23:53,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 352 [2023-08-26 16:23:53,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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 16:23:53,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:53,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 352 [2023-08-26 16:23:53,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:53,395 INFO L124 PetriNetUnfolderBase]: 3213/3900 cut-off events. [2023-08-26 16:23:53,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:53,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7868 conditions, 3900 events. 3213/3900 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9844 event pairs, 1575 based on Foata normal form. 0/1954 useless extension candidates. Maximal degree in co-relation 7864. Up to 3900 conditions per place. [2023-08-26 16:23:53,406 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 54 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-08-26 16:23:53,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 234 flow [2023-08-26 16:23:53,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-08-26 16:23:53,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403409090909091 [2023-08-26 16:23:53,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-08-26 16:23:53,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-08-26 16:23:53,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:53,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-08-26 16:23:53,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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 16:23:53,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:53,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:53,411 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 128 flow. Second operand 3 states and 465 transitions. [2023-08-26 16:23:53,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 234 flow [2023-08-26 16:23:53,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:53,413 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 125 flow [2023-08-26 16:23:53,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2023-08-26 16:23:53,414 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2023-08-26 16:23:53,414 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 125 flow [2023-08-26 16:23:53,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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 16:23:53,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:53,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 16:23:53,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 16:23:53,417 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:53,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:53,418 INFO L85 PathProgramCache]: Analyzing trace with hash 640076806, now seen corresponding path program 1 times [2023-08-26 16:23:53,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:53,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276272655] [2023-08-26 16:23:53,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:53,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:53,520 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 16:23:53,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:53,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276272655] [2023-08-26 16:23:53,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276272655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:53,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:53,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:23:53,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865281728] [2023-08-26 16:23:53,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:53,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:23:53,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:53,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:23:53,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:23:53,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 352 [2023-08-26 16:23:53,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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 16:23:53,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:53,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 352 [2023-08-26 16:23:53,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:53,687 INFO L124 PetriNetUnfolderBase]: 3141/3808 cut-off events. [2023-08-26 16:23:53,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:53,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7685 conditions, 3808 events. 3141/3808 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9565 event pairs, 1539 based on Foata normal form. 0/1918 useless extension candidates. Maximal degree in co-relation 7681. Up to 3808 conditions per place. [2023-08-26 16:23:53,702 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 52 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-26 16:23:53,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 227 flow [2023-08-26 16:23:53,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-08-26 16:23:53,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4384469696969697 [2023-08-26 16:23:53,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-08-26 16:23:53,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-08-26 16:23:53,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:53,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-08-26 16:23:53,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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 16:23:53,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:53,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:53,707 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 125 flow. Second operand 3 states and 463 transitions. [2023-08-26 16:23:53,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 227 flow [2023-08-26 16:23:53,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:53,709 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 122 flow [2023-08-26 16:23:53,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-26 16:23:53,710 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -15 predicate places. [2023-08-26 16:23:53,710 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 122 flow [2023-08-26 16:23:53,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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 16:23:53,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:53,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 16:23:53,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 16:23:53,711 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:53,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:53,711 INFO L85 PathProgramCache]: Analyzing trace with hash 640076805, now seen corresponding path program 1 times [2023-08-26 16:23:53,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:53,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250191851] [2023-08-26 16:23:53,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:53,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:53,880 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 16:23:53,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:53,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250191851] [2023-08-26 16:23:53,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250191851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:53,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:53,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:23:53,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294209882] [2023-08-26 16:23:53,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:53,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:23:53,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:53,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:23:53,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:23:53,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 352 [2023-08-26 16:23:53,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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 16:23:53,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:53,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 352 [2023-08-26 16:23:53,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:54,062 INFO L124 PetriNetUnfolderBase]: 3069/3716 cut-off events. [2023-08-26 16:23:54,062 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:54,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7502 conditions, 3716 events. 3069/3716 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9299 event pairs, 1503 based on Foata normal form. 0/1882 useless extension candidates. Maximal degree in co-relation 7498. Up to 3716 conditions per place. [2023-08-26 16:23:54,077 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 50 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-08-26 16:23:54,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 220 flow [2023-08-26 16:23:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-08-26 16:23:54,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41950757575757575 [2023-08-26 16:23:54,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-08-26 16:23:54,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-08-26 16:23:54,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:54,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-08-26 16:23:54,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 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 16:23:54,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:54,081 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:54,081 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 122 flow. Second operand 3 states and 443 transitions. [2023-08-26 16:23:54,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 220 flow [2023-08-26 16:23:54,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:54,084 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 119 flow [2023-08-26 16:23:54,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2023-08-26 16:23:54,085 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -16 predicate places. [2023-08-26 16:23:54,085 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 119 flow [2023-08-26 16:23:54,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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 16:23:54,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:54,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:23:54,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 16:23:54,086 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:54,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash 933500805, now seen corresponding path program 1 times [2023-08-26 16:23:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:54,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519670294] [2023-08-26 16:23:54,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:54,200 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 16:23:54,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:54,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519670294] [2023-08-26 16:23:54,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519670294] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:54,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:54,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:23:54,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245833215] [2023-08-26 16:23:54,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:54,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:23:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:54,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:23:54,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:23:54,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 352 [2023-08-26 16:23:54,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 119 flow. Second operand has 3 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 16:23:54,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:54,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 352 [2023-08-26 16:23:54,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:54,394 INFO L124 PetriNetUnfolderBase]: 3021/3652 cut-off events. [2023-08-26 16:23:54,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:54,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7375 conditions, 3652 events. 3021/3652 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9115 event pairs, 1479 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 7371. Up to 3652 conditions per place. [2023-08-26 16:23:54,403 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 48 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-08-26 16:23:54,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 213 flow [2023-08-26 16:23:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-26 16:23:54,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2023-08-26 16:23:54,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-26 16:23:54,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-26 16:23:54,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:54,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-26 16:23:54,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 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 16:23:54,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:54,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:54,407 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 119 flow. Second operand 3 states and 441 transitions. [2023-08-26 16:23:54,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 213 flow [2023-08-26 16:23:54,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:54,408 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 116 flow [2023-08-26 16:23:54,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-26 16:23:54,409 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-08-26 16:23:54,409 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 116 flow [2023-08-26 16:23:54,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 16:23:54,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:54,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:23:54,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 16:23:54,409 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:54,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:54,409 INFO L85 PathProgramCache]: Analyzing trace with hash 933500806, now seen corresponding path program 1 times [2023-08-26 16:23:54,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:54,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718868680] [2023-08-26 16:23:54,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:54,511 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 16:23:54,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718868680] [2023-08-26 16:23:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718868680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:23:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713043014] [2023-08-26 16:23:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:54,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:23:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:23:54,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:23:54,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 352 [2023-08-26 16:23:54,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 116 flow. Second operand has 3 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 16:23:54,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:54,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 352 [2023-08-26 16:23:54,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:54,658 INFO L124 PetriNetUnfolderBase]: 2973/3588 cut-off events. [2023-08-26 16:23:54,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:54,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7248 conditions, 3588 events. 2973/3588 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8927 event pairs, 1455 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 7244. Up to 3588 conditions per place. [2023-08-26 16:23:54,668 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 46 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-08-26 16:23:54,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 206 flow [2023-08-26 16:23:54,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-08-26 16:23:54,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4327651515151515 [2023-08-26 16:23:54,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-08-26 16:23:54,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-08-26 16:23:54,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:54,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-08-26 16:23:54,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 16:23:54,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:54,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:54,673 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 116 flow. Second operand 3 states and 457 transitions. [2023-08-26 16:23:54,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 206 flow [2023-08-26 16:23:54,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:54,674 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 113 flow [2023-08-26 16:23:54,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-26 16:23:54,674 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-08-26 16:23:54,674 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 113 flow [2023-08-26 16:23:54,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 16:23:54,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:54,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:23:54,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 16:23:54,675 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:54,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash -553874017, now seen corresponding path program 1 times [2023-08-26 16:23:54,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:54,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895794658] [2023-08-26 16:23:54,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:54,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:54,740 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 16:23:54,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895794658] [2023-08-26 16:23:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895794658] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:54,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:54,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:23:54,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369631515] [2023-08-26 16:23:54,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:54,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:23:54,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:54,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:23:54,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:23:54,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 352 [2023-08-26 16:23:54,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 16:23:54,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:54,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 352 [2023-08-26 16:23:54,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:54,921 INFO L124 PetriNetUnfolderBase]: 2901/3496 cut-off events. [2023-08-26 16:23:54,921 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:54,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7065 conditions, 3496 events. 2901/3496 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8649 event pairs, 1419 based on Foata normal form. 0/1798 useless extension candidates. Maximal degree in co-relation 7061. Up to 3496 conditions per place. [2023-08-26 16:23:54,932 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 44 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-26 16:23:54,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 199 flow [2023-08-26 16:23:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-08-26 16:23:54,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4308712121212121 [2023-08-26 16:23:54,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-08-26 16:23:54,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-08-26 16:23:54,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:54,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-08-26 16:23:54,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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 16:23:54,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:54,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:54,936 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 113 flow. Second operand 3 states and 455 transitions. [2023-08-26 16:23:54,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 199 flow [2023-08-26 16:23:54,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:54,939 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 110 flow [2023-08-26 16:23:54,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-08-26 16:23:54,940 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -19 predicate places. [2023-08-26 16:23:54,940 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 110 flow [2023-08-26 16:23:54,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 16:23:54,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:54,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:23:54,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 16:23:54,941 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:54,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:54,941 INFO L85 PathProgramCache]: Analyzing trace with hash -553874018, now seen corresponding path program 1 times [2023-08-26 16:23:54,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:54,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683541381] [2023-08-26 16:23:54,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:54,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:55,007 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 16:23:55,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:55,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683541381] [2023-08-26 16:23:55,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683541381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:55,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:55,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:23:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263615935] [2023-08-26 16:23:55,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:55,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:23:55,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:55,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:23:55,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:23:55,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 352 [2023-08-26 16:23:55,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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 16:23:55,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:55,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 352 [2023-08-26 16:23:55,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:55,152 INFO L124 PetriNetUnfolderBase]: 2829/3404 cut-off events. [2023-08-26 16:23:55,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:55,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 3404 events. 2829/3404 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8383 event pairs, 1383 based on Foata normal form. 0/1762 useless extension candidates. Maximal degree in co-relation 6878. Up to 3404 conditions per place. [2023-08-26 16:23:55,163 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 42 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-26 16:23:55,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 192 flow [2023-08-26 16:23:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-26 16:23:55,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119318181818182 [2023-08-26 16:23:55,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-26 16:23:55,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-26 16:23:55,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:55,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-26 16:23:55,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:23:55,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:55,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:55,168 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 110 flow. Second operand 3 states and 435 transitions. [2023-08-26 16:23:55,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 192 flow [2023-08-26 16:23:55,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:55,169 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 107 flow [2023-08-26 16:23:55,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-26 16:23:55,170 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-08-26 16:23:55,170 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 107 flow [2023-08-26 16:23:55,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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 16:23:55,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:55,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:23:55,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 16:23:55,170 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:55,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash 303028016, now seen corresponding path program 1 times [2023-08-26 16:23:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:55,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881114501] [2023-08-26 16:23:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:55,216 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 16:23:55,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:55,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881114501] [2023-08-26 16:23:55,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881114501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:55,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:55,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:23:55,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472877746] [2023-08-26 16:23:55,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:55,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:23:55,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:55,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:23:55,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:23:55,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 352 [2023-08-26 16:23:55,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 16:23:55,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:55,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 352 [2023-08-26 16:23:55,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:55,402 INFO L124 PetriNetUnfolderBase]: 2667/3208 cut-off events. [2023-08-26 16:23:55,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:55,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6491 conditions, 3208 events. 2667/3208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7794 event pairs, 1302 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 6487. Up to 3208 conditions per place. [2023-08-26 16:23:55,410 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 40 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-26 16:23:55,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 185 flow [2023-08-26 16:23:55,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-26 16:23:55,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4100378787878788 [2023-08-26 16:23:55,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-26 16:23:55,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-26 16:23:55,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:55,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-26 16:23:55,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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 16:23:55,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:55,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:55,414 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 107 flow. Second operand 3 states and 433 transitions. [2023-08-26 16:23:55,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 185 flow [2023-08-26 16:23:55,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 41 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:55,415 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 104 flow [2023-08-26 16:23:55,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-26 16:23:55,416 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -21 predicate places. [2023-08-26 16:23:55,416 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 104 flow [2023-08-26 16:23:55,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 16:23:55,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:55,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:23:55,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 16:23:55,417 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:55,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash 303028017, now seen corresponding path program 1 times [2023-08-26 16:23:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:55,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523658941] [2023-08-26 16:23:55,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:55,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:55,469 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 16:23:55,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:55,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523658941] [2023-08-26 16:23:55,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523658941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:55,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:55,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:23:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985402701] [2023-08-26 16:23:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:55,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:23:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:23:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:23:55,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 352 [2023-08-26 16:23:55,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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 16:23:55,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:55,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 352 [2023-08-26 16:23:55,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:55,595 INFO L124 PetriNetUnfolderBase]: 2505/3012 cut-off events. [2023-08-26 16:23:55,595 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:55,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6100 conditions, 3012 events. 2505/3012 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7196 event pairs, 1221 based on Foata normal form. 0/1600 useless extension candidates. Maximal degree in co-relation 6096. Up to 3012 conditions per place. [2023-08-26 16:23:55,604 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 38 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-26 16:23:55,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 178 flow [2023-08-26 16:23:55,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-26 16:23:55,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4251893939393939 [2023-08-26 16:23:55,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-26 16:23:55,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-26 16:23:55,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:55,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-26 16:23:55,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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 16:23:55,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:55,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:55,608 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 104 flow. Second operand 3 states and 449 transitions. [2023-08-26 16:23:55,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 178 flow [2023-08-26 16:23:55,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 39 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:55,609 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 101 flow [2023-08-26 16:23:55,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-26 16:23:55,609 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 16:23:55,609 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 101 flow [2023-08-26 16:23:55,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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 16:23:55,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:55,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:23:55,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 16:23:55,610 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:55,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash -847838367, now seen corresponding path program 1 times [2023-08-26 16:23:55,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:55,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613161174] [2023-08-26 16:23:55,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:55,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:55,852 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 16:23:55,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:55,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613161174] [2023-08-26 16:23:55,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613161174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:55,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:55,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 16:23:55,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663435178] [2023-08-26 16:23:55,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:55,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 16:23:55,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:55,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 16:23:55,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-08-26 16:23:55,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 352 [2023-08-26 16:23:55,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 101 flow. Second operand has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 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 16:23:55,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:55,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 352 [2023-08-26 16:23:55,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:55,976 INFO L124 PetriNetUnfolderBase]: 2121/2564 cut-off events. [2023-08-26 16:23:55,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:55,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5205 conditions, 2564 events. 2121/2564 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5937 event pairs, 1029 based on Foata normal form. 0/1408 useless extension candidates. Maximal degree in co-relation 5201. Up to 2564 conditions per place. [2023-08-26 16:23:55,984 INFO L140 encePairwiseOnDemand]: 350/352 looper letters, 37 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-08-26 16:23:55,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 38 transitions, 175 flow [2023-08-26 16:23:55,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-26 16:23:55,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2023-08-26 16:23:55,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-26 16:23:55,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-26 16:23:55,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:55,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-26 16:23:55,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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 16:23:55,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:55,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:55,988 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 101 flow. Second operand 3 states and 384 transitions. [2023-08-26 16:23:55,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 38 transitions, 175 flow [2023-08-26 16:23:55,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 38 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:55,988 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 100 flow [2023-08-26 16:23:55,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-08-26 16:23:55,989 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 16:23:55,989 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 100 flow [2023-08-26 16:23:55,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 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 16:23:55,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:55,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:23:55,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 16:23:55,990 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:55,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:55,990 INFO L85 PathProgramCache]: Analyzing trace with hash -847838366, now seen corresponding path program 1 times [2023-08-26 16:23:55,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:55,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169946219] [2023-08-26 16:23:55,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:55,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:56,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 16:23:56,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169946219] [2023-08-26 16:23:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169946219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:56,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 16:23:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067982761] [2023-08-26 16:23:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:56,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:23:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:23:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:23:56,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 352 [2023-08-26 16:23:56,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 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 16:23:56,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:56,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 352 [2023-08-26 16:23:56,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:56,390 INFO L124 PetriNetUnfolderBase]: 1737/2116 cut-off events. [2023-08-26 16:23:56,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:23:56,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4310 conditions, 2116 events. 1737/2116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4760 event pairs, 837 based on Foata normal form. 0/1216 useless extension candidates. Maximal degree in co-relation 4306. Up to 2116 conditions per place. [2023-08-26 16:23:56,398 INFO L140 encePairwiseOnDemand]: 350/352 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-26 16:23:56,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 37 transitions, 172 flow [2023-08-26 16:23:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-26 16:23:56,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3768939393939394 [2023-08-26 16:23:56,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-26 16:23:56,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-26 16:23:56,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:56,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-26 16:23:56,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 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 16:23:56,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:56,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:56,401 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 100 flow. Second operand 3 states and 398 transitions. [2023-08-26 16:23:56,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 37 transitions, 172 flow [2023-08-26 16:23:56,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 37 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:56,402 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 99 flow [2023-08-26 16:23:56,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-26 16:23:56,403 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 16:23:56,403 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 99 flow [2023-08-26 16:23:56,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 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 16:23:56,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:56,403 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, 1, 1, 1] [2023-08-26 16:23:56,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 16:23:56,404 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:56,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:56,404 INFO L85 PathProgramCache]: Analyzing trace with hash 678367948, now seen corresponding path program 1 times [2023-08-26 16:23:56,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:56,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531845498] [2023-08-26 16:23:56,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:56,646 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 16:23:56,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:56,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531845498] [2023-08-26 16:23:56,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531845498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:56,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:56,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:23:56,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382875595] [2023-08-26 16:23:56,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:56,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:23:56,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:56,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:23:56,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:23:56,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 352 [2023-08-26 16:23:56,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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 16:23:56,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:56,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 352 [2023-08-26 16:23:56,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:56,885 INFO L124 PetriNetUnfolderBase]: 3473/4229 cut-off events. [2023-08-26 16:23:56,885 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-26 16:23:56,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8599 conditions, 4229 events. 3473/4229 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 11632 event pairs, 837 based on Foata normal form. 1/2430 useless extension candidates. Maximal degree in co-relation 8595. Up to 3015 conditions per place. [2023-08-26 16:23:56,899 INFO L140 encePairwiseOnDemand]: 344/352 looper letters, 63 selfloop transitions, 7 changer transitions 1/71 dead transitions. [2023-08-26 16:23:56,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 320 flow [2023-08-26 16:23:56,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:23:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:23:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2023-08-26 16:23:56,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2023-08-26 16:23:56,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2023-08-26 16:23:56,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2023-08-26 16:23:56,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:56,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2023-08-26 16:23:56,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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 16:23:56,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:56,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 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 16:23:56,903 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 99 flow. Second operand 3 states and 495 transitions. [2023-08-26 16:23:56,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 320 flow [2023-08-26 16:23:56,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:56,904 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 145 flow [2023-08-26 16:23:56,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-26 16:23:56,905 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-08-26 16:23:56,905 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 145 flow [2023-08-26 16:23:56,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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 16:23:56,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:56,906 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, 1, 1, 1, 1] [2023-08-26 16:23:56,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 16:23:56,906 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:56,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:56,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1065283738, now seen corresponding path program 1 times [2023-08-26 16:23:56,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:56,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919926828] [2023-08-26 16:23:56,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:56,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:23:57,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:57,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919926828] [2023-08-26 16:23:57,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919926828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:57,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:57,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:23:57,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399305296] [2023-08-26 16:23:57,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:57,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:23:57,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:57,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:23:57,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:23:57,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 16:23:57,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:23:57,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:57,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 16:23:57,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:57,512 INFO L124 PetriNetUnfolderBase]: 5003/6125 cut-off events. [2023-08-26 16:23:57,512 INFO L125 PetriNetUnfolderBase]: For 2480/2480 co-relation queries the response was YES. [2023-08-26 16:23:57,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15761 conditions, 6125 events. 5003/6125 cut-off events. For 2480/2480 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19113 event pairs, 259 based on Foata normal form. 186/6311 useless extension candidates. Maximal degree in co-relation 15756. Up to 3157 conditions per place. [2023-08-26 16:23:57,534 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 116 selfloop transitions, 10 changer transitions 0/126 dead transitions. [2023-08-26 16:23:57,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 126 transitions, 633 flow [2023-08-26 16:23:57,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:23:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:23:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 871 transitions. [2023-08-26 16:23:57,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4948863636363636 [2023-08-26 16:23:57,537 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 871 transitions. [2023-08-26 16:23:57,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 871 transitions. [2023-08-26 16:23:57,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:57,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 871 transitions. [2023-08-26 16:23:57,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 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 16:23:57,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:23:57,541 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:23:57,541 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 145 flow. Second operand 5 states and 871 transitions. [2023-08-26 16:23:57,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 126 transitions, 633 flow [2023-08-26 16:23:57,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 126 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:23:57,543 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 203 flow [2023-08-26 16:23:57,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-08-26 16:23:57,543 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -15 predicate places. [2023-08-26 16:23:57,543 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 203 flow [2023-08-26 16:23:57,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:23:57,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:57,544 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, 1, 1, 1, 1] [2023-08-26 16:23:57,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 16:23:57,544 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:57,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:57,544 INFO L85 PathProgramCache]: Analyzing trace with hash 163624692, now seen corresponding path program 1 times [2023-08-26 16:23:57,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:57,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178164874] [2023-08-26 16:23:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:57,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:23:57,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:57,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178164874] [2023-08-26 16:23:57,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178164874] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:23:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077423031] [2023-08-26 16:23:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:57,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:23:57,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:23:57,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 16:23:57,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 16:23:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:57,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 16:23:57,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:23:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:23:57,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:23:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:23:57,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077423031] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:23:57,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:23:57,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 16:23:57,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131224234] [2023-08-26 16:23:57,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:23:57,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:23:57,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:57,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:23:57,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:23:57,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 16:23:57,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 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 16:23:57,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:57,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 16:23:57,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:58,669 INFO L124 PetriNetUnfolderBase]: 11091/13597 cut-off events. [2023-08-26 16:23:58,670 INFO L125 PetriNetUnfolderBase]: For 11277/11277 co-relation queries the response was YES. [2023-08-26 16:23:58,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38624 conditions, 13597 events. 11091/13597 cut-off events. For 11277/11277 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 47476 event pairs, 2521 based on Foata normal form. 336/13933 useless extension candidates. Maximal degree in co-relation 38617. Up to 5767 conditions per place. [2023-08-26 16:23:58,727 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 139 selfloop transitions, 8 changer transitions 0/147 dead transitions. [2023-08-26 16:23:58,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 147 transitions, 862 flow [2023-08-26 16:23:58,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:23:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:23:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 873 transitions. [2023-08-26 16:23:58,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960227272727273 [2023-08-26 16:23:58,730 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 873 transitions. [2023-08-26 16:23:58,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 873 transitions. [2023-08-26 16:23:58,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:58,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 873 transitions. [2023-08-26 16:23:58,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.6) internal successors, (873), 5 states have internal predecessors, (873), 0 states have call successors, (0), 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 16:23:58,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:23:58,733 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:23:58,734 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 203 flow. Second operand 5 states and 873 transitions. [2023-08-26 16:23:58,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 147 transitions, 862 flow [2023-08-26 16:23:58,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 147 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 16:23:58,738 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 258 flow [2023-08-26 16:23:58,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-08-26 16:23:58,738 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-08-26 16:23:58,738 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 258 flow [2023-08-26 16:23:58,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 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 16:23:58,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:58,738 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, 1, 1, 1, 1] [2023-08-26 16:23:58,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 16:23:58,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-26 16:23:58,943 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:58,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash -324494866, now seen corresponding path program 2 times [2023-08-26 16:23:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:58,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196075786] [2023-08-26 16:23:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:58,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:23:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:23:59,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:23:59,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196075786] [2023-08-26 16:23:59,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196075786] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:23:59,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:23:59,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:23:59,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549672861] [2023-08-26 16:23:59,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:23:59,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:23:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:59,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:23:59,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:23:59,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 16:23:59,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:23:59,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:59,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 16:23:59,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:23:59,818 INFO L124 PetriNetUnfolderBase]: 9551/11693 cut-off events. [2023-08-26 16:23:59,819 INFO L125 PetriNetUnfolderBase]: For 14895/14895 co-relation queries the response was YES. [2023-08-26 16:23:59,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38915 conditions, 11693 events. 9551/11693 cut-off events. For 14895/14895 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 40789 event pairs, 415 based on Foata normal form. 232/11925 useless extension candidates. Maximal degree in co-relation 38904. Up to 4869 conditions per place. [2023-08-26 16:23:59,866 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 140 selfloop transitions, 11 changer transitions 0/151 dead transitions. [2023-08-26 16:23:59,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 151 transitions, 957 flow [2023-08-26 16:23:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:23:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:23:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 867 transitions. [2023-08-26 16:23:59,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49261363636363636 [2023-08-26 16:23:59,869 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 867 transitions. [2023-08-26 16:23:59,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 867 transitions. [2023-08-26 16:23:59,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:23:59,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 867 transitions. [2023-08-26 16:23:59,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.4) internal successors, (867), 5 states have internal predecessors, (867), 0 states have call successors, (0), 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 16:23:59,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:23:59,873 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:23:59,873 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 258 flow. Second operand 5 states and 867 transitions. [2023-08-26 16:23:59,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 151 transitions, 957 flow [2023-08-26 16:23:59,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 151 transitions, 957 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 16:23:59,919 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 319 flow [2023-08-26 16:23:59,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2023-08-26 16:23:59,919 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-08-26 16:23:59,919 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 319 flow [2023-08-26 16:23:59,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:23:59,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:23:59,920 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, 1, 1, 1, 1] [2023-08-26 16:23:59,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 16:23:59,920 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:23:59,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:23:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash -752801965, now seen corresponding path program 1 times [2023-08-26 16:23:59,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:23:59,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005865897] [2023-08-26 16:23:59,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:23:59,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:23:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:00,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:24:00,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005865897] [2023-08-26 16:24:00,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005865897] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:24:00,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198929345] [2023-08-26 16:24:00,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:00,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:24:00,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:24:00,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 16:24:00,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 16:24:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:00,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 16:24:00,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:24:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:00,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:24:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:00,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198929345] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:24:00,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:24:00,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 16:24:00,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923944444] [2023-08-26 16:24:00,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:24:00,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 16:24:00,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:24:00,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 16:24:00,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 16:24:00,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 352 [2023-08-26 16:24:00,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 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 16:24:00,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:24:00,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 352 [2023-08-26 16:24:00,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:24:02,204 INFO L124 PetriNetUnfolderBase]: 20683/25339 cut-off events. [2023-08-26 16:24:02,204 INFO L125 PetriNetUnfolderBase]: For 44742/44742 co-relation queries the response was YES. [2023-08-26 16:24:02,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91079 conditions, 25339 events. 20683/25339 cut-off events. For 44742/44742 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 98290 event pairs, 1367 based on Foata normal form. 624/25963 useless extension candidates. Maximal degree in co-relation 91066. Up to 11082 conditions per place. [2023-08-26 16:24:02,352 INFO L140 encePairwiseOnDemand]: 343/352 looper letters, 193 selfloop transitions, 14 changer transitions 1/208 dead transitions. [2023-08-26 16:24:02,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 208 transitions, 1453 flow [2023-08-26 16:24:02,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 16:24:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 16:24:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 978 transitions. [2023-08-26 16:24:02,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4630681818181818 [2023-08-26 16:24:02,355 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 978 transitions. [2023-08-26 16:24:02,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 978 transitions. [2023-08-26 16:24:02,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:24:02,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 978 transitions. [2023-08-26 16:24:02,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 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 16:24:02,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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 16:24:02,368 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 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 16:24:02,369 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 319 flow. Second operand 6 states and 978 transitions. [2023-08-26 16:24:02,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 208 transitions, 1453 flow [2023-08-26 16:24:02,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 208 transitions, 1407 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-26 16:24:02,451 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 376 flow [2023-08-26 16:24:02,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2023-08-26 16:24:02,451 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 4 predicate places. [2023-08-26 16:24:02,451 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 376 flow [2023-08-26 16:24:02,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 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 16:24:02,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:24:02,452 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, 1, 1, 1, 1] [2023-08-26 16:24:02,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-26 16:24:02,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 16:24:02,657 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:24:02,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:24:02,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2113580401, now seen corresponding path program 2 times [2023-08-26 16:24:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:24:02,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512288554] [2023-08-26 16:24:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:02,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:24:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:24:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512288554] [2023-08-26 16:24:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512288554] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:24:02,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:24:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:24:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683913722] [2023-08-26 16:24:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:24:02,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:24:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:24:02,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:24:02,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:24:02,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 16:24:02,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:02,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:24:02,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 16:24:02,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:24:04,269 INFO L124 PetriNetUnfolderBase]: 18095/22119 cut-off events. [2023-08-26 16:24:04,270 INFO L125 PetriNetUnfolderBase]: For 49533/49533 co-relation queries the response was YES. [2023-08-26 16:24:04,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88475 conditions, 22119 events. 18095/22119 cut-off events. For 49533/49533 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 82287 event pairs, 1095 based on Foata normal form. 308/22427 useless extension candidates. Maximal degree in co-relation 88458. Up to 9558 conditions per place. [2023-08-26 16:24:04,385 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 174 selfloop transitions, 11 changer transitions 0/185 dead transitions. [2023-08-26 16:24:04,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 185 transitions, 1406 flow [2023-08-26 16:24:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:24:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:24:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 863 transitions. [2023-08-26 16:24:04,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4903409090909091 [2023-08-26 16:24:04,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 863 transitions. [2023-08-26 16:24:04,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 863 transitions. [2023-08-26 16:24:04,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:24:04,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 863 transitions. [2023-08-26 16:24:04,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.6) internal successors, (863), 5 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 16:24:04,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:04,391 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:04,391 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 376 flow. Second operand 5 states and 863 transitions. [2023-08-26 16:24:04,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 185 transitions, 1406 flow [2023-08-26 16:24:04,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 185 transitions, 1390 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:24:04,552 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 426 flow [2023-08-26 16:24:04,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=426, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2023-08-26 16:24:04,553 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 8 predicate places. [2023-08-26 16:24:04,553 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 426 flow [2023-08-26 16:24:04,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:04,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:24:04,554 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, 1, 1, 1, 1] [2023-08-26 16:24:04,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 16:24:04,554 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:24:04,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:24:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1745869060, now seen corresponding path program 1 times [2023-08-26 16:24:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:24:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322311435] [2023-08-26 16:24:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:04,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:24:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:04,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:24:04,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322311435] [2023-08-26 16:24:04,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322311435] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:24:04,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:24:04,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:24:04,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176061054] [2023-08-26 16:24:04,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:24:04,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:24:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:24:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:24:04,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:24:04,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 16:24:04,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 426 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:04,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:24:04,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 16:24:04,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:24:06,256 INFO L124 PetriNetUnfolderBase]: 17695/21719 cut-off events. [2023-08-26 16:24:06,257 INFO L125 PetriNetUnfolderBase]: For 54496/54496 co-relation queries the response was YES. [2023-08-26 16:24:06,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91741 conditions, 21719 events. 17695/21719 cut-off events. For 54496/54496 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 84388 event pairs, 787 based on Foata normal form. 400/22119 useless extension candidates. Maximal degree in co-relation 91722. Up to 9597 conditions per place. [2023-08-26 16:24:06,472 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 179 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2023-08-26 16:24:06,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 187 transitions, 1439 flow [2023-08-26 16:24:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:24:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:24:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 866 transitions. [2023-08-26 16:24:06,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49204545454545456 [2023-08-26 16:24:06,474 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 866 transitions. [2023-08-26 16:24:06,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 866 transitions. [2023-08-26 16:24:06,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:24:06,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 866 transitions. [2023-08-26 16:24:06,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 0 states have call successors, (0), 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 16:24:06,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:06,478 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:06,478 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 426 flow. Second operand 5 states and 866 transitions. [2023-08-26 16:24:06,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 187 transitions, 1439 flow [2023-08-26 16:24:06,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 187 transitions, 1415 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-26 16:24:06,608 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 434 flow [2023-08-26 16:24:06,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2023-08-26 16:24:06,609 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 13 predicate places. [2023-08-26 16:24:06,609 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 434 flow [2023-08-26 16:24:06,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:06,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:24:06,609 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, 1, 1, 1, 1] [2023-08-26 16:24:06,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 16:24:06,610 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:24:06,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:24:06,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1630973843, now seen corresponding path program 1 times [2023-08-26 16:24:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:24:06,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27344419] [2023-08-26 16:24:06,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:06,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:24:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:06,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:24:06,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27344419] [2023-08-26 16:24:06,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27344419] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:24:06,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332946099] [2023-08-26 16:24:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:06,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:24:06,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:24:06,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 16:24:06,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 16:24:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:06,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 16:24:06,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:24:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:07,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:24:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:07,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332946099] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:24:07,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:24:07,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 16:24:07,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382323456] [2023-08-26 16:24:07,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:24:07,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:24:07,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:24:07,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:24:07,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:24:07,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 16:24:07,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 157.66666666666666) internal successors, (946), 6 states have internal predecessors, (946), 0 states have call successors, (0), 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 16:24:07,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:24:07,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 16:24:07,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:24:09,302 INFO L124 PetriNetUnfolderBase]: 25973/32005 cut-off events. [2023-08-26 16:24:09,302 INFO L125 PetriNetUnfolderBase]: For 101517/101517 co-relation queries the response was YES. [2023-08-26 16:24:09,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139468 conditions, 32005 events. 25973/32005 cut-off events. For 101517/101517 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 127240 event pairs, 6937 based on Foata normal form. 820/32825 useless extension candidates. Maximal degree in co-relation 139448. Up to 13990 conditions per place. [2023-08-26 16:24:09,528 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 197 selfloop transitions, 10 changer transitions 0/207 dead transitions. [2023-08-26 16:24:09,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 207 transitions, 1620 flow [2023-08-26 16:24:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:24:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:24:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 881 transitions. [2023-08-26 16:24:09,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5005681818181819 [2023-08-26 16:24:09,530 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 881 transitions. [2023-08-26 16:24:09,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 881 transitions. [2023-08-26 16:24:09,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:24:09,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 881 transitions. [2023-08-26 16:24:09,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.2) internal successors, (881), 5 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 16:24:09,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:09,534 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:09,534 INFO L175 Difference]: Start difference. First operand has 87 places, 69 transitions, 434 flow. Second operand 5 states and 881 transitions. [2023-08-26 16:24:09,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 207 transitions, 1620 flow [2023-08-26 16:24:09,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 207 transitions, 1585 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-26 16:24:09,721 INFO L231 Difference]: Finished difference. Result has 92 places, 72 transitions, 479 flow [2023-08-26 16:24:09,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=479, PETRI_PLACES=92, PETRI_TRANSITIONS=72} [2023-08-26 16:24:09,722 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 18 predicate places. [2023-08-26 16:24:09,722 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 72 transitions, 479 flow [2023-08-26 16:24:09,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.66666666666666) internal successors, (946), 6 states have internal predecessors, (946), 0 states have call successors, (0), 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 16:24:09,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:24:09,722 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, 1, 1, 1, 1] [2023-08-26 16:24:09,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 16:24:09,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:24:09,927 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:24:09,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:24:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash -839922172, now seen corresponding path program 1 times [2023-08-26 16:24:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:24:09,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916814684] [2023-08-26 16:24:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:09,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:24:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:10,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:24:10,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916814684] [2023-08-26 16:24:10,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916814684] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:24:10,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:24:10,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:24:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472517135] [2023-08-26 16:24:10,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:24:10,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:24:10,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:24:10,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:24:10,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:24:10,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 16:24:10,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 72 transitions, 479 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:10,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:24:10,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 16:24:10,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:24:12,174 INFO L124 PetriNetUnfolderBase]: 25499/31531 cut-off events. [2023-08-26 16:24:12,174 INFO L125 PetriNetUnfolderBase]: For 101643/101643 co-relation queries the response was YES. [2023-08-26 16:24:12,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142157 conditions, 31531 events. 25499/31531 cut-off events. For 101643/101643 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 129012 event pairs, 1643 based on Foata normal form. 474/32005 useless extension candidates. Maximal degree in co-relation 142134. Up to 14061 conditions per place. [2023-08-26 16:24:12,396 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 185 selfloop transitions, 8 changer transitions 0/193 dead transitions. [2023-08-26 16:24:12,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 193 transitions, 1639 flow [2023-08-26 16:24:12,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:24:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:24:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2023-08-26 16:24:12,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48977272727272725 [2023-08-26 16:24:12,399 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2023-08-26 16:24:12,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2023-08-26 16:24:12,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:24:12,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2023-08-26 16:24:12,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:24:12,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:12,402 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:12,402 INFO L175 Difference]: Start difference. First operand has 92 places, 72 transitions, 479 flow. Second operand 5 states and 862 transitions. [2023-08-26 16:24:12,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 193 transitions, 1639 flow [2023-08-26 16:24:12,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 193 transitions, 1604 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-26 16:24:12,685 INFO L231 Difference]: Finished difference. Result has 96 places, 71 transitions, 484 flow [2023-08-26 16:24:12,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=484, PETRI_PLACES=96, PETRI_TRANSITIONS=71} [2023-08-26 16:24:12,686 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 22 predicate places. [2023-08-26 16:24:12,686 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 71 transitions, 484 flow [2023-08-26 16:24:12,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:12,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:24:12,686 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, 1, 1, 1, 1] [2023-08-26 16:24:12,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 16:24:12,686 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:24:12,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:24:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1825113832, now seen corresponding path program 2 times [2023-08-26 16:24:12,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:24:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244219208] [2023-08-26 16:24:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:24:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:12,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:24:12,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244219208] [2023-08-26 16:24:12,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244219208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:24:12,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:24:12,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:24:12,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068761947] [2023-08-26 16:24:12,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:24:12,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:24:12,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:24:12,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:24:12,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:24:12,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 16:24:12,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 71 transitions, 484 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:12,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:24:12,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 16:24:12,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:24:15,291 INFO L124 PetriNetUnfolderBase]: 29667/36623 cut-off events. [2023-08-26 16:24:15,291 INFO L125 PetriNetUnfolderBase]: For 121024/121024 co-relation queries the response was YES. [2023-08-26 16:24:15,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168719 conditions, 36623 events. 29667/36623 cut-off events. For 121024/121024 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 148882 event pairs, 5405 based on Foata normal form. 924/37547 useless extension candidates. Maximal degree in co-relation 168695. Up to 19651 conditions per place. [2023-08-26 16:24:15,575 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 178 selfloop transitions, 8 changer transitions 0/186 dead transitions. [2023-08-26 16:24:15,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 186 transitions, 1562 flow [2023-08-26 16:24:15,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:24:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:24:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 859 transitions. [2023-08-26 16:24:15,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48806818181818185 [2023-08-26 16:24:15,578 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 859 transitions. [2023-08-26 16:24:15,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 859 transitions. [2023-08-26 16:24:15,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:24:15,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 859 transitions. [2023-08-26 16:24:15,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 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 16:24:15,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:15,582 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:15,582 INFO L175 Difference]: Start difference. First operand has 96 places, 71 transitions, 484 flow. Second operand 5 states and 859 transitions. [2023-08-26 16:24:15,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 186 transitions, 1562 flow [2023-08-26 16:24:15,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 186 transitions, 1549 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 16:24:15,871 INFO L231 Difference]: Finished difference. Result has 101 places, 74 transitions, 524 flow [2023-08-26 16:24:15,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=524, PETRI_PLACES=101, PETRI_TRANSITIONS=74} [2023-08-26 16:24:15,871 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 27 predicate places. [2023-08-26 16:24:15,871 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 74 transitions, 524 flow [2023-08-26 16:24:15,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:15,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:24:15,872 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, 1, 1, 1, 1] [2023-08-26 16:24:15,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 16:24:15,872 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:24:15,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:24:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1074145072, now seen corresponding path program 2 times [2023-08-26 16:24:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:24:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325022013] [2023-08-26 16:24:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:24:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:24:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325022013] [2023-08-26 16:24:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325022013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:24:15,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:24:15,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:24:15,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164429667] [2023-08-26 16:24:15,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:24:15,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:24:15,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:24:15,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:24:15,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:24:15,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 16:24:15,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 74 transitions, 524 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:15,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:24:15,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 16:24:15,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:24:19,146 INFO L124 PetriNetUnfolderBase]: 35535/43739 cut-off events. [2023-08-26 16:24:19,146 INFO L125 PetriNetUnfolderBase]: For 154806/154806 co-relation queries the response was YES. [2023-08-26 16:24:19,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208172 conditions, 43739 events. 35535/43739 cut-off events. For 154806/154806 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 184072 event pairs, 6259 based on Foata normal form. 1248/44987 useless extension candidates. Maximal degree in co-relation 208145. Up to 24523 conditions per place. [2023-08-26 16:24:19,516 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 194 selfloop transitions, 8 changer transitions 0/202 dead transitions. [2023-08-26 16:24:19,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 202 transitions, 1780 flow [2023-08-26 16:24:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:24:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:24:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 863 transitions. [2023-08-26 16:24:19,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4903409090909091 [2023-08-26 16:24:19,530 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 863 transitions. [2023-08-26 16:24:19,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 863 transitions. [2023-08-26 16:24:19,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:24:19,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 863 transitions. [2023-08-26 16:24:19,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.6) internal successors, (863), 5 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 16:24:19,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:19,533 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:19,533 INFO L175 Difference]: Start difference. First operand has 101 places, 74 transitions, 524 flow. Second operand 5 states and 863 transitions. [2023-08-26 16:24:19,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 202 transitions, 1780 flow [2023-08-26 16:24:20,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 202 transitions, 1700 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-08-26 16:24:20,328 INFO L231 Difference]: Finished difference. Result has 105 places, 77 transitions, 549 flow [2023-08-26 16:24:20,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=549, PETRI_PLACES=105, PETRI_TRANSITIONS=77} [2023-08-26 16:24:20,329 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 31 predicate places. [2023-08-26 16:24:20,329 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 77 transitions, 549 flow [2023-08-26 16:24:20,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:20,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:24:20,329 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, 1, 1, 1, 1] [2023-08-26 16:24:20,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 16:24:20,329 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:24:20,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:24:20,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1736590159, now seen corresponding path program 2 times [2023-08-26 16:24:20,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:24:20,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154277153] [2023-08-26 16:24:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:20,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:24:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:24:20,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154277153] [2023-08-26 16:24:20,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154277153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:24:20,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:24:20,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:24:20,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120871046] [2023-08-26 16:24:20,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:24:20,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:24:20,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:24:20,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:24:20,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:24:20,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 352 [2023-08-26 16:24:20,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 77 transitions, 549 flow. Second operand has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 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 16:24:20,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:24:20,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 352 [2023-08-26 16:24:20,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:24:23,472 INFO L124 PetriNetUnfolderBase]: 34839/42825 cut-off events. [2023-08-26 16:24:23,472 INFO L125 PetriNetUnfolderBase]: For 159454/159454 co-relation queries the response was YES. [2023-08-26 16:24:23,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207747 conditions, 42825 events. 34839/42825 cut-off events. For 159454/159454 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 177405 event pairs, 7415 based on Foata normal form. 62/42887 useless extension candidates. Maximal degree in co-relation 207718. Up to 41611 conditions per place. [2023-08-26 16:24:23,889 INFO L140 encePairwiseOnDemand]: 343/352 looper letters, 117 selfloop transitions, 13 changer transitions 3/133 dead transitions. [2023-08-26 16:24:23,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 133 transitions, 1067 flow [2023-08-26 16:24:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 16:24:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 16:24:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2023-08-26 16:24:23,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609375 [2023-08-26 16:24:23,891 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 649 transitions. [2023-08-26 16:24:23,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 649 transitions. [2023-08-26 16:24:23,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:24:23,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 649 transitions. [2023-08-26 16:24:23,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 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 16:24:23,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 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 16:24:23,894 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 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 16:24:23,894 INFO L175 Difference]: Start difference. First operand has 105 places, 77 transitions, 549 flow. Second operand 4 states and 649 transitions. [2023-08-26 16:24:23,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 133 transitions, 1067 flow [2023-08-26 16:24:24,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 133 transitions, 1039 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 16:24:24,948 INFO L231 Difference]: Finished difference. Result has 107 places, 82 transitions, 616 flow [2023-08-26 16:24:24,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=616, PETRI_PLACES=107, PETRI_TRANSITIONS=82} [2023-08-26 16:24:24,949 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 33 predicate places. [2023-08-26 16:24:24,949 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 82 transitions, 616 flow [2023-08-26 16:24:24,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 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 16:24:24,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:24:24,949 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, 1, 1, 1, 1] [2023-08-26 16:24:24,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 16:24:24,949 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:24:24,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:24:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1164287376, now seen corresponding path program 2 times [2023-08-26 16:24:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:24:24,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381779046] [2023-08-26 16:24:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:24:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:25,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:24:25,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381779046] [2023-08-26 16:24:25,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381779046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:24:25,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:24:25,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:24:25,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308463535] [2023-08-26 16:24:25,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:24:25,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:24:25,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:24:25,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:24:25,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:24:25,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 16:24:25,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 82 transitions, 616 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:25,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:24:25,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 16:24:25,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:24:28,532 INFO L124 PetriNetUnfolderBase]: 38983/47805 cut-off events. [2023-08-26 16:24:28,533 INFO L125 PetriNetUnfolderBase]: For 176150/176150 co-relation queries the response was YES. [2023-08-26 16:24:28,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226894 conditions, 47805 events. 38983/47805 cut-off events. For 176150/176150 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 195901 event pairs, 10351 based on Foata normal form. 836/48641 useless extension candidates. Maximal degree in co-relation 226864. Up to 30013 conditions per place. [2023-08-26 16:24:28,945 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 215 selfloop transitions, 9 changer transitions 0/224 dead transitions. [2023-08-26 16:24:28,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 224 transitions, 1957 flow [2023-08-26 16:24:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:24:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:24:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 867 transitions. [2023-08-26 16:24:28,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49261363636363636 [2023-08-26 16:24:28,947 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 867 transitions. [2023-08-26 16:24:28,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 867 transitions. [2023-08-26 16:24:28,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:24:28,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 867 transitions. [2023-08-26 16:24:28,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.4) internal successors, (867), 5 states have internal predecessors, (867), 0 states have call successors, (0), 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 16:24:28,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:28,951 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 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 16:24:28,951 INFO L175 Difference]: Start difference. First operand has 107 places, 82 transitions, 616 flow. Second operand 5 states and 867 transitions. [2023-08-26 16:24:28,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 224 transitions, 1957 flow [2023-08-26 16:24:29,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 224 transitions, 1935 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 16:24:29,394 INFO L231 Difference]: Finished difference. Result has 111 places, 85 transitions, 650 flow [2023-08-26 16:24:29,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=650, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2023-08-26 16:24:29,394 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 37 predicate places. [2023-08-26 16:24:29,394 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 650 flow [2023-08-26 16:24:29,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 16:24:29,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:24:29,395 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, 1, 1, 1, 1, 1] [2023-08-26 16:24:29,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 16:24:29,395 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:24:29,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:24:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash -790891101, now seen corresponding path program 1 times [2023-08-26 16:24:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:24:29,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191216618] [2023-08-26 16:24:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:29,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:24:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:29,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:24:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191216618] [2023-08-26 16:24:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191216618] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:24:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424951940] [2023-08-26 16:24:29,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:24:29,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:24:29,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:24:29,801 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 16:24:29,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 16:24:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:24:30,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 16:24:30,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:24:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:50,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:24:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:24:58,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424951940] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:24:58,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:24:58,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-08-26 16:24:58,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43720659] [2023-08-26 16:24:58,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:24:58,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 16:24:58,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:24:58,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 16:24:58,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=146, Unknown=7, NotChecked=0, Total=210 [2023-08-26 16:24:58,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 352 [2023-08-26 16:24:58,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 650 flow. Second operand has 15 states, 15 states have (on average 144.86666666666667) internal successors, (2173), 15 states have internal predecessors, (2173), 0 states have call successors, (0), 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 16:24:58,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:24:58,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 352 [2023-08-26 16:24:58,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:25:10,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:11,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:18,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:20,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:22,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:31,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:36,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:47,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:49,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:51,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:53,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:59,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:01,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:04,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:06,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:08,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:10,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:12,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:14,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:16,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:18,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:20,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:22,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:24,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:25,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:30,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:41,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:45,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:48,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:52,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:26:54,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:27:00,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:27:02,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:27:06,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:27:09,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:27:11,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:27:13,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:27:15,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:27:16,252 INFO L124 PetriNetUnfolderBase]: 60595/75085 cut-off events. [2023-08-26 16:27:16,252 INFO L125 PetriNetUnfolderBase]: For 286699/286699 co-relation queries the response was YES. [2023-08-26 16:27:16,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367102 conditions, 75085 events. 60595/75085 cut-off events. For 286699/286699 co-relation queries the response was YES. Maximal size of possible extension queue 1711. Compared 341239 event pairs, 8802 based on Foata normal form. 194/75279 useless extension candidates. Maximal degree in co-relation 367070. Up to 53855 conditions per place. [2023-08-26 16:27:17,013 INFO L140 encePairwiseOnDemand]: 342/352 looper letters, 469 selfloop transitions, 250 changer transitions 20/739 dead transitions. [2023-08-26 16:27:17,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 739 transitions, 6336 flow [2023-08-26 16:27:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 16:27:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 16:27:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3086 transitions. [2023-08-26 16:27:17,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46142344497607657 [2023-08-26 16:27:17,016 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3086 transitions. [2023-08-26 16:27:17,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3086 transitions. [2023-08-26 16:27:17,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:27:17,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3086 transitions. [2023-08-26 16:27:17,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 162.42105263157896) internal successors, (3086), 19 states have internal predecessors, (3086), 0 states have call successors, (0), 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 16:27:17,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 352.0) internal successors, (7040), 20 states have internal predecessors, (7040), 0 states have call successors, (0), 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 16:27:17,025 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 352.0) internal successors, (7040), 20 states have internal predecessors, (7040), 0 states have call successors, (0), 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 16:27:17,025 INFO L175 Difference]: Start difference. First operand has 111 places, 85 transitions, 650 flow. Second operand 19 states and 3086 transitions. [2023-08-26 16:27:17,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 739 transitions, 6336 flow [2023-08-26 16:27:19,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 739 transitions, 6150 flow, removed 66 selfloop flow, removed 1 redundant places. [2023-08-26 16:27:19,149 INFO L231 Difference]: Finished difference. Result has 143 places, 327 transitions, 3562 flow [2023-08-26 16:27:19,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3562, PETRI_PLACES=143, PETRI_TRANSITIONS=327} [2023-08-26 16:27:19,149 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 69 predicate places. [2023-08-26 16:27:19,149 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 327 transitions, 3562 flow [2023-08-26 16:27:19,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 144.86666666666667) internal successors, (2173), 15 states have internal predecessors, (2173), 0 states have call successors, (0), 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 16:27:19,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:27:19,150 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, 1, 1, 1, 1, 1] [2023-08-26 16:27:19,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 16:27:19,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-26 16:27:19,355 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:27:19,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:27:19,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1753687709, now seen corresponding path program 1 times [2023-08-26 16:27:19,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:27:19,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067610210] [2023-08-26 16:27:19,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:27:19,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:27:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:27:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:27:19,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:27:19,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067610210] [2023-08-26 16:27:19,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067610210] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:27:19,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552939248] [2023-08-26 16:27:19,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:27:19,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:27:19,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:27:19,853 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 16:27:19,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 16:27:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:27:20,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 16:27:20,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:28:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:28:23,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:28:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:28:49,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552939248] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:28:49,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:28:49,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 15 [2023-08-26 16:28:49,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619362333] [2023-08-26 16:28:49,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:28:49,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 16:28:49,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:28:49,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 16:28:49,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=187, Unknown=30, NotChecked=0, Total=272 [2023-08-26 16:28:49,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 352 [2023-08-26 16:28:49,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 327 transitions, 3562 flow. Second operand has 17 states, 17 states have (on average 144.11764705882354) internal successors, (2450), 17 states have internal predecessors, (2450), 0 states have call successors, (0), 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 16:28:49,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:28:49,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 352 [2023-08-26 16:28:49,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:29:37,599 WARN L234 SmtUtils]: Spent 44.89s on a formula simplification. DAG size of input: 96 DAG size of output: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:29:39,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:08,078 WARN L234 SmtUtils]: Spent 16.43s on a formula simplification. DAG size of input: 80 DAG size of output: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:30:10,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:14,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:16,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:18,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:21,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:24,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:26,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:28,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:30,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:32,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:34,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:36,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:30:38,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:04,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:07,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:09,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:14,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:18,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:22,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:25,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:29,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:31,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:32,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:33,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:35,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:37,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:40,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:31:54,108 INFO L124 PetriNetUnfolderBase]: 78131/97112 cut-off events. [2023-08-26 16:31:54,108 INFO L125 PetriNetUnfolderBase]: For 565064/565064 co-relation queries the response was YES. [2023-08-26 16:31:55,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554872 conditions, 97112 events. 78131/97112 cut-off events. For 565064/565064 co-relation queries the response was YES. Maximal size of possible extension queue 2267. Compared 462157 event pairs, 7697 based on Foata normal form. 97/97209 useless extension candidates. Maximal degree in co-relation 554824. Up to 80173 conditions per place. [2023-08-26 16:31:55,552 INFO L140 encePairwiseOnDemand]: 342/352 looper letters, 690 selfloop transitions, 178 changer transitions 10/878 dead transitions. [2023-08-26 16:31:55,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 878 transitions, 8781 flow [2023-08-26 16:31:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-26 16:31:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-26 16:31:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2646 transitions. [2023-08-26 16:31:55,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698153409090909 [2023-08-26 16:31:55,555 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2646 transitions. [2023-08-26 16:31:55,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2646 transitions. [2023-08-26 16:31:55,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:31:55,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2646 transitions. [2023-08-26 16:31:55,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 165.375) internal successors, (2646), 16 states have internal predecessors, (2646), 0 states have call successors, (0), 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 16:31:55,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 352.0) internal successors, (5984), 17 states have internal predecessors, (5984), 0 states have call successors, (0), 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 16:31:55,562 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 352.0) internal successors, (5984), 17 states have internal predecessors, (5984), 0 states have call successors, (0), 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 16:31:55,562 INFO L175 Difference]: Start difference. First operand has 143 places, 327 transitions, 3562 flow. Second operand 16 states and 2646 transitions. [2023-08-26 16:31:55,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 878 transitions, 8781 flow [2023-08-26 16:32:00,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 878 transitions, 8484 flow, removed 143 selfloop flow, removed 1 redundant places. [2023-08-26 16:32:00,533 INFO L231 Difference]: Finished difference. Result has 167 places, 497 transitions, 5591 flow [2023-08-26 16:32:00,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=3265, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5591, PETRI_PLACES=167, PETRI_TRANSITIONS=497} [2023-08-26 16:32:00,552 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 93 predicate places. [2023-08-26 16:32:00,552 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 497 transitions, 5591 flow [2023-08-26 16:32:00,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 144.11764705882354) internal successors, (2450), 17 states have internal predecessors, (2450), 0 states have call successors, (0), 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 16:32:00,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:32:00,553 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, 1, 1, 1, 1, 1] [2023-08-26 16:32:00,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 16:32:00,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-26 16:32:00,760 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:32:00,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:32:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1290985927, now seen corresponding path program 2 times [2023-08-26 16:32:00,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:32:00,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475510773] [2023-08-26 16:32:00,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:32:00,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:32:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:32:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:32:01,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:32:01,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475510773] [2023-08-26 16:32:01,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475510773] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:32:01,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972415025] [2023-08-26 16:32:01,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 16:32:01,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:32:01,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:32:01,163 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 16:32:01,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 16:32:01,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 16:32:01,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 16:32:01,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 16:32:01,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:32:52,203 WARN L234 SmtUtils]: Spent 7.07s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:33:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:33:08,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:33:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:33:31,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972415025] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:33:31,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:33:31,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-26 16:33:31,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788468773] [2023-08-26 16:33:31,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:33:31,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 16:33:31,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:33:31,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 16:33:31,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=158, Unknown=27, NotChecked=0, Total=240 [2023-08-26 16:33:31,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 352 [2023-08-26 16:33:31,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 497 transitions, 5591 flow. Second operand has 16 states, 16 states have (on average 144.9375) internal successors, (2319), 16 states have internal predecessors, (2319), 0 states have call successors, (0), 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 16:33:31,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:33:31,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 352 [2023-08-26 16:33:31,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:33:41,863 WARN L234 SmtUtils]: Spent 7.89s on a formula simplification. DAG size of input: 81 DAG size of output: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:33:44,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:33:46,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:33:47,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:33:49,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:33:51,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:33:54,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:33:56,014 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse6 (mod c_~x3~0 4294967296)) (.cse5 (mod (* (div (* (- 1) c_~x6~0) 2) 4294967295) 4294967296)) (.cse7 (mod (* 4294967295 (div (* (- 1) c_~x5~0) 2)) 4294967296))) (and (< 0 .cse0) (= .cse0 (mod c_~x2~0 4294967296)) (let ((.cse2 (* (div c_~x6~0 4294967296) 4294967296)) (.cse1 (* 4294967296 (div c_~n~0 4294967296))) (.cse4 (* (div c_~x5~0 4294967296) 4294967296))) (or (let ((.cse3 (+ .cse2 c_~x5~0))) (and (or (<= (+ .cse1 c_~x6~0 4) (+ .cse2 c_~n~0)) (< .cse3 (+ c_~x6~0 .cse4 1))) (<= (+ c_~x6~0 .cse4) .cse3))) (<= (+ .cse2 c_~x5~0 .cse1 4294967298) (+ c_~x6~0 c_~n~0 .cse4)))) (< .cse5 (mod c_~n~0 4294967296)) (= .cse6 (mod c_~x4~0 4294967296)) (< 0 .cse6) (= (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0) (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296))) (= (mod c_~x6~0 2) 0) (= (mod c_~x5~0 2) 0) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)) (< 0 .cse7) (= .cse5 .cse7))) is different from false [2023-08-26 16:33:57,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:34:00,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:34:02,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:34:03,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:34:06,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:34:09,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:05,594 WARN L234 SmtUtils]: Spent 44.42s on a formula simplification. DAG size of input: 69 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:35:18,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:20,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:22,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:24,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:26,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:28,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:30,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:32,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:34,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:36,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:38,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:40,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:42,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:44,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:46,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:49,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:51,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:52,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:54,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:35:56,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:36:54,662 WARN L234 SmtUtils]: Spent 41.43s on a formula simplification. DAG size of input: 70 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:36:57,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:36:59,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:03,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:05,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:07,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:09,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:11,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:13,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:15,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:17,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:19,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:21,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:23,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:25,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:27,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:29,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:31,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:32,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:34,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:36,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:38,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:41,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:43,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:45,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:47,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:49,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:51,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:53,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:55,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:57,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:37:59,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:38:01,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:38:03,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-26 16:38:05,148 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 16:38:05,187 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 16:38:06,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:38:06,167 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (30 of 31 remaining) [2023-08-26 16:38:06,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 16:38:06,182 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 [2023-08-26 16:38:06,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-26 16:38:06,368 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 16:38:06,369 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-08-26 16:38:06,369 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-08-26 16:38:06,369 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-08-26 16:38:06,370 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-08-26 16:38:06,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-08-26 16:38:06,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-08-26 16:38:06,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-08-26 16:38:06,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 31 remaining) [2023-08-26 16:38:06,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 31 remaining) [2023-08-26 16:38:06,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 31 remaining) [2023-08-26 16:38:06,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 31 remaining) [2023-08-26 16:38:06,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 31 remaining) [2023-08-26 16:38:06,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 31 remaining) [2023-08-26 16:38:06,371 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:38:06,373 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 16:38:06,373 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 16:38:06,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 04:38:06 BasicIcfg [2023-08-26 16:38:06,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 16:38:06,375 INFO L158 Benchmark]: Toolchain (without parser) took 861547.13ms. Allocated memory was 308.3MB in the beginning and 13.7GB in the end (delta: 13.4GB). Free memory was 284.6MB in the beginning and 8.8GB in the end (delta: -8.5GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. [2023-08-26 16:38:06,375 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 308.3MB. Free memory is still 284.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 16:38:06,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.26ms. Allocated memory is still 308.3MB. Free memory was 284.2MB in the beginning and 272.9MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 16:38:06,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.35ms. Allocated memory is still 308.3MB. Free memory was 272.9MB in the beginning and 270.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 16:38:06,376 INFO L158 Benchmark]: Boogie Preprocessor took 24.58ms. Allocated memory is still 308.3MB. Free memory was 270.9MB in the beginning and 269.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 16:38:06,376 INFO L158 Benchmark]: RCFGBuilder took 422.08ms. Allocated memory is still 308.3MB. Free memory was 269.2MB in the beginning and 248.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 16:38:06,376 INFO L158 Benchmark]: TraceAbstraction took 860911.06ms. Allocated memory was 308.3MB in the beginning and 13.7GB in the end (delta: 13.4GB). Free memory was 247.5MB in the beginning and 8.8GB in the end (delta: -8.5GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-08-26 16:38:06,389 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.10ms. Allocated memory is still 308.3MB. Free memory is still 284.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 141.26ms. Allocated memory is still 308.3MB. Free memory was 284.2MB in the beginning and 272.9MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.35ms. Allocated memory is still 308.3MB. Free memory was 272.9MB in the beginning and 270.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.58ms. Allocated memory is still 308.3MB. Free memory was 270.9MB in the beginning and 269.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 422.08ms. Allocated memory is still 308.3MB. Free memory was 269.2MB in the beginning and 248.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 860911.06ms. Allocated memory was 308.3MB in the beginning and 13.7GB in the end (delta: 13.4GB). Free memory was 247.5MB in the beginning and 8.8GB in the end (delta: -8.5GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 176 PlacesBefore, 74 PlacesAfterwards, 171 TransitionsBefore, 61 TransitionsAfterwards, 3780 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 12 ConcurrentYvCompositions, 8 ChoiceCompositions, 158 TotalNumberOfCompositions, 4775 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4775, independent: 4775, independent conditional: 0, independent unconditional: 4775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1930, independent: 1930, independent conditional: 0, independent unconditional: 1930, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4775, independent: 2845, independent conditional: 0, independent unconditional: 2845, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1930, unknown conditional: 0, unknown unconditional: 1930] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 217 locations, 31 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: 860.8s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 638.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 103 mSolverCounterUnknown, 2290 SdHoareTripleChecker+Valid, 329.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2290 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 326.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 207 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6422 IncrementalHoareTripleChecker+Invalid, 6857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 0 mSDtfsCounter, 6422 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 489 GetRequests, 348 SyntacticMatches, 10 SemanticMatches, 131 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 423.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5591occurred in iteration=28, InterpolantAutomatonStates: 136, 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.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 212.1s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 960 ConstructedInterpolants, 0 QuantifiedInterpolants, 26528 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2181 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 41 InterpolantComputations, 23 PerfectInterpolantSequences, 9/36 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 could not prove your program: Timeout Completed graceful shutdown