/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/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 14:09:12,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 14:09:12,717 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 14:09:12,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 14:09:12,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 14:09:12,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 14:09:12,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 14:09:12,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 14:09:12,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 14:09:12,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 14:09:12,737 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 14:09:12,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 14:09:12,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 14:09:12,737 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 14:09:12,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 14:09:12,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 14:09:12,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 14:09:12,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 14:09:12,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 14:09:12,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 14:09:12,741 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 14:09:12,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 14:09:12,742 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 14:09:12,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 14:09:12,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 14:09:12,742 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 14:09:12,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 14:09:12,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 14:09:12,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 14:09:12,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 14:09:12,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 14:09:12,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 14:09:12,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 14:09:12,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 14:09:12,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 14:09:12,744 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 14:09:12,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 14:09:13,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 14:09:13,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 14:09:13,008 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 14:09:13,008 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 14:09:13,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-26 14:09:14,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 14:09:14,336 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 14:09:14,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-26 14:09:14,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be072dcd8/3c4de4734507480596d93bd5ee893177/FLAG329da2fb5 [2023-08-26 14:09:14,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be072dcd8/3c4de4734507480596d93bd5ee893177 [2023-08-26 14:09:14,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 14:09:14,365 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 14:09:14,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 14:09:14,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 14:09:14,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 14:09:14,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4445fa33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14, skipping insertion in model container [2023-08-26 14:09:14,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,407 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 14:09:14,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 14:09:14,733 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 14:09:14,754 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 14:09:14,755 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 14:09:14,759 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-26 14:09:14,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 14:09:14,836 INFO L206 MainTranslator]: Completed translation [2023-08-26 14:09:14,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14 WrapperNode [2023-08-26 14:09:14,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 14:09:14,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 14:09:14,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 14:09:14,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 14:09:14,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,891 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 209 [2023-08-26 14:09:14,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 14:09:14,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 14:09:14,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 14:09:14,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 14:09:14,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 14:09:14,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 14:09:14,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 14:09:14,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 14:09:14,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (1/1) ... [2023-08-26 14:09:14,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 14:09:14,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:09:14,957 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 14:09:14,963 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 14:09:14,981 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-26 14:09:14,982 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-26 14:09:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-26 14:09:14,982 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-26 14:09:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 14:09:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 14:09:14,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 14:09:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 14:09:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 14:09:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 14:09:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 14:09:14,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 14:09:14,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 14:09:14,984 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 14:09:15,093 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 14:09:15,094 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 14:09:15,387 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 14:09:15,394 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 14:09:15,394 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 14:09:15,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:09:15 BoogieIcfgContainer [2023-08-26 14:09:15,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 14:09:15,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 14:09:15,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 14:09:15,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 14:09:15,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:09:14" (1/3) ... [2023-08-26 14:09:15,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be1c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:09:15, skipping insertion in model container [2023-08-26 14:09:15,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:14" (2/3) ... [2023-08-26 14:09:15,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be1c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:09:15, skipping insertion in model container [2023-08-26 14:09:15,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:09:15" (3/3) ... [2023-08-26 14:09:15,402 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-08-26 14:09:15,414 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 14:09:15,414 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-08-26 14:09:15,414 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 14:09:15,526 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 14:09:15,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 274 places, 282 transitions, 580 flow [2023-08-26 14:09:15,612 INFO L124 PetriNetUnfolderBase]: 15/280 cut-off events. [2023-08-26 14:09:15,612 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 14:09:15,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 280 events. 15/280 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 677 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 189. Up to 3 conditions per place. [2023-08-26 14:09:15,622 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 282 transitions, 580 flow [2023-08-26 14:09:15,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 271 transitions, 551 flow [2023-08-26 14:09:15,630 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 14:09:15,636 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 271 transitions, 551 flow [2023-08-26 14:09:15,638 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 271 transitions, 551 flow [2023-08-26 14:09:15,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 271 transitions, 551 flow [2023-08-26 14:09:15,676 INFO L124 PetriNetUnfolderBase]: 15/271 cut-off events. [2023-08-26 14:09:15,676 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 14:09:15,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 271 events. 15/271 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 605 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 189. Up to 3 conditions per place. [2023-08-26 14:09:15,685 INFO L119 LiptonReduction]: Number of co-enabled transitions 18460 [2023-08-26 14:09:26,835 INFO L134 LiptonReduction]: Checked pairs total: 58098 [2023-08-26 14:09:26,836 INFO L136 LiptonReduction]: Total number of compositions: 364 [2023-08-26 14:09:26,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 14:09:26,856 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;@1ddbc2d5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 14:09:26,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2023-08-26 14:09:26,857 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 14:09:26,857 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 14:09:26,858 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 14:09:26,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:26,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 14:09:26,858 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:26,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1197, now seen corresponding path program 1 times [2023-08-26 14:09:26,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:26,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584664894] [2023-08-26 14:09:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:26,991 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 14:09:26,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:26,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584664894] [2023-08-26 14:09:26,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584664894] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:26,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:26,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 14:09:26,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93769946] [2023-08-26 14:09:26,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:26,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 14:09:27,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:27,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 14:09:27,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 14:09:27,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 646 [2023-08-26 14:09:27,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 217 flow. Second operand has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:27,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:27,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 646 [2023-08-26 14:09:27,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:27,573 INFO L124 PetriNetUnfolderBase]: 4013/6423 cut-off events. [2023-08-26 14:09:27,573 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-08-26 14:09:27,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12628 conditions, 6423 events. 4013/6423 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 37134 event pairs, 3493 based on Foata normal form. 0/3205 useless extension candidates. Maximal degree in co-relation 12169. Up to 6135 conditions per place. [2023-08-26 14:09:27,607 INFO L140 encePairwiseOnDemand]: 610/646 looper letters, 61 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2023-08-26 14:09:27,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 267 flow [2023-08-26 14:09:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 14:09:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 14:09:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 635 transitions. [2023-08-26 14:09:27,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4914860681114551 [2023-08-26 14:09:27,623 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 635 transitions. [2023-08-26 14:09:27,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 635 transitions. [2023-08-26 14:09:27,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:27,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 635 transitions. [2023-08-26 14:09:27,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 317.5) internal successors, (635), 2 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:27,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:27,639 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:27,640 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 217 flow. Second operand 2 states and 635 transitions. [2023-08-26 14:09:27,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 267 flow [2023-08-26 14:09:27,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 14:09:27,645 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 140 flow [2023-08-26 14:09:27,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2023-08-26 14:09:27,648 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2023-08-26 14:09:27,648 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 140 flow [2023-08-26 14:09:27,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:27,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:27,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 14:09:27,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 14:09:27,649 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:27,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1181127, now seen corresponding path program 1 times [2023-08-26 14:09:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:27,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322129123] [2023-08-26 14:09:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:27,906 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 14:09:27,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:27,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322129123] [2023-08-26 14:09:27,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322129123] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:27,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:27,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:09:27,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450428098] [2023-08-26 14:09:27,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:27,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:09:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:27,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:09:27,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:09:27,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 646 [2023-08-26 14:09:27,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:27,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:27,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 646 [2023-08-26 14:09:27,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:28,293 INFO L124 PetriNetUnfolderBase]: 4304/6761 cut-off events. [2023-08-26 14:09:28,293 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 14:09:28,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13378 conditions, 6761 events. 4304/6761 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 37987 event pairs, 3770 based on Foata normal form. 0/3322 useless extension candidates. Maximal degree in co-relation 13375. Up to 6571 conditions per place. [2023-08-26 14:09:28,319 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 60 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-08-26 14:09:28,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 258 flow [2023-08-26 14:09:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:09:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:09:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2023-08-26 14:09:28,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34055727554179566 [2023-08-26 14:09:28,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 660 transitions. [2023-08-26 14:09:28,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 660 transitions. [2023-08-26 14:09:28,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:28,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 660 transitions. [2023-08-26 14:09:28,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:28,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:28,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:28,328 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 140 flow. Second operand 3 states and 660 transitions. [2023-08-26 14:09:28,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 258 flow [2023-08-26 14:09:28,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 14:09:28,330 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 138 flow [2023-08-26 14:09:28,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2023-08-26 14:09:28,331 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2023-08-26 14:09:28,333 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 138 flow [2023-08-26 14:09:28,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:28,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:28,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 14:09:28,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 14:09:28,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:28,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1181128, now seen corresponding path program 1 times [2023-08-26 14:09:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:28,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744770503] [2023-08-26 14:09:28,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:28,373 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 14:09:28,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744770503] [2023-08-26 14:09:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744770503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:28,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:28,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:09:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286181046] [2023-08-26 14:09:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:28,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:09:28,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:09:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:09:28,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 14:09:28,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:28,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:28,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 14:09:28,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:28,728 INFO L124 PetriNetUnfolderBase]: 4253/6661 cut-off events. [2023-08-26 14:09:28,728 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 14:09:28,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13183 conditions, 6661 events. 4253/6661 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 37227 event pairs, 3725 based on Foata normal form. 0/3293 useless extension candidates. Maximal degree in co-relation 13179. Up to 6474 conditions per place. [2023-08-26 14:09:28,745 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 58 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-08-26 14:09:28,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 252 flow [2023-08-26 14:09:28,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:09:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:09:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2023-08-26 14:09:28,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3364293085655315 [2023-08-26 14:09:28,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 652 transitions. [2023-08-26 14:09:28,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 652 transitions. [2023-08-26 14:09:28,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:28,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 652 transitions. [2023-08-26 14:09:28,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:28,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:28,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:28,752 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 138 flow. Second operand 3 states and 652 transitions. [2023-08-26 14:09:28,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 252 flow [2023-08-26 14:09:28,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:09:28,753 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 135 flow [2023-08-26 14:09:28,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2023-08-26 14:09:28,754 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 14:09:28,754 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 135 flow [2023-08-26 14:09:28,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:28,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:28,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 14:09:28,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 14:09:28,755 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:28,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1135090846, now seen corresponding path program 1 times [2023-08-26 14:09:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801719189] [2023-08-26 14:09:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:28,902 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 14:09:28,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801719189] [2023-08-26 14:09:28,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801719189] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:28,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:28,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 14:09:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601481674] [2023-08-26 14:09:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:28,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 14:09:28,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:28,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 14:09:28,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 14:09:28,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 646 [2023-08-26 14:09:28,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 196.25) internal successors, (785), 4 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:28,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:28,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 646 [2023-08-26 14:09:28,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:29,168 INFO L124 PetriNetUnfolderBase]: 3079/4910 cut-off events. [2023-08-26 14:09:29,168 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 14:09:29,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9727 conditions, 4910 events. 3079/4910 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 26660 event pairs, 2680 based on Foata normal form. 0/2645 useless extension candidates. Maximal degree in co-relation 9723. Up to 4768 conditions per place. [2023-08-26 14:09:29,180 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 57 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2023-08-26 14:09:29,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 249 flow [2023-08-26 14:09:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:09:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:09:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 644 transitions. [2023-08-26 14:09:29,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3323013415892673 [2023-08-26 14:09:29,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 644 transitions. [2023-08-26 14:09:29,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 644 transitions. [2023-08-26 14:09:29,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:29,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 644 transitions. [2023-08-26 14:09:29,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,187 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 135 flow. Second operand 3 states and 644 transitions. [2023-08-26 14:09:29,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 249 flow [2023-08-26 14:09:29,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:09:29,188 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 134 flow [2023-08-26 14:09:29,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-08-26 14:09:29,188 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 14:09:29,188 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 134 flow [2023-08-26 14:09:29,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 196.25) internal successors, (785), 4 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:29,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 14:09:29,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 14:09:29,189 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:29,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:29,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1135090845, now seen corresponding path program 1 times [2023-08-26 14:09:29,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:29,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199890867] [2023-08-26 14:09:29,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:29,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:29,237 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 14:09:29,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:29,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199890867] [2023-08-26 14:09:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199890867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:29,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 14:09:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117886654] [2023-08-26 14:09:29,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:29,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 14:09:29,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:29,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 14:09:29,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 14:09:29,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 14:09:29,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 195.25) internal successors, (781), 4 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:29,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 14:09:29,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:29,456 INFO L124 PetriNetUnfolderBase]: 1905/3159 cut-off events. [2023-08-26 14:09:29,456 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 14:09:29,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6271 conditions, 3159 events. 1905/3159 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 16660 event pairs, 1635 based on Foata normal form. 0/1997 useless extension candidates. Maximal degree in co-relation 6267. Up to 3062 conditions per place. [2023-08-26 14:09:29,468 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 56 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-08-26 14:09:29,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 246 flow [2023-08-26 14:09:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:09:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:09:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2023-08-26 14:09:29,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3302373581011352 [2023-08-26 14:09:29,471 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2023-08-26 14:09:29,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2023-08-26 14:09:29,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:29,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2023-08-26 14:09:29,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,476 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 134 flow. Second operand 3 states and 640 transitions. [2023-08-26 14:09:29,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 246 flow [2023-08-26 14:09:29,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:09:29,478 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 133 flow [2023-08-26 14:09:29,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2023-08-26 14:09:29,480 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 14:09:29,480 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 133 flow [2023-08-26 14:09:29,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.25) internal successors, (781), 4 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:29,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 14:09:29,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 14:09:29,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:29,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:29,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062955, now seen corresponding path program 1 times [2023-08-26 14:09:29,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:29,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210829906] [2023-08-26 14:09:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:29,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:29,616 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 14:09:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:29,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210829906] [2023-08-26 14:09:29,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210829906] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:29,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:29,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:09:29,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475555466] [2023-08-26 14:09:29,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:29,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:09:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:29,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:09:29,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:09:29,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 14:09:29,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:29,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 14:09:29,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:29,781 INFO L124 PetriNetUnfolderBase]: 1691/2803 cut-off events. [2023-08-26 14:09:29,781 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-26 14:09:29,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5564 conditions, 2803 events. 1691/2803 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 14367 event pairs, 1437 based on Foata normal form. 0/1843 useless extension candidates. Maximal degree in co-relation 5560. Up to 2712 conditions per place. [2023-08-26 14:09:29,788 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 53 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2023-08-26 14:09:29,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 235 flow [2023-08-26 14:09:29,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:09:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:09:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2023-08-26 14:09:29,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32972136222910214 [2023-08-26 14:09:29,791 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 639 transitions. [2023-08-26 14:09:29,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 639 transitions. [2023-08-26 14:09:29,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:29,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 639 transitions. [2023-08-26 14:09:29,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,795 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 133 flow. Second operand 3 states and 639 transitions. [2023-08-26 14:09:29,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 235 flow [2023-08-26 14:09:29,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:09:29,797 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 128 flow [2023-08-26 14:09:29,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-08-26 14:09:29,798 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -41 predicate places. [2023-08-26 14:09:29,799 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 128 flow [2023-08-26 14:09:29,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:29,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 14:09:29,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 14:09:29,799 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:29,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:29,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062954, now seen corresponding path program 1 times [2023-08-26 14:09:29,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:29,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809861905] [2023-08-26 14:09:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:29,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:29,898 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 14:09:29,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:29,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809861905] [2023-08-26 14:09:29,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809861905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:29,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:29,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:09:29,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391533627] [2023-08-26 14:09:29,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:29,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:09:29,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:29,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:09:29,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:09:29,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 14:09:29,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:29,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:29,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 14:09:29,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:30,049 INFO L124 PetriNetUnfolderBase]: 1428/2366 cut-off events. [2023-08-26 14:09:30,049 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 14:09:30,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4695 conditions, 2366 events. 1428/2366 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 11577 event pairs, 1194 based on Foata normal form. 0/1648 useless extension candidates. Maximal degree in co-relation 4691. Up to 2281 conditions per place. [2023-08-26 14:09:30,056 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 49 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-08-26 14:09:30,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 220 flow [2023-08-26 14:09:30,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:09:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:09:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2023-08-26 14:09:30,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3328173374613003 [2023-08-26 14:09:30,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2023-08-26 14:09:30,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2023-08-26 14:09:30,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:30,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2023-08-26 14:09:30,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,062 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 128 flow. Second operand 3 states and 645 transitions. [2023-08-26 14:09:30,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 220 flow [2023-08-26 14:09:30,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:09:30,063 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 121 flow [2023-08-26 14:09:30,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=119, 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=121, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2023-08-26 14:09:30,063 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -44 predicate places. [2023-08-26 14:09:30,063 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 121 flow [2023-08-26 14:09:30,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:30,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 14:09:30,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 14:09:30,064 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:30,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062968, now seen corresponding path program 1 times [2023-08-26 14:09:30,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:30,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079582437] [2023-08-26 14:09:30,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:30,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:30,218 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 14:09:30,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:30,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079582437] [2023-08-26 14:09:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079582437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:30,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:30,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:09:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683671513] [2023-08-26 14:09:30,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:30,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:09:30,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:30,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:09:30,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:09:30,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 646 [2023-08-26 14:09:30,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:30,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 646 [2023-08-26 14:09:30,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:30,384 INFO L124 PetriNetUnfolderBase]: 1367/2309 cut-off events. [2023-08-26 14:09:30,385 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-26 14:09:30,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4547 conditions, 2309 events. 1367/2309 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11609 event pairs, 879 based on Foata normal form. 0/1607 useless extension candidates. Maximal degree in co-relation 4543. Up to 2182 conditions per place. [2023-08-26 14:09:30,390 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 54 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-08-26 14:09:30,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 255 flow [2023-08-26 14:09:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:09:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:09:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2023-08-26 14:09:30,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37874097007223945 [2023-08-26 14:09:30,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 734 transitions. [2023-08-26 14:09:30,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 734 transitions. [2023-08-26 14:09:30,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:30,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 734 transitions. [2023-08-26 14:09:30,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,395 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,396 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 121 flow. Second operand 3 states and 734 transitions. [2023-08-26 14:09:30,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 255 flow [2023-08-26 14:09:30,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:09:30,397 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 146 flow [2023-08-26 14:09:30,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2023-08-26 14:09:30,397 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -42 predicate places. [2023-08-26 14:09:30,397 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 146 flow [2023-08-26 14:09:30,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:30,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 14:09:30,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 14:09:30,398 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:30,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash 827212352, now seen corresponding path program 1 times [2023-08-26 14:09:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:30,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802533371] [2023-08-26 14:09:30,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:30,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:30,618 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 14:09:30,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:30,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802533371] [2023-08-26 14:09:30,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802533371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:30,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:30,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 14:09:30,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194831684] [2023-08-26 14:09:30,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:30,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 14:09:30,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:30,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 14:09:30,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 14:09:30,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 646 [2023-08-26 14:09:30,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:30,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 646 [2023-08-26 14:09:30,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:30,826 INFO L124 PetriNetUnfolderBase]: 1758/2954 cut-off events. [2023-08-26 14:09:30,826 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2023-08-26 14:09:30,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6046 conditions, 2954 events. 1758/2954 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 15717 event pairs, 429 based on Foata normal form. 29/2149 useless extension candidates. Maximal degree in co-relation 6041. Up to 2264 conditions per place. [2023-08-26 14:09:30,835 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 74 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2023-08-26 14:09:30,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 367 flow [2023-08-26 14:09:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:09:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:09:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2023-08-26 14:09:30,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325593395252838 [2023-08-26 14:09:30,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 631 transitions. [2023-08-26 14:09:30,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 631 transitions. [2023-08-26 14:09:30,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:30,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 631 transitions. [2023-08-26 14:09:30,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,842 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 146 flow. Second operand 3 states and 631 transitions. [2023-08-26 14:09:30,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 367 flow [2023-08-26 14:09:30,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 85 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:09:30,843 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 178 flow [2023-08-26 14:09:30,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2023-08-26 14:09:30,845 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2023-08-26 14:09:30,845 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 178 flow [2023-08-26 14:09:30,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:30,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 14:09:30,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 14:09:30,846 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:30,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash 827214629, now seen corresponding path program 1 times [2023-08-26 14:09:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:30,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801699419] [2023-08-26 14:09:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:30,973 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 14:09:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801699419] [2023-08-26 14:09:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801699419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:30,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:30,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 14:09:30,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492350381] [2023-08-26 14:09:30,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:30,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 14:09:30,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:30,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 14:09:30,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 14:09:30,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 646 [2023-08-26 14:09:30,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 188.5) internal successors, (754), 4 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:30,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:30,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 646 [2023-08-26 14:09:30,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:31,213 INFO L124 PetriNetUnfolderBase]: 1851/3141 cut-off events. [2023-08-26 14:09:31,213 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2023-08-26 14:09:31,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6615 conditions, 3141 events. 1851/3141 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 16988 event pairs, 741 based on Foata normal form. 0/2411 useless extension candidates. Maximal degree in co-relation 6609. Up to 1892 conditions per place. [2023-08-26 14:09:31,222 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 82 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2023-08-26 14:09:31,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 406 flow [2023-08-26 14:09:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 14:09:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 14:09:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 830 transitions. [2023-08-26 14:09:31,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32120743034055727 [2023-08-26 14:09:31,225 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 830 transitions. [2023-08-26 14:09:31,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 830 transitions. [2023-08-26 14:09:31,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:31,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 830 transitions. [2023-08-26 14:09:31,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 207.5) internal successors, (830), 4 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,230 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,230 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 178 flow. Second operand 4 states and 830 transitions. [2023-08-26 14:09:31,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 406 flow [2023-08-26 14:09:31,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:09:31,232 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 173 flow [2023-08-26 14:09:31,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2023-08-26 14:09:31,233 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 14:09:31,233 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 173 flow [2023-08-26 14:09:31,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.5) internal successors, (754), 4 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:31,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:09:31,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 14:09:31,234 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:31,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:31,234 INFO L85 PathProgramCache]: Analyzing trace with hash -986612324, now seen corresponding path program 1 times [2023-08-26 14:09:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:31,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452674912] [2023-08-26 14:09:31,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:31,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:31,291 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 14:09:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452674912] [2023-08-26 14:09:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452674912] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:31,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:31,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 14:09:31,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803198234] [2023-08-26 14:09:31,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:31,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:09:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:31,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:09:31,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:09:31,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 646 [2023-08-26 14:09:31,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:31,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 646 [2023-08-26 14:09:31,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:31,391 INFO L124 PetriNetUnfolderBase]: 614/1214 cut-off events. [2023-08-26 14:09:31,391 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-08-26 14:09:31,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2536 conditions, 1214 events. 614/1214 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6257 event pairs, 387 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 2529. Up to 627 conditions per place. [2023-08-26 14:09:31,394 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 51 selfloop transitions, 2 changer transitions 8/68 dead transitions. [2023-08-26 14:09:31,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 311 flow [2023-08-26 14:09:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:09:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:09:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2023-08-26 14:09:31,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43653250773993807 [2023-08-26 14:09:31,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 846 transitions. [2023-08-26 14:09:31,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 846 transitions. [2023-08-26 14:09:31,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:31,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 846 transitions. [2023-08-26 14:09:31,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,400 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 173 flow. Second operand 3 states and 846 transitions. [2023-08-26 14:09:31,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 311 flow [2023-08-26 14:09:31,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:09:31,402 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 165 flow [2023-08-26 14:09:31,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-08-26 14:09:31,403 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2023-08-26 14:09:31,403 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 165 flow [2023-08-26 14:09:31,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:31,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:09:31,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 14:09:31,403 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:31,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:31,404 INFO L85 PathProgramCache]: Analyzing trace with hash -589188273, now seen corresponding path program 1 times [2023-08-26 14:09:31,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:31,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065443659] [2023-08-26 14:09:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:31,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:31,477 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 14:09:31,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:31,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065443659] [2023-08-26 14:09:31,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065443659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:31,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:31,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 14:09:31,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522070348] [2023-08-26 14:09:31,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:31,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 14:09:31,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:31,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 14:09:31,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 14:09:31,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 14:09:31,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:31,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 14:09:31,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:31,562 INFO L124 PetriNetUnfolderBase]: 539/1036 cut-off events. [2023-08-26 14:09:31,562 INFO L125 PetriNetUnfolderBase]: For 136/138 co-relation queries the response was YES. [2023-08-26 14:09:31,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1036 events. 539/1036 cut-off events. For 136/138 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4957 event pairs, 464 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 2258. Up to 992 conditions per place. [2023-08-26 14:09:31,565 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 49 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-26 14:09:31,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 53 transitions, 261 flow [2023-08-26 14:09:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 14:09:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 14:09:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2023-08-26 14:09:31,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32920536635706915 [2023-08-26 14:09:31,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 638 transitions. [2023-08-26 14:09:31,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 638 transitions. [2023-08-26 14:09:31,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:31,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 638 transitions. [2023-08-26 14:09:31,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 646.0) internal successors, (2584), 4 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,570 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 165 flow. Second operand 3 states and 638 transitions. [2023-08-26 14:09:31,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 53 transitions, 261 flow [2023-08-26 14:09:31,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 14:09:31,573 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 159 flow [2023-08-26 14:09:31,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=62, 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=159, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-08-26 14:09:31,573 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2023-08-26 14:09:31,573 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 159 flow [2023-08-26 14:09:31,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:31,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:09:31,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 14:09:31,574 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:31,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash -589188272, now seen corresponding path program 1 times [2023-08-26 14:09:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:31,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25996574] [2023-08-26 14:09:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:31,819 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 14:09:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25996574] [2023-08-26 14:09:31,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25996574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:31,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:31,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 14:09:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256056448] [2023-08-26 14:09:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:31,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 14:09:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:31,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 14:09:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 14:09:31,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 646 [2023-08-26 14:09:31,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 208.2) internal successors, (1041), 5 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:31,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 646 [2023-08-26 14:09:31,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:31,963 INFO L124 PetriNetUnfolderBase]: 532/1024 cut-off events. [2023-08-26 14:09:31,963 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-08-26 14:09:31,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2224 conditions, 1024 events. 532/1024 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4931 event pairs, 367 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 2216. Up to 967 conditions per place. [2023-08-26 14:09:31,966 INFO L140 encePairwiseOnDemand]: 639/646 looper letters, 53 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-08-26 14:09:31,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 318 flow [2023-08-26 14:09:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 14:09:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 14:09:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1296 transitions. [2023-08-26 14:09:31,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33436532507739936 [2023-08-26 14:09:31,968 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1296 transitions. [2023-08-26 14:09:31,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1296 transitions. [2023-08-26 14:09:31,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:31,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1296 transitions. [2023-08-26 14:09:31,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,975 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,975 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 159 flow. Second operand 6 states and 1296 transitions. [2023-08-26 14:09:31,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 318 flow [2023-08-26 14:09:31,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 14:09:31,976 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 216 flow [2023-08-26 14:09:31,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2023-08-26 14:09:31,976 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -33 predicate places. [2023-08-26 14:09:31,976 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 216 flow [2023-08-26 14:09:31,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 208.2) internal successors, (1041), 5 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:31,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:31,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:09:31,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 14:09:31,977 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:31,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:31,977 INFO L85 PathProgramCache]: Analyzing trace with hash -568180776, now seen corresponding path program 1 times [2023-08-26 14:09:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:31,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992037597] [2023-08-26 14:09:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:31,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:32,563 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 14:09:32,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:32,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992037597] [2023-08-26 14:09:32,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992037597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:32,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:32,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 14:09:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917568612] [2023-08-26 14:09:32,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:32,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 14:09:32,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:32,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 14:09:32,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 14:09:32,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 14:09:32,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 174.71428571428572) internal successors, (1223), 7 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:32,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:32,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 14:09:32,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:32,987 INFO L124 PetriNetUnfolderBase]: 610/1166 cut-off events. [2023-08-26 14:09:32,987 INFO L125 PetriNetUnfolderBase]: For 213/215 co-relation queries the response was YES. [2023-08-26 14:09:32,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 1166 events. 610/1166 cut-off events. For 213/215 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5709 event pairs, 172 based on Foata normal form. 9/1073 useless extension candidates. Maximal degree in co-relation 2636. Up to 767 conditions per place. [2023-08-26 14:09:32,991 INFO L140 encePairwiseOnDemand]: 637/646 looper letters, 81 selfloop transitions, 15 changer transitions 0/99 dead transitions. [2023-08-26 14:09:32,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 507 flow [2023-08-26 14:09:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 14:09:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 14:09:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2023-08-26 14:09:32,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2917956656346749 [2023-08-26 14:09:32,994 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2023-08-26 14:09:32,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2023-08-26 14:09:32,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:32,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2023-08-26 14:09:33,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,004 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,005 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 216 flow. Second operand 6 states and 1131 transitions. [2023-08-26 14:09:33,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 507 flow [2023-08-26 14:09:33,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 99 transitions, 499 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 14:09:33,007 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 279 flow [2023-08-26 14:09:33,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=78, PETRI_TRANSITIONS=63} [2023-08-26 14:09:33,008 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -26 predicate places. [2023-08-26 14:09:33,008 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 279 flow [2023-08-26 14:09:33,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.71428571428572) internal successors, (1223), 7 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:33,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:09:33,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 14:09:33,009 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:33,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1718431846, now seen corresponding path program 2 times [2023-08-26 14:09:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:33,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726835989] [2023-08-26 14:09:33,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:33,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:33,318 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 14:09:33,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:33,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726835989] [2023-08-26 14:09:33,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726835989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:33,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:33,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 14:09:33,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822131514] [2023-08-26 14:09:33,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:33,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 14:09:33,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:33,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 14:09:33,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 14:09:33,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 14:09:33,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 63 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 174.71428571428572) internal successors, (1223), 7 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:33,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 14:09:33,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:33,574 INFO L124 PetriNetUnfolderBase]: 665/1278 cut-off events. [2023-08-26 14:09:33,574 INFO L125 PetriNetUnfolderBase]: For 384/386 co-relation queries the response was YES. [2023-08-26 14:09:33,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3069 conditions, 1278 events. 665/1278 cut-off events. For 384/386 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6503 event pairs, 327 based on Foata normal form. 9/1185 useless extension candidates. Maximal degree in co-relation 3054. Up to 754 conditions per place. [2023-08-26 14:09:33,578 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 92 selfloop transitions, 16 changer transitions 0/111 dead transitions. [2023-08-26 14:09:33,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 111 transitions, 614 flow [2023-08-26 14:09:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 14:09:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 14:09:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1488 transitions. [2023-08-26 14:09:33,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28792569659442724 [2023-08-26 14:09:33,582 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1488 transitions. [2023-08-26 14:09:33,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1488 transitions. [2023-08-26 14:09:33,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:33,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1488 transitions. [2023-08-26 14:09:33,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 646.0) internal successors, (5814), 9 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,589 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 646.0) internal successors, (5814), 9 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,589 INFO L175 Difference]: Start difference. First operand has 78 places, 63 transitions, 279 flow. Second operand 8 states and 1488 transitions. [2023-08-26 14:09:33,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 111 transitions, 614 flow [2023-08-26 14:09:33,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 111 transitions, 591 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-26 14:09:33,593 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 316 flow [2023-08-26 14:09:33,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=316, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2023-08-26 14:09:33,593 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -19 predicate places. [2023-08-26 14:09:33,593 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 316 flow [2023-08-26 14:09:33,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.71428571428572) internal successors, (1223), 7 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:33,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:09:33,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 14:09:33,594 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:33,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:33,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1081892096, now seen corresponding path program 3 times [2023-08-26 14:09:33,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:33,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392776942] [2023-08-26 14:09:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:33,727 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 14:09:33,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:33,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392776942] [2023-08-26 14:09:33,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392776942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:33,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:33,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 14:09:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930026270] [2023-08-26 14:09:33,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:33,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 14:09:33,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:33,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 14:09:33,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 14:09:33,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 646 [2023-08-26 14:09:33,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 191.4) internal successors, (957), 5 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:33,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 646 [2023-08-26 14:09:33,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:33,850 INFO L124 PetriNetUnfolderBase]: 537/1003 cut-off events. [2023-08-26 14:09:33,850 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2023-08-26 14:09:33,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 1003 events. 537/1003 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4524 event pairs, 363 based on Foata normal form. 10/967 useless extension candidates. Maximal degree in co-relation 2577. Up to 566 conditions per place. [2023-08-26 14:09:33,853 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 71 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2023-08-26 14:09:33,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 499 flow [2023-08-26 14:09:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 14:09:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 14:09:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 819 transitions. [2023-08-26 14:09:33,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3169504643962848 [2023-08-26 14:09:33,855 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 819 transitions. [2023-08-26 14:09:33,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 819 transitions. [2023-08-26 14:09:33,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:33,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 819 transitions. [2023-08-26 14:09:33,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 204.75) internal successors, (819), 4 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,860 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 646.0) internal successors, (3230), 5 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,860 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 316 flow. Second operand 4 states and 819 transitions. [2023-08-26 14:09:33,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 499 flow [2023-08-26 14:09:33,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 455 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-08-26 14:09:33,863 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 281 flow [2023-08-26 14:09:33,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2023-08-26 14:09:33,864 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -21 predicate places. [2023-08-26 14:09:33,864 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 281 flow [2023-08-26 14:09:33,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.4) internal successors, (957), 5 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:33,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:33,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:09:33,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 14:09:33,865 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:33,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1118902209, now seen corresponding path program 1 times [2023-08-26 14:09:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708871076] [2023-08-26 14:09:33,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:34,263 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 14:09:34,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:34,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708871076] [2023-08-26 14:09:34,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708871076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 14:09:34,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 14:09:34,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 14:09:34,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360243550] [2023-08-26 14:09:34,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 14:09:34,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 14:09:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:34,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 14:09:34,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 14:09:34,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 14:09:34,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 281 flow. Second operand has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:34,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:34,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 14:09:34,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:34,486 INFO L124 PetriNetUnfolderBase]: 517/980 cut-off events. [2023-08-26 14:09:34,486 INFO L125 PetriNetUnfolderBase]: For 320/320 co-relation queries the response was YES. [2023-08-26 14:09:34,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 980 events. 517/980 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4401 event pairs, 136 based on Foata normal form. 9/937 useless extension candidates. Maximal degree in co-relation 2442. Up to 571 conditions per place. [2023-08-26 14:09:34,490 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 72 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2023-08-26 14:09:34,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 88 transitions, 509 flow [2023-08-26 14:09:34,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 14:09:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 14:09:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1115 transitions. [2023-08-26 14:09:34,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28766769865841074 [2023-08-26 14:09:34,492 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1115 transitions. [2023-08-26 14:09:34,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1115 transitions. [2023-08-26 14:09:34,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:34,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1115 transitions. [2023-08-26 14:09:34,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:34,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:34,498 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 646.0) internal successors, (4522), 7 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:34,498 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 281 flow. Second operand 6 states and 1115 transitions. [2023-08-26 14:09:34,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 88 transitions, 509 flow [2023-08-26 14:09:34,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 88 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 14:09:34,500 INFO L231 Difference]: Finished difference. Result has 87 places, 65 transitions, 318 flow [2023-08-26 14:09:34,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=87, PETRI_TRANSITIONS=65} [2023-08-26 14:09:34,500 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -17 predicate places. [2023-08-26 14:09:34,500 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 65 transitions, 318 flow [2023-08-26 14:09:34,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:34,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:34,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:09:34,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 14:09:34,501 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:34,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash 693396545, now seen corresponding path program 1 times [2023-08-26 14:09:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:34,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810982519] [2023-08-26 14:09:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:35,006 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 14:09:35,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:35,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810982519] [2023-08-26 14:09:35,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810982519] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:09:35,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947555455] [2023-08-26 14:09:35,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:35,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:09:35,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:09:35,009 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 14:09:35,010 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 14:09:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:35,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-26 14:09:35,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:09:35,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:35,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:35,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:35,183 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 14:09:35,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:35,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:35,199 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 14:09:35,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 14:09:35,214 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 14:09:35,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 14:09:35,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2023-08-26 14:09:35,429 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2023-08-26 14:09:35,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2023-08-26 14:09:35,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:35,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2023-08-26 14:09:35,691 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 14:09:35,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:09:35,715 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_574 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_574 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:09:35,728 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_574 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_574 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-08-26 14:09:35,804 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_571 Int) (v_ArrVal_574 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_571) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_571 Int) (v_ArrVal_574 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_571) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-08-26 14:09:40,139 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 14:09:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947555455] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:09:40,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:09:40,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-26 14:09:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196112581] [2023-08-26 14:09:40,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:09:40,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-26 14:09:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:09:40,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-26 14:09:40,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=400, Unknown=5, NotChecked=132, Total=650 [2023-08-26 14:09:40,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 14:09:40,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 65 transitions, 318 flow. Second operand has 26 states, 26 states have (on average 174.5) internal successors, (4537), 26 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:40,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:09:40,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 14:09:40,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:09:45,697 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 [1] [2023-08-26 14:09:53,173 WARN L234 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:09:53,274 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ (select .cse2 .cse4) 1)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (forall ((v_ArrVal_571 Int) (v_ArrVal_574 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_571) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|)))) (.cse1 (forall ((v_ArrVal_571 Int) (v_ArrVal_574 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_571) .cse4 .cse5)) |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (and .cse0 (or (< (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (and .cse0 .cse1)) .cse1)))) is different from false [2023-08-26 14:09:53,491 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_574 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4)) .cse2)) (forall ((v_ArrVal_574 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_574 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_574 (Array Int Int))) (<= (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_574) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2))))) is different from false [2023-08-26 14:09:54,097 INFO L124 PetriNetUnfolderBase]: 672/1286 cut-off events. [2023-08-26 14:09:54,097 INFO L125 PetriNetUnfolderBase]: For 681/681 co-relation queries the response was YES. [2023-08-26 14:09:54,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3313 conditions, 1286 events. 672/1286 cut-off events. For 681/681 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6397 event pairs, 456 based on Foata normal form. 11/1218 useless extension candidates. Maximal degree in co-relation 3295. Up to 963 conditions per place. [2023-08-26 14:09:54,123 INFO L140 encePairwiseOnDemand]: 632/646 looper letters, 92 selfloop transitions, 37 changer transitions 0/132 dead transitions. [2023-08-26 14:09:54,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 132 transitions, 816 flow [2023-08-26 14:09:54,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-26 14:09:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-26 14:09:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3583 transitions. [2023-08-26 14:09:54,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2773219814241486 [2023-08-26 14:09:54,147 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3583 transitions. [2023-08-26 14:09:54,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3583 transitions. [2023-08-26 14:09:54,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:09:54,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3583 transitions. [2023-08-26 14:09:54,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 179.15) internal successors, (3583), 20 states have internal predecessors, (3583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:54,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 646.0) internal successors, (13566), 21 states have internal predecessors, (13566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:54,179 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 646.0) internal successors, (13566), 21 states have internal predecessors, (13566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:54,179 INFO L175 Difference]: Start difference. First operand has 87 places, 65 transitions, 318 flow. Second operand 20 states and 3583 transitions. [2023-08-26 14:09:54,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 132 transitions, 816 flow [2023-08-26 14:09:54,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 132 transitions, 788 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 14:09:54,183 INFO L231 Difference]: Finished difference. Result has 111 places, 92 transitions, 564 flow [2023-08-26 14:09:54,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=564, PETRI_PLACES=111, PETRI_TRANSITIONS=92} [2023-08-26 14:09:54,184 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 7 predicate places. [2023-08-26 14:09:54,184 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 92 transitions, 564 flow [2023-08-26 14:09:54,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 174.5) internal successors, (4537), 26 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:09:54,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:09:54,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:09:54,199 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 14:09:54,390 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,SelfDestructingSolverStorable17 [2023-08-26 14:09:54,390 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:09:54,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:09:54,390 INFO L85 PathProgramCache]: Analyzing trace with hash -593236279, now seen corresponding path program 1 times [2023-08-26 14:09:54,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:09:54,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531523823] [2023-08-26 14:09:54,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:09:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:55,002 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 14:09:55,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:09:55,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531523823] [2023-08-26 14:09:55,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531523823] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:09:55,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592262943] [2023-08-26 14:09:55,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:09:55,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:09:55,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:09:55,004 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 14:09:55,005 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 14:09:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:09:55,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-26 14:09:55,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:09:55,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:55,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:55,202 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 14:09:55,202 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 14:09:55,216 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 14:09:55,216 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 14:09:55,286 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-08-26 14:09:55,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 14:09:55,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-26 14:09:55,591 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-08-26 14:09:55,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:09:55,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2023-08-26 14:09:55,680 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 14:09:55,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:09:55,706 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:09:55,714 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:09:55,721 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:09:55,743 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_666 Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_666) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_666 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_666) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)))))) is different from false [2023-08-26 14:09:55,764 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:09:55,764 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 94 [2023-08-26 14:10:02,689 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 14:10:02,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592262943] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:10:02,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:10:02,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 26 [2023-08-26 14:10:02,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410683338] [2023-08-26 14:10:02,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:10:02,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-26 14:10:02,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:10:02,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-26 14:10:02,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=456, Unknown=5, NotChecked=188, Total=756 [2023-08-26 14:10:02,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 14:10:02,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 92 transitions, 564 flow. Second operand has 28 states, 28 states have (on average 169.5) internal successors, (4746), 28 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:10:02,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:10:02,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 14:10:02,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:10:17,507 INFO L124 PetriNetUnfolderBase]: 1316/2526 cut-off events. [2023-08-26 14:10:17,507 INFO L125 PetriNetUnfolderBase]: For 1953/1953 co-relation queries the response was YES. [2023-08-26 14:10:17,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6766 conditions, 2526 events. 1316/2526 cut-off events. For 1953/1953 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 14516 event pairs, 420 based on Foata normal form. 29/2415 useless extension candidates. Maximal degree in co-relation 6739. Up to 703 conditions per place. [2023-08-26 14:10:17,519 INFO L140 encePairwiseOnDemand]: 627/646 looper letters, 189 selfloop transitions, 85 changer transitions 0/277 dead transitions. [2023-08-26 14:10:17,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 277 transitions, 1696 flow [2023-08-26 14:10:17,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-26 14:10:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-26 14:10:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3609 transitions. [2023-08-26 14:10:17,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2793343653250774 [2023-08-26 14:10:17,527 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3609 transitions. [2023-08-26 14:10:17,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3609 transitions. [2023-08-26 14:10:17,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:10:17,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3609 transitions. [2023-08-26 14:10:17,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 180.45) internal successors, (3609), 20 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:10:17,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 646.0) internal successors, (13566), 21 states have internal predecessors, (13566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:10:17,542 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 646.0) internal successors, (13566), 21 states have internal predecessors, (13566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:10:17,542 INFO L175 Difference]: Start difference. First operand has 111 places, 92 transitions, 564 flow. Second operand 20 states and 3609 transitions. [2023-08-26 14:10:17,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 277 transitions, 1696 flow [2023-08-26 14:10:17,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 277 transitions, 1600 flow, removed 36 selfloop flow, removed 6 redundant places. [2023-08-26 14:10:17,554 INFO L231 Difference]: Finished difference. Result has 135 places, 140 transitions, 1058 flow [2023-08-26 14:10:17,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1058, PETRI_PLACES=135, PETRI_TRANSITIONS=140} [2023-08-26 14:10:17,554 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 31 predicate places. [2023-08-26 14:10:17,554 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 140 transitions, 1058 flow [2023-08-26 14:10:17,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 169.5) internal successors, (4746), 28 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:10:17,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:10:17,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:10:17,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 14:10:17,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:10:17,763 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:10:17,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:10:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash 178425857, now seen corresponding path program 2 times [2023-08-26 14:10:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:10:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903374275] [2023-08-26 14:10:17,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:10:17,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:10:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:10:18,284 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 14:10:18,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:10:18,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903374275] [2023-08-26 14:10:18,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903374275] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:10:18,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802773717] [2023-08-26 14:10:18,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 14:10:18,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:10:18,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:10:18,286 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 14:10:18,288 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 14:10:18,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 14:10:18,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 14:10:18,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-26 14:10:18,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:10:18,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:10:18,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:10:18,436 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 14:10:18,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 14:10:18,451 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 14:10:18,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 14:10:18,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 14:10:18,639 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-26 14:10:18,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-26 14:10:18,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-26 14:10:18,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:10:18,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-26 14:10:18,883 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 14:10:18,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:10:18,907 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_767 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_767 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:10:18,915 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_767 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_767 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:10:18,923 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_767 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_767 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:10:18,931 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_767 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_764))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse3)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_767 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_764))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse3))))))) is different from false [2023-08-26 14:10:18,947 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_763 Int) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_763)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_764))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_763 Int) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_763)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_764))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:10:18,965 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:10:18,966 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 162 [2023-08-26 14:10:29,990 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 14:10:29,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802773717] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:10:29,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:10:29,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2023-08-26 14:10:29,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441190128] [2023-08-26 14:10:29,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:10:29,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-26 14:10:29,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:10:29,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-26 14:10:29,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=413, Unknown=12, NotChecked=230, Total=756 [2023-08-26 14:10:29,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 14:10:29,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 140 transitions, 1058 flow. Second operand has 28 states, 28 states have (on average 169.5) internal successors, (4746), 28 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:10:29,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:10:29,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 14:10:29,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:10:54,120 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 [0, 1] [2023-08-26 14:10:56,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:10:58,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:11:00,581 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 [0, 1] [2023-08-26 14:11:02,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:11:05,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:11:07,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:11:09,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:11:11,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:11:13,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:11:15,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:11:19,387 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 [0, 1] [2023-08-26 14:11:21,808 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 [0, 1] [2023-08-26 14:11:23,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:11:26,503 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 [0, 1] [2023-08-26 14:11:59,243 WARN L234 SmtUtils]: Spent 23.36s on a formula simplification. DAG size of input: 143 DAG size of output: 143 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:12:01,424 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 [0, 1] [2023-08-26 14:12:03,946 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 [0, 1] [2023-08-26 14:12:05,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:12:07,965 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 [0, 1] [2023-08-26 14:12:11,293 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 [0, 1] [2023-08-26 14:12:13,532 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 [0, 1] [2023-08-26 14:12:15,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:12:18,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:12:21,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:12:23,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:12:25,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:12:27,968 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 [0, 1] [2023-08-26 14:12:31,942 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 [0, 1] [2023-08-26 14:12:34,547 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 [0, 1] [2023-08-26 14:12:36,748 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 [0, 1] [2023-08-26 14:12:39,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:12:42,587 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 [0, 1] [2023-08-26 14:12:44,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:12:47,421 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 [1] [2023-08-26 14:12:49,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:12:51,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:12:54,237 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_763 Int) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_763)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_764))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_763 Int) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (< (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_763)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_764))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|) (+ 3209 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (forall ((v_prenex_3 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_prenex_3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_5))) (store .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse9 .cse2 (+ (select .cse9 .cse2) 1))))) |c_~#stored_elements~0.base| v_prenex_4) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_763 Int) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_763)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_764))) (store .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (select .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse11 .cse2 (+ (select .cse11 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:12:57,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:12:59,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:13:02,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:13:05,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:13:07,891 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 [1] [2023-08-26 14:13:09,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:13:12,806 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 [0, 1] [2023-08-26 14:13:15,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:13:18,006 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 [0, 1] [2023-08-26 14:13:20,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:13:22,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:13:25,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:13:27,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:13:37,832 INFO L124 PetriNetUnfolderBase]: 1770/3386 cut-off events. [2023-08-26 14:13:37,833 INFO L125 PetriNetUnfolderBase]: For 14617/14617 co-relation queries the response was YES. [2023-08-26 14:13:37,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15105 conditions, 3386 events. 1770/3386 cut-off events. For 14617/14617 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 20686 event pairs, 419 based on Foata normal form. 30/3300 useless extension candidates. Maximal degree in co-relation 15067. Up to 1430 conditions per place. [2023-08-26 14:13:37,853 INFO L140 encePairwiseOnDemand]: 625/646 looper letters, 185 selfloop transitions, 104 changer transitions 0/292 dead transitions. [2023-08-26 14:13:37,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 292 transitions, 2879 flow [2023-08-26 14:13:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-26 14:13:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-26 14:13:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3900 transitions. [2023-08-26 14:13:37,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2744159864902899 [2023-08-26 14:13:37,859 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3900 transitions. [2023-08-26 14:13:37,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3900 transitions. [2023-08-26 14:13:37,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:13:37,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3900 transitions. [2023-08-26 14:13:37,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 177.27272727272728) internal successors, (3900), 22 states have internal predecessors, (3900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:37,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 646.0) internal successors, (14858), 23 states have internal predecessors, (14858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:37,875 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 646.0) internal successors, (14858), 23 states have internal predecessors, (14858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:37,875 INFO L175 Difference]: Start difference. First operand has 135 places, 140 transitions, 1058 flow. Second operand 22 states and 3900 transitions. [2023-08-26 14:13:37,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 292 transitions, 2879 flow [2023-08-26 14:13:37,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 292 transitions, 2799 flow, removed 32 selfloop flow, removed 5 redundant places. [2023-08-26 14:13:37,899 INFO L231 Difference]: Finished difference. Result has 163 places, 204 transitions, 1981 flow [2023-08-26 14:13:37,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1981, PETRI_PLACES=163, PETRI_TRANSITIONS=204} [2023-08-26 14:13:37,900 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 59 predicate places. [2023-08-26 14:13:37,900 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 204 transitions, 1981 flow [2023-08-26 14:13:37,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 169.5) internal successors, (4746), 28 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:13:37,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:13:37,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:13:37,908 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 14:13:38,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:13:38,106 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:13:38,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:13:38,106 INFO L85 PathProgramCache]: Analyzing trace with hash 20437457, now seen corresponding path program 3 times [2023-08-26 14:13:38,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:13:38,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265327325] [2023-08-26 14:13:38,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:13:38,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:13:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:13:43,154 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 14:13:43,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:13:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265327325] [2023-08-26 14:13:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265327325] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:13:43,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776992975] [2023-08-26 14:13:43,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 14:13:43,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:13:43,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:13:43,156 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 14:13:43,157 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 14:13:43,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 14:13:43,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 14:13:43,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-26 14:13:43,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:13:43,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:43,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:43,539 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 14:13:43,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 14:13:43,755 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 14:13:43,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 14:13:45,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-08-26 14:13:46,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-08-26 14:13:47,194 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2023-08-26 14:13:47,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-08-26 14:13:48,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:13:48,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-08-26 14:13:48,413 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 14:13:48,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:13:48,762 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_864 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_864) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_864 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_864) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-26 14:13:49,530 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_863 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_863) |c_~#stored_elements~0.base| v_ArrVal_864) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_863 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_863) |c_~#stored_elements~0.base| v_ArrVal_864) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 14:13:49,607 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_863 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_863) |c_~#stored_elements~0.base| v_ArrVal_864) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_863 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_863) |c_~#stored_elements~0.base| v_ArrVal_864) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2023-08-26 14:13:50,629 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:13:50,630 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 100 [2023-08-26 14:14:04,700 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (v_ArrVal_858 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_858))) (store (store .cse0 .cse1 v_prenex_7) .cse2 (+ (select .cse0 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_8) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse2) 803)) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_858 Int) (v_ArrVal_863 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 .cse4 v_ArrVal_858))) (store (store .cse5 .cse1 v_ArrVal_860) .cse2 (+ (select .cse5 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_863) |c_~#stored_elements~0.base| v_ArrVal_864) |c_~#queue~0.base|) .cse2) 4))))))) is different from false [2023-08-26 14:14:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-26 14:14:04,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776992975] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:14:04,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:14:04,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2023-08-26 14:14:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705074506] [2023-08-26 14:14:04,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:14:04,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-26 14:14:04,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:14:04,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-26 14:14:04,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=506, Unknown=18, NotChecked=204, Total=870 [2023-08-26 14:14:04,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 14:14:04,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 204 transitions, 1981 flow. Second operand has 30 states, 30 states have (on average 169.4) internal successors, (5082), 30 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:14:04,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:14:04,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 14:14:04,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:14:21,731 WARN L234 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 76 DAG size of output: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:14:41,100 WARN L234 SmtUtils]: Spent 16.86s on a formula simplification. DAG size of input: 104 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:14:43,416 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 [0, 1] [2023-08-26 14:14:45,424 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 [0, 1] [2023-08-26 14:14:46,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:14:49,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:14:51,771 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 [0, 1] [2023-08-26 14:14:53,889 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 [0, 1] [2023-08-26 14:14:56,106 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 [0, 1] [2023-08-26 14:14:58,187 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 [0, 1] [2023-08-26 14:15:16,462 WARN L234 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 114 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:15:20,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:15:23,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:15:25,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:15:28,023 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 [0, 1] [2023-08-26 14:15:30,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:15:41,921 WARN L234 SmtUtils]: Spent 10.86s on a formula simplification. DAG size of input: 72 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:16:04,080 WARN L234 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:16:14,363 INFO L124 PetriNetUnfolderBase]: 2418/4595 cut-off events. [2023-08-26 14:16:14,363 INFO L125 PetriNetUnfolderBase]: For 65613/65615 co-relation queries the response was YES. [2023-08-26 14:16:14,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29724 conditions, 4595 events. 2418/4595 cut-off events. For 65613/65615 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 29916 event pairs, 707 based on Foata normal form. 33/4464 useless extension candidates. Maximal degree in co-relation 29674. Up to 1829 conditions per place. [2023-08-26 14:16:14,394 INFO L140 encePairwiseOnDemand]: 626/646 looper letters, 264 selfloop transitions, 118 changer transitions 0/385 dead transitions. [2023-08-26 14:16:14,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 385 transitions, 5267 flow [2023-08-26 14:16:14,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-26 14:16:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-26 14:16:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4097 transitions. [2023-08-26 14:16:14,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2757437070938215 [2023-08-26 14:16:14,399 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4097 transitions. [2023-08-26 14:16:14,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4097 transitions. [2023-08-26 14:16:14,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:16:14,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4097 transitions. [2023-08-26 14:16:14,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 178.1304347826087) internal successors, (4097), 23 states have internal predecessors, (4097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:14,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 646.0) internal successors, (15504), 24 states have internal predecessors, (15504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:14,412 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 646.0) internal successors, (15504), 24 states have internal predecessors, (15504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:14,412 INFO L175 Difference]: Start difference. First operand has 163 places, 204 transitions, 1981 flow. Second operand 23 states and 4097 transitions. [2023-08-26 14:16:14,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 385 transitions, 5267 flow [2023-08-26 14:16:14,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 385 transitions, 4908 flow, removed 163 selfloop flow, removed 4 redundant places. [2023-08-26 14:16:14,456 INFO L231 Difference]: Finished difference. Result has 193 places, 258 transitions, 2845 flow [2023-08-26 14:16:14,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1648, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2845, PETRI_PLACES=193, PETRI_TRANSITIONS=258} [2023-08-26 14:16:14,457 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 89 predicate places. [2023-08-26 14:16:14,457 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 258 transitions, 2845 flow [2023-08-26 14:16:14,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 169.4) internal successors, (5082), 30 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:14,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:16:14,458 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:16:14,475 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 14:16:14,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:16:14,663 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:16:14,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:16:14,663 INFO L85 PathProgramCache]: Analyzing trace with hash 40705305, now seen corresponding path program 1 times [2023-08-26 14:16:14,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:16:14,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403509270] [2023-08-26 14:16:14,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:16:14,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:16:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:16:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:16:17,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:16:17,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403509270] [2023-08-26 14:16:17,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403509270] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:16:17,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191461168] [2023-08-26 14:16:17,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:16:17,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:16:17,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:16:17,054 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 14:16:17,055 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 14:16:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:16:17,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-26 14:16:17,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:16:17,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:16:17,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:16:17,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:16:17,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 14:16:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:16:19,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:16:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:16:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191461168] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:16:20,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:16:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 16 [2023-08-26 14:16:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300098845] [2023-08-26 14:16:20,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:16:20,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 14:16:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:16:20,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 14:16:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-08-26 14:16:20,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 646 [2023-08-26 14:16:20,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 258 transitions, 2845 flow. Second operand has 17 states, 17 states have (on average 170.35294117647058) internal successors, (2896), 17 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:20,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:16:20,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 646 [2023-08-26 14:16:20,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:16:34,294 INFO L124 PetriNetUnfolderBase]: 3644/6848 cut-off events. [2023-08-26 14:16:34,294 INFO L125 PetriNetUnfolderBase]: For 188321/188321 co-relation queries the response was YES. [2023-08-26 14:16:34,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54014 conditions, 6848 events. 3644/6848 cut-off events. For 188321/188321 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 43905 event pairs, 1083 based on Foata normal form. 244/6887 useless extension candidates. Maximal degree in co-relation 53951. Up to 2667 conditions per place. [2023-08-26 14:16:34,353 INFO L140 encePairwiseOnDemand]: 632/646 looper letters, 406 selfloop transitions, 94 changer transitions 0/503 dead transitions. [2023-08-26 14:16:34,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 503 transitions, 7207 flow [2023-08-26 14:16:34,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-26 14:16:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-26 14:16:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3931 transitions. [2023-08-26 14:16:34,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27659724176752043 [2023-08-26 14:16:34,359 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3931 transitions. [2023-08-26 14:16:34,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3931 transitions. [2023-08-26 14:16:34,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:16:34,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3931 transitions. [2023-08-26 14:16:34,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 178.6818181818182) internal successors, (3931), 22 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:34,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 646.0) internal successors, (14858), 23 states have internal predecessors, (14858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:34,370 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 646.0) internal successors, (14858), 23 states have internal predecessors, (14858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:34,370 INFO L175 Difference]: Start difference. First operand has 193 places, 258 transitions, 2845 flow. Second operand 22 states and 3931 transitions. [2023-08-26 14:16:34,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 503 transitions, 7207 flow [2023-08-26 14:16:34,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 503 transitions, 6553 flow, removed 302 selfloop flow, removed 6 redundant places. [2023-08-26 14:16:34,460 INFO L231 Difference]: Finished difference. Result has 217 places, 281 transitions, 2870 flow [2023-08-26 14:16:34,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2870, PETRI_PLACES=217, PETRI_TRANSITIONS=281} [2023-08-26 14:16:34,461 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 113 predicate places. [2023-08-26 14:16:34,461 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 281 transitions, 2870 flow [2023-08-26 14:16:34,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 170.35294117647058) internal successors, (2896), 17 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:34,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:16:34,462 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:16:34,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-26 14:16:34,666 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,SelfDestructingSolverStorable21 [2023-08-26 14:16:34,666 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:16:34,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:16:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1315721584, now seen corresponding path program 1 times [2023-08-26 14:16:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:16:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727716022] [2023-08-26 14:16:34,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:16:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:16:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:16:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:16:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:16:36,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727716022] [2023-08-26 14:16:36,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727716022] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:16:36,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671914313] [2023-08-26 14:16:36,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:16:36,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:16:36,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:16:36,757 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 14:16:36,759 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 14:16:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:16:36,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 14:16:36,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:16:39,472 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 14:16:39,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:16:39,879 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 14:16:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:16:40,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:16:41,089 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:16:41,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-08-26 14:16:41,190 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:16:41,190 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-08-26 14:16:41,317 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 14:16:41,360 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:16:41,361 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-26 14:16:41,373 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 14:16:41,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:16:41,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-08-26 14:16:42,896 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:16:42,897 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2023-08-26 14:16:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:16:43,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671914313] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:16:43,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:16:43,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2023-08-26 14:16:43,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866327560] [2023-08-26 14:16:43,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:16:43,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-26 14:16:43,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:16:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-26 14:16:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=331, Unknown=2, NotChecked=0, Total=420 [2023-08-26 14:16:43,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 646 [2023-08-26 14:16:43,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 281 transitions, 2870 flow. Second operand has 21 states, 21 states have (on average 179.0) internal successors, (3759), 21 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:43,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:16:43,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 646 [2023-08-26 14:16:43,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:16:51,026 INFO L124 PetriNetUnfolderBase]: 4033/7652 cut-off events. [2023-08-26 14:16:51,026 INFO L125 PetriNetUnfolderBase]: For 211980/211980 co-relation queries the response was YES. [2023-08-26 14:16:51,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59959 conditions, 7652 events. 4033/7652 cut-off events. For 211980/211980 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 50576 event pairs, 1226 based on Foata normal form. 29/7327 useless extension candidates. Maximal degree in co-relation 59886. Up to 5249 conditions per place. [2023-08-26 14:16:51,090 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 292 selfloop transitions, 28 changer transitions 0/323 dead transitions. [2023-08-26 14:16:51,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 323 transitions, 4135 flow [2023-08-26 14:16:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 14:16:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 14:16:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1321 transitions. [2023-08-26 14:16:51,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29212737726669613 [2023-08-26 14:16:51,092 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1321 transitions. [2023-08-26 14:16:51,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1321 transitions. [2023-08-26 14:16:51,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 14:16:51,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1321 transitions. [2023-08-26 14:16:51,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 188.71428571428572) internal successors, (1321), 7 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:51,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 646.0) internal successors, (5168), 8 states have internal predecessors, (5168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:51,158 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 646.0) internal successors, (5168), 8 states have internal predecessors, (5168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:51,158 INFO L175 Difference]: Start difference. First operand has 217 places, 281 transitions, 2870 flow. Second operand 7 states and 1321 transitions. [2023-08-26 14:16:51,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 323 transitions, 4135 flow [2023-08-26 14:16:51,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 323 transitions, 3945 flow, removed 75 selfloop flow, removed 7 redundant places. [2023-08-26 14:16:51,274 INFO L231 Difference]: Finished difference. Result has 217 places, 291 transitions, 2900 flow [2023-08-26 14:16:51,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2900, PETRI_PLACES=217, PETRI_TRANSITIONS=291} [2023-08-26 14:16:51,274 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 113 predicate places. [2023-08-26 14:16:51,274 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 291 transitions, 2900 flow [2023-08-26 14:16:51,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 179.0) internal successors, (3759), 21 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:16:51,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 14:16:51,275 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 14:16:51,281 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 14:16:51,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:16:51,480 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 14:16:51,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 14:16:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2129849226, now seen corresponding path program 4 times [2023-08-26 14:16:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 14:16:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610328231] [2023-08-26 14:16:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 14:16:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 14:16:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 14:16:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:16:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:16:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610328231] [2023-08-26 14:16:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610328231] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 14:16:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756911069] [2023-08-26 14:16:58,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 14:16:58,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 14:16:58,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 14:16:58,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 14:16:58,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 14:16:58,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 14:16:58,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 14:16:58,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 97 conjunts are in the unsatisfiable core [2023-08-26 14:16:58,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 14:16:58,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:16:58,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:16:58,577 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 14:16:58,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-26 14:16:58,787 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 14:16:58,787 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 14:17:00,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-26 14:17:01,385 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-26 14:17:02,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-26 14:17:03,642 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-26 14:17:04,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:17:04,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-26 14:17:05,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 61 [2023-08-26 14:17:05,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2023-08-26 14:17:07,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 80 [2023-08-26 14:17:08,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 14:17:08,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 149 [2023-08-26 14:17:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 14:17:08,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 14:17:09,693 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1163 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1163) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1163 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1163) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-26 14:17:17,066 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1156 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1156))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (< .cse0 0) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1158 Int) (v_ArrVal_1163 (Array Int Int))) (<= (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_1158))) (store (store .cse2 .cse3 v_ArrVal_1160) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1163) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((v_ArrVal_1156 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1156))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (let ((.cse9 (+ |c_~#queue~0.offset| (* (select .cse8 .cse4) 4)))) (or (forall ((v_ArrVal_1160 Int) (v_ArrVal_1158 Int) (v_ArrVal_1163 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 .cse9 v_ArrVal_1158))) (store (store .cse7 .cse3 v_ArrVal_1160) .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1163) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (< .cse9 0)))))))) is different from false [2023-08-26 14:17:18,304 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))))) (and (forall ((v_ArrVal_1156 (Array Int Int))) (let ((.cse1 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1156))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1158 Int) (v_ArrVal_1163 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_1158))) (store (store .cse2 .cse3 v_ArrVal_1160) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1163) |c_~#queue~0.base|) .cse4) 4))))))))) (forall ((v_ArrVal_1156 (Array Int Int))) (let ((.cse8 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1156))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (+ (* (select .cse10 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse7 0) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1158 Int) (v_ArrVal_1163 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1158))) (store (store .cse9 .cse3 v_ArrVal_1160) .cse4 (+ (select .cse9 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1163) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))))))) is different from false [2023-08-26 14:17:18,429 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (let ((.cse1 (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1156))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1158 Int) (v_ArrVal_1163 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_1158))) (store (store .cse2 .cse3 v_ArrVal_1160) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1163) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))))) (forall ((v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1153 (Array Int Int))) (let ((.cse10 (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1153))) (store .cse13 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse14 (select .cse13 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse14 .cse8 (+ (select .cse14 .cse8) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1156))) (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse9 0) (forall ((v_ArrVal_1160 Int) (v_ArrVal_1158 Int) (v_ArrVal_1163 (Array Int Int))) (<= (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1158))) (store (store .cse11 .cse3 v_ArrVal_1160) .cse4 (+ (select .cse11 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1163) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))))) is different from false [2023-08-26 14:17:21,453 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 14:17:21,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 890 treesize of output 894 [2023-08-26 14:17:35,517 WARN L234 SmtUtils]: Spent 9.41s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:17:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-26 14:17:53,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756911069] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:17:53,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 14:17:53,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 41 [2023-08-26 14:17:53,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345316229] [2023-08-26 14:17:53,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 14:17:53,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-08-26 14:17:53,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:17:53,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-08-26 14:17:53,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1196, Unknown=86, NotChecked=308, Total=1806 [2023-08-26 14:17:53,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 14:17:53,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 291 transitions, 2900 flow. Second operand has 43 states, 43 states have (on average 169.53488372093022) internal successors, (7290), 43 states have internal predecessors, (7290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 14:17:53,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:17:53,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 14:17:53,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:17:57,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 14:18:30,018 WARN L234 SmtUtils]: Spent 17.22s on a formula simplification. DAG size of input: 291 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:18:55,412 WARN L234 SmtUtils]: Spent 11.57s on a formula simplification. DAG size of input: 282 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:19:02,304 WARN L234 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 256 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:19:22,165 WARN L234 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 245 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:19:50,526 WARN L234 SmtUtils]: Spent 25.34s on a formula simplification. DAG size of input: 245 DAG size of output: 133 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:20:00,341 WARN L234 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 274 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:20:25,456 WARN L234 SmtUtils]: Spent 23.06s on a formula simplification. DAG size of input: 261 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:20:49,338 WARN L234 SmtUtils]: Spent 22.17s on a formula simplification. DAG size of input: 248 DAG size of output: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:23:31,980 WARN L234 SmtUtils]: Spent 2.65m on a formula simplification. DAG size of input: 286 DAG size of output: 221 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:23:34,337 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 [0, 1] [2023-08-26 14:23:36,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:23:38,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 14:23:40,467 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 [0, 1] [2023-08-26 14:23:42,757 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 [0, 1] Received shutdown request... [2023-08-26 14:23:44,035 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 14:23:44,035 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 14:23:44,809 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 [0, 1] [2023-08-26 14:23:45,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 14:23:45,240 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-26 14:23:45,333 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 137 [2023-08-26 14:23:45,335 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 103 remaining) [2023-08-26 14:23:45,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 14:23:45,335 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 14:23:45,336 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 103 remaining) [2023-08-26 14:23:45,336 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 103 remaining) [2023-08-26 14:23:45,336 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 103 remaining) [2023-08-26 14:23:45,336 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 103 remaining) [2023-08-26 14:23:45,336 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONASSERT (91 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 103 remaining) [2023-08-26 14:23:45,337 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (82 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 103 remaining) [2023-08-26 14:23:45,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 103 remaining) [2023-08-26 14:23:45,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err22ASSERT_VIOLATIONASSERT (40 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 103 remaining) [2023-08-26 14:23:45,340 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 103 remaining) [2023-08-26 14:23:45,341 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 103 remaining) [2023-08-26 14:23:45,342 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 103 remaining) [2023-08-26 14:23:45,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 103 remaining) [2023-08-26 14:23:45,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 103 remaining) [2023-08-26 14:23:45,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 103 remaining) [2023-08-26 14:23:45,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err22ASSERT_VIOLATIONASSERT (0 of 103 remaining) [2023-08-26 14:23:45,343 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:23:45,347 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 14:23:45,347 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 14:23:45,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:23:45 BasicIcfg [2023-08-26 14:23:45,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 14:23:45,349 INFO L158 Benchmark]: Toolchain (without parser) took 870984.28ms. Allocated memory was 329.3MB in the beginning and 826.3MB in the end (delta: 497.0MB). Free memory was 304.4MB in the beginning and 421.8MB in the end (delta: -117.5MB). Peak memory consumption was 602.6MB. Max. memory is 16.0GB. [2023-08-26 14:23:45,349 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 329.3MB. Free memory is still 306.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 14:23:45,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.76ms. Allocated memory is still 329.3MB. Free memory was 304.4MB in the beginning and 274.2MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 14:23:45,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.97ms. Allocated memory is still 329.3MB. Free memory was 273.6MB in the beginning and 271.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 14:23:45,350 INFO L158 Benchmark]: Boogie Preprocessor took 33.26ms. Allocated memory is still 329.3MB. Free memory was 271.0MB in the beginning and 268.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 14:23:45,350 INFO L158 Benchmark]: RCFGBuilder took 470.02ms. Allocated memory is still 329.3MB. Free memory was 268.9MB in the beginning and 291.6MB in the end (delta: -22.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 14:23:45,351 INFO L158 Benchmark]: TraceAbstraction took 869952.23ms. Allocated memory was 329.3MB in the beginning and 826.3MB in the end (delta: 497.0MB). Free memory was 290.6MB in the beginning and 421.8MB in the end (delta: -131.2MB). Peak memory consumption was 590.1MB. Max. memory is 16.0GB. [2023-08-26 14:23:45,352 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 329.3MB. Free memory is still 306.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 470.76ms. Allocated memory is still 329.3MB. Free memory was 304.4MB in the beginning and 274.2MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.97ms. Allocated memory is still 329.3MB. Free memory was 273.6MB in the beginning and 271.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.26ms. Allocated memory is still 329.3MB. Free memory was 271.0MB in the beginning and 268.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 470.02ms. Allocated memory is still 329.3MB. Free memory was 268.9MB in the beginning and 291.6MB in the end (delta: -22.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 869952.23ms. Allocated memory was 329.3MB in the beginning and 826.3MB in the end (delta: 497.0MB). Free memory was 290.6MB in the beginning and 421.8MB in the end (delta: -131.2MB). Peak memory consumption was 590.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2s, 263 PlacesBefore, 104 PlacesAfterwards, 271 TransitionsBefore, 104 TransitionsAfterwards, 18460 CoEnabledTransitionPairs, 8 FixpointIterations, 104 TrivialSequentialCompositions, 223 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 22 ConcurrentYvCompositions, 8 ChoiceCompositions, 364 TotalNumberOfCompositions, 58098 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25857, independent: 25085, independent conditional: 0, independent unconditional: 25085, dependent: 772, dependent conditional: 0, dependent unconditional: 772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11511, independent: 11395, independent conditional: 0, independent unconditional: 11395, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25857, independent: 13690, independent conditional: 0, independent unconditional: 13690, dependent: 656, dependent conditional: 0, dependent unconditional: 656, unknown: 11511, unknown conditional: 0, unknown unconditional: 11511] , Statistics on independence cache: Total cache size (in pairs): 659, Positive cache size: 592, Positive conditional cache size: 0, Positive unconditional cache size: 592, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 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: 1052]: 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: 1053]: 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: -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: -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: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 103 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: 869.8s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 723.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.3s, HoareTripleCheckerStatistics: 207 mSolverCounterUnknown, 3277 SdHoareTripleChecker+Valid, 236.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3277 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 225.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4789 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 397 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8352 IncrementalHoareTripleChecker+Invalid, 13746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 397 mSolverCounterUnsat, 9 mSDtfsCounter, 8352 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 126 SyntacticMatches, 24 SemanticMatches, 314 ConstructedPredicates, 23 IntricatePredicates, 8 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 582.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2900occurred in iteration=23, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 131.9s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 437 ConstructedInterpolants, 120 QuantifiedInterpolants, 25738 SizeOfPredicates, 84 NumberOfNonLiveVariables, 2109 ConjunctsInSsa, 444 ConjunctsInUnsatCore, 38 InterpolantComputations, 17 PerfectInterpolantSequences, 14/85 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