/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 11:28:03,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 11:28:03,923 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 11:28:03,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 11:28:03,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 11:28:03,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 11:28:03,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 11:28:03,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 11:28:03,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 11:28:03,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 11:28:03,954 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 11:28:03,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 11:28:03,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 11:28:03,955 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 11:28:03,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 11:28:03,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 11:28:03,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 11:28:03,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 11:28:03,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 11:28:03,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 11:28:03,956 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 11:28:03,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 11:28:03,957 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 11:28:03,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 11:28:03,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 11:28:03,958 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 11:28:03,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 11:28:03,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:28:03,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 11:28:03,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 11:28:03,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 11:28:03,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 11:28:03,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 11:28:03,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 11:28:03,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 11:28:03,960 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 11:28:04,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 11:28:04,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 11:28:04,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 11:28:04,218 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 11:28:04,220 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 11:28:04,221 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 11:28:05,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 11:28:05,467 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 11:28:05,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-26 11:28:05,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87420c3cb/9c96e287dc184dc6ad26e98fa62284c3/FLAGc5b6a6b79 [2023-08-26 11:28:05,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87420c3cb/9c96e287dc184dc6ad26e98fa62284c3 [2023-08-26 11:28:05,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 11:28:05,490 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 11:28:05,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 11:28:05,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 11:28:05,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 11:28:05,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:05,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6bef23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05, skipping insertion in model container [2023-08-26 11:28:05,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:05,531 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 11:28:05,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:28:05,872 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 11:28:05,894 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 11:28:05,895 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 11:28:05,899 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-26 11:28:05,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:28:05,974 INFO L206 MainTranslator]: Completed translation [2023-08-26 11:28:05,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05 WrapperNode [2023-08-26 11:28:05,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 11:28:05,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 11:28:05,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 11:28:05,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 11:28:05,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:06,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:06,035 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 209 [2023-08-26 11:28:06,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 11:28:06,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 11:28:06,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 11:28:06,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 11:28:06,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:06,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:06,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:06,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:06,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:06,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:06,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:06,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:06,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 11:28:06,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 11:28:06,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 11:28:06,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 11:28:06,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (1/1) ... [2023-08-26 11:28:06,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:28:06,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:28:06,102 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 11:28:06,122 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 11:28:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-26 11:28:06,130 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-26 11:28:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-26 11:28:06,131 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-26 11:28:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 11:28:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 11:28:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 11:28:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 11:28:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 11:28:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 11:28:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 11:28:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 11:28:06,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 11:28:06,132 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 11:28:06,243 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 11:28:06,244 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 11:28:06,567 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 11:28:06,574 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 11:28:06,574 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 11:28:06,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:28:06 BoogieIcfgContainer [2023-08-26 11:28:06,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 11:28:06,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 11:28:06,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 11:28:06,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 11:28:06,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 11:28:05" (1/3) ... [2023-08-26 11:28:06,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565bb191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:28:06, skipping insertion in model container [2023-08-26 11:28:06,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:28:05" (2/3) ... [2023-08-26 11:28:06,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565bb191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:28:06, skipping insertion in model container [2023-08-26 11:28:06,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:28:06" (3/3) ... [2023-08-26 11:28:06,583 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-08-26 11:28:06,596 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 11:28:06,596 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-08-26 11:28:06,596 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 11:28:06,682 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 11:28:06,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 274 places, 282 transitions, 580 flow [2023-08-26 11:28:06,805 INFO L124 PetriNetUnfolderBase]: 15/280 cut-off events. [2023-08-26 11:28:06,805 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 11:28:06,811 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 11:28:06,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 282 transitions, 580 flow [2023-08-26 11:28:06,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 271 transitions, 551 flow [2023-08-26 11:28:06,822 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 11:28:06,830 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 271 transitions, 551 flow [2023-08-26 11:28:06,834 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 271 transitions, 551 flow [2023-08-26 11:28:06,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 271 transitions, 551 flow [2023-08-26 11:28:06,876 INFO L124 PetriNetUnfolderBase]: 15/271 cut-off events. [2023-08-26 11:28:06,877 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 11:28:06,880 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 11:28:06,887 INFO L119 LiptonReduction]: Number of co-enabled transitions 18460 [2023-08-26 11:28:17,902 INFO L134 LiptonReduction]: Checked pairs total: 58098 [2023-08-26 11:28:17,902 INFO L136 LiptonReduction]: Total number of compositions: 364 [2023-08-26 11:28:17,911 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 11:28:17,929 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;@7448132e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 11:28:17,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2023-08-26 11:28:17,930 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 11:28:17,930 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 11:28:17,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:28:17,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:17,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 11:28:17,931 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 11:28:17,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:17,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1197, now seen corresponding path program 1 times [2023-08-26 11:28:17,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:17,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105766937] [2023-08-26 11:28:17,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:17,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:28:18,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105766937] [2023-08-26 11:28:18,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105766937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:18,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:18,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 11:28:18,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266590752] [2023-08-26 11:28:18,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:18,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 11:28:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:18,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 11:28:18,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 11:28:18,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 646 [2023-08-26 11:28:18,054 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 11:28:18,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:18,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 646 [2023-08-26 11:28:18,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:18,481 INFO L124 PetriNetUnfolderBase]: 4013/6423 cut-off events. [2023-08-26 11:28:18,481 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-08-26 11:28:18,487 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 11:28:18,508 INFO L140 encePairwiseOnDemand]: 610/646 looper letters, 61 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2023-08-26 11:28:18,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 267 flow [2023-08-26 11:28:18,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 11:28:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 11:28:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 635 transitions. [2023-08-26 11:28:18,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4914860681114551 [2023-08-26 11:28:18,522 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 635 transitions. [2023-08-26 11:28:18,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 635 transitions. [2023-08-26 11:28:18,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:18,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 635 transitions. [2023-08-26 11:28:18,530 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 11:28:18,534 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 11:28:18,534 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 11:28:18,535 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 217 flow. Second operand 2 states and 635 transitions. [2023-08-26 11:28:18,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 267 flow [2023-08-26 11:28:18,539 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 11:28:18,540 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 140 flow [2023-08-26 11:28:18,541 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 11:28:18,543 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2023-08-26 11:28:18,544 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 140 flow [2023-08-26 11:28:18,544 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 11:28:18,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:18,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 11:28:18,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 11:28:18,545 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 11:28:18,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1181127, now seen corresponding path program 1 times [2023-08-26 11:28:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16088153] [2023-08-26 11:28:18,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:18,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:18,784 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 11:28:18,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:18,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16088153] [2023-08-26 11:28:18,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16088153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:18,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:18,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:28:18,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293184650] [2023-08-26 11:28:18,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:18,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:28:18,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:18,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:28:18,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:28:18,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 646 [2023-08-26 11:28:18,788 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 11:28:18,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:18,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 646 [2023-08-26 11:28:18,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:19,199 INFO L124 PetriNetUnfolderBase]: 4304/6761 cut-off events. [2023-08-26 11:28:19,199 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 11:28:19,203 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 11:28:19,220 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 60 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-08-26 11:28:19,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 258 flow [2023-08-26 11:28:19,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:28:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:28:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2023-08-26 11:28:19,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34055727554179566 [2023-08-26 11:28:19,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 660 transitions. [2023-08-26 11:28:19,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 660 transitions. [2023-08-26 11:28:19,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:19,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 660 transitions. [2023-08-26 11:28:19,224 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 11:28:19,227 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 11:28:19,227 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 11:28:19,227 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 140 flow. Second operand 3 states and 660 transitions. [2023-08-26 11:28:19,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 258 flow [2023-08-26 11:28:19,228 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 11:28:19,229 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 138 flow [2023-08-26 11:28:19,229 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 11:28:19,230 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2023-08-26 11:28:19,230 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 138 flow [2023-08-26 11:28:19,230 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 11:28:19,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:19,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 11:28:19,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 11:28:19,231 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 11:28:19,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:19,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1181128, now seen corresponding path program 1 times [2023-08-26 11:28:19,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665750182] [2023-08-26 11:28:19,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:19,261 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 11:28:19,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:19,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665750182] [2023-08-26 11:28:19,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665750182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:19,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:19,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:28:19,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144340679] [2023-08-26 11:28:19,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:19,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:28:19,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:19,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:28:19,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:28:19,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 11:28:19,264 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 11:28:19,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:19,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 11:28:19,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:19,680 INFO L124 PetriNetUnfolderBase]: 4253/6661 cut-off events. [2023-08-26 11:28:19,680 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 11:28:19,685 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 11:28:19,712 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 58 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-08-26 11:28:19,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 252 flow [2023-08-26 11:28:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:28:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:28:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2023-08-26 11:28:19,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3364293085655315 [2023-08-26 11:28:19,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 652 transitions. [2023-08-26 11:28:19,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 652 transitions. [2023-08-26 11:28:19,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:19,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 652 transitions. [2023-08-26 11:28:19,715 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 11:28:19,718 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 11:28:19,719 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 11:28:19,719 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 138 flow. Second operand 3 states and 652 transitions. [2023-08-26 11:28:19,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 252 flow [2023-08-26 11:28:19,719 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 11:28:19,720 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 135 flow [2023-08-26 11:28:19,721 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 11:28:19,721 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 11:28:19,722 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 135 flow [2023-08-26 11:28:19,722 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 11:28:19,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:19,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 11:28:19,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 11:28:19,723 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 11:28:19,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1135090846, now seen corresponding path program 1 times [2023-08-26 11:28:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:19,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840578604] [2023-08-26 11:28:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:19,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:28:19,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840578604] [2023-08-26 11:28:19,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840578604] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:19,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:19,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:28:19,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698317273] [2023-08-26 11:28:19,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:19,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:28:19,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:19,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:28:19,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:28:19,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 646 [2023-08-26 11:28:19,898 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 11:28:19,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:19,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 646 [2023-08-26 11:28:19,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:20,163 INFO L124 PetriNetUnfolderBase]: 3079/4910 cut-off events. [2023-08-26 11:28:20,164 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 11:28:20,167 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 11:28:20,176 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 57 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2023-08-26 11:28:20,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 249 flow [2023-08-26 11:28:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:28:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:28:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 644 transitions. [2023-08-26 11:28:20,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3323013415892673 [2023-08-26 11:28:20,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 644 transitions. [2023-08-26 11:28:20,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 644 transitions. [2023-08-26 11:28:20,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:20,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 644 transitions. [2023-08-26 11:28:20,179 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 11:28:20,181 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 11:28:20,182 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 11:28:20,182 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 135 flow. Second operand 3 states and 644 transitions. [2023-08-26 11:28:20,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 249 flow [2023-08-26 11:28:20,183 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 11:28:20,183 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 134 flow [2023-08-26 11:28:20,184 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 11:28:20,184 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 11:28:20,184 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 134 flow [2023-08-26 11:28:20,185 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 11:28:20,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:20,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 11:28:20,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 11:28:20,185 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 11:28:20,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1135090845, now seen corresponding path program 1 times [2023-08-26 11:28:20,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191968295] [2023-08-26 11:28:20,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:20,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:20,232 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 11:28:20,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191968295] [2023-08-26 11:28:20,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191968295] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:20,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:20,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:28:20,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939134191] [2023-08-26 11:28:20,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:20,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:28:20,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:20,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:28:20,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:28:20,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 11:28:20,235 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 11:28:20,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:20,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 11:28:20,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:20,430 INFO L124 PetriNetUnfolderBase]: 1905/3159 cut-off events. [2023-08-26 11:28:20,430 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 11:28:20,433 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 11:28:20,439 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 56 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-08-26 11:28:20,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 246 flow [2023-08-26 11:28:20,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:28:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:28:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2023-08-26 11:28:20,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3302373581011352 [2023-08-26 11:28:20,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2023-08-26 11:28:20,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2023-08-26 11:28:20,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:20,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2023-08-26 11:28:20,442 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 11:28:20,444 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 11:28:20,445 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 11:28:20,445 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 134 flow. Second operand 3 states and 640 transitions. [2023-08-26 11:28:20,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 246 flow [2023-08-26 11:28:20,446 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 11:28:20,447 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 133 flow [2023-08-26 11:28:20,447 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 11:28:20,447 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 11:28:20,447 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 133 flow [2023-08-26 11:28:20,448 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 11:28:20,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:20,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 11:28:20,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 11:28:20,448 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 11:28:20,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062955, now seen corresponding path program 1 times [2023-08-26 11:28:20,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039898813] [2023-08-26 11:28:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:20,529 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 11:28:20,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:20,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039898813] [2023-08-26 11:28:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039898813] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:20,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:28:20,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053795926] [2023-08-26 11:28:20,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:20,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:28:20,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:20,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:28:20,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:28:20,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 11:28:20,531 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 11:28:20,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:20,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 11:28:20,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:20,687 INFO L124 PetriNetUnfolderBase]: 1691/2803 cut-off events. [2023-08-26 11:28:20,687 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-26 11:28:20,689 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 11:28:20,695 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 53 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2023-08-26 11:28:20,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 235 flow [2023-08-26 11:28:20,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:28:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:28:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2023-08-26 11:28:20,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32972136222910214 [2023-08-26 11:28:20,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 639 transitions. [2023-08-26 11:28:20,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 639 transitions. [2023-08-26 11:28:20,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:20,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 639 transitions. [2023-08-26 11:28:20,698 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 11:28:20,701 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 11:28:20,701 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 11:28:20,701 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 133 flow. Second operand 3 states and 639 transitions. [2023-08-26 11:28:20,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 235 flow [2023-08-26 11:28:20,702 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 11:28:20,703 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 128 flow [2023-08-26 11:28:20,703 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 11:28:20,705 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -41 predicate places. [2023-08-26 11:28:20,705 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 128 flow [2023-08-26 11:28:20,706 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 11:28:20,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:20,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 11:28:20,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 11:28:20,706 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 11:28:20,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062954, now seen corresponding path program 1 times [2023-08-26 11:28:20,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:20,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719542944] [2023-08-26 11:28:20,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:20,829 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 11:28:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:20,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719542944] [2023-08-26 11:28:20,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719542944] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:20,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:20,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:28:20,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024084094] [2023-08-26 11:28:20,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:20,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:28:20,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:20,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:28:20,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:28:20,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 11:28:20,831 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 11:28:20,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:20,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 11:28:20,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:20,975 INFO L124 PetriNetUnfolderBase]: 1428/2366 cut-off events. [2023-08-26 11:28:20,975 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 11:28:20,978 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 11:28:20,982 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 49 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-08-26 11:28:20,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 220 flow [2023-08-26 11:28:20,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:28:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:28:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2023-08-26 11:28:20,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3328173374613003 [2023-08-26 11:28:20,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2023-08-26 11:28:20,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2023-08-26 11:28:20,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:20,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2023-08-26 11:28:20,987 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 11:28:20,989 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 11:28:20,989 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 11:28:20,989 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 128 flow. Second operand 3 states and 645 transitions. [2023-08-26 11:28:20,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 220 flow [2023-08-26 11:28:20,990 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 11:28:20,993 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 121 flow [2023-08-26 11:28:20,994 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 11:28:20,995 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -44 predicate places. [2023-08-26 11:28:20,995 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 121 flow [2023-08-26 11:28:20,996 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 11:28:20,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:20,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 11:28:20,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 11:28:20,998 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 11:28:20,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:20,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062968, now seen corresponding path program 1 times [2023-08-26 11:28:20,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:20,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222943122] [2023-08-26 11:28:20,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:20,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:21,232 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 11:28:21,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:21,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222943122] [2023-08-26 11:28:21,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222943122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:21,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:21,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:28:21,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919426409] [2023-08-26 11:28:21,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:21,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:28:21,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:21,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:28:21,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:28:21,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 646 [2023-08-26 11:28:21,235 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 11:28:21,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:21,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 646 [2023-08-26 11:28:21,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:21,384 INFO L124 PetriNetUnfolderBase]: 1367/2309 cut-off events. [2023-08-26 11:28:21,384 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-26 11:28:21,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 11:28:21,390 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 54 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-08-26 11:28:21,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 255 flow [2023-08-26 11:28:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:28:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:28:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2023-08-26 11:28:21,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37874097007223945 [2023-08-26 11:28:21,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 734 transitions. [2023-08-26 11:28:21,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 734 transitions. [2023-08-26 11:28:21,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:21,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 734 transitions. [2023-08-26 11:28:21,395 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 11:28:21,397 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 11:28:21,397 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 11:28:21,397 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 121 flow. Second operand 3 states and 734 transitions. [2023-08-26 11:28:21,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 255 flow [2023-08-26 11:28:21,398 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 11:28:21,398 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 146 flow [2023-08-26 11:28:21,399 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 11:28:21,400 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -42 predicate places. [2023-08-26 11:28:21,400 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 146 flow [2023-08-26 11:28:21,401 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 11:28:21,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:21,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 11:28:21,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 11:28:21,401 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 11:28:21,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash 827212352, now seen corresponding path program 1 times [2023-08-26 11:28:21,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:21,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142705071] [2023-08-26 11:28:21,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:21,644 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 11:28:21,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:21,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142705071] [2023-08-26 11:28:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142705071] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:21,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:21,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:28:21,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802021450] [2023-08-26 11:28:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:21,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:28:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:21,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:28:21,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:28:21,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 646 [2023-08-26 11:28:21,649 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 11:28:21,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:21,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 646 [2023-08-26 11:28:21,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:21,875 INFO L124 PetriNetUnfolderBase]: 1758/2954 cut-off events. [2023-08-26 11:28:21,875 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2023-08-26 11:28:21,878 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 11:28:21,882 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 74 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2023-08-26 11:28:21,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 367 flow [2023-08-26 11:28:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:28:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:28:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2023-08-26 11:28:21,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325593395252838 [2023-08-26 11:28:21,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 631 transitions. [2023-08-26 11:28:21,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 631 transitions. [2023-08-26 11:28:21,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:21,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 631 transitions. [2023-08-26 11:28:21,886 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 11:28:21,888 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 11:28:21,889 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 11:28:21,889 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 146 flow. Second operand 3 states and 631 transitions. [2023-08-26 11:28:21,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 367 flow [2023-08-26 11:28:21,890 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 11:28:21,890 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 178 flow [2023-08-26 11:28:21,891 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 11:28:21,891 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2023-08-26 11:28:21,891 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 178 flow [2023-08-26 11:28:21,892 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 11:28:21,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:21,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 11:28:21,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 11:28:21,893 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 11:28:21,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:21,893 INFO L85 PathProgramCache]: Analyzing trace with hash 827214629, now seen corresponding path program 1 times [2023-08-26 11:28:21,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924550409] [2023-08-26 11:28:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:21,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:21,994 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 11:28:21,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924550409] [2023-08-26 11:28:21,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924550409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:21,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:21,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:28:21,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880240845] [2023-08-26 11:28:21,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:21,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:28:21,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:21,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:28:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:28:21,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 646 [2023-08-26 11:28:21,996 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 11:28:21,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:21,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 646 [2023-08-26 11:28:21,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:22,231 INFO L124 PetriNetUnfolderBase]: 1851/3141 cut-off events. [2023-08-26 11:28:22,231 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2023-08-26 11:28:22,235 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 11:28:22,240 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 82 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2023-08-26 11:28:22,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 406 flow [2023-08-26 11:28:22,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 11:28:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 11:28:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 830 transitions. [2023-08-26 11:28:22,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32120743034055727 [2023-08-26 11:28:22,242 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 830 transitions. [2023-08-26 11:28:22,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 830 transitions. [2023-08-26 11:28:22,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:22,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 830 transitions. [2023-08-26 11:28:22,244 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 11:28:22,246 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 11:28:22,246 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 11:28:22,246 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 178 flow. Second operand 4 states and 830 transitions. [2023-08-26 11:28:22,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 406 flow [2023-08-26 11:28:22,248 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 11:28:22,248 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 173 flow [2023-08-26 11:28:22,248 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 11:28:22,249 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 11:28:22,249 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 173 flow [2023-08-26 11:28:22,249 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 11:28:22,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:22,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:28:22,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 11:28:22,249 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 11:28:22,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:22,250 INFO L85 PathProgramCache]: Analyzing trace with hash -986612324, now seen corresponding path program 1 times [2023-08-26 11:28:22,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:22,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577534833] [2023-08-26 11:28:22,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:22,280 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 11:28:22,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:22,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577534833] [2023-08-26 11:28:22,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577534833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:22,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:22,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:28:22,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092181785] [2023-08-26 11:28:22,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:22,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:28:22,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:22,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:28:22,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:28:22,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 646 [2023-08-26 11:28:22,283 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 11:28:22,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:22,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 646 [2023-08-26 11:28:22,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:22,382 INFO L124 PetriNetUnfolderBase]: 614/1214 cut-off events. [2023-08-26 11:28:22,382 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-08-26 11:28:22,383 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 11:28:22,385 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 51 selfloop transitions, 2 changer transitions 8/68 dead transitions. [2023-08-26 11:28:22,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 311 flow [2023-08-26 11:28:22,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:28:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:28:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2023-08-26 11:28:22,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43653250773993807 [2023-08-26 11:28:22,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 846 transitions. [2023-08-26 11:28:22,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 846 transitions. [2023-08-26 11:28:22,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:22,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 846 transitions. [2023-08-26 11:28:22,389 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 11:28:22,390 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 11:28:22,391 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 11:28:22,391 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 173 flow. Second operand 3 states and 846 transitions. [2023-08-26 11:28:22,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 311 flow [2023-08-26 11:28:22,392 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 11:28:22,392 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 165 flow [2023-08-26 11:28:22,392 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 11:28:22,393 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2023-08-26 11:28:22,393 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 165 flow [2023-08-26 11:28:22,393 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 11:28:22,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:22,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:28:22,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 11:28:22,393 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 11:28:22,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash -589188273, now seen corresponding path program 1 times [2023-08-26 11:28:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:22,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350353145] [2023-08-26 11:28:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:22,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:22,444 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 11:28:22,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:22,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350353145] [2023-08-26 11:28:22,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350353145] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:22,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:22,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:28:22,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590409754] [2023-08-26 11:28:22,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:22,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:28:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:28:22,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:28:22,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 11:28:22,446 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 11:28:22,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:22,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 11:28:22,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:22,526 INFO L124 PetriNetUnfolderBase]: 539/1036 cut-off events. [2023-08-26 11:28:22,526 INFO L125 PetriNetUnfolderBase]: For 136/138 co-relation queries the response was YES. [2023-08-26 11:28:22,527 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 11:28:22,529 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 49 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-26 11:28:22,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 53 transitions, 261 flow [2023-08-26 11:28:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:28:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:28:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2023-08-26 11:28:22,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32920536635706915 [2023-08-26 11:28:22,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 638 transitions. [2023-08-26 11:28:22,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 638 transitions. [2023-08-26 11:28:22,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:22,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 638 transitions. [2023-08-26 11:28:22,532 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 11:28:22,533 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 11:28:22,534 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 11:28:22,534 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 165 flow. Second operand 3 states and 638 transitions. [2023-08-26 11:28:22,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 53 transitions, 261 flow [2023-08-26 11:28:22,535 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 11:28:22,535 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 159 flow [2023-08-26 11:28:22,535 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 11:28:22,536 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2023-08-26 11:28:22,536 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 159 flow [2023-08-26 11:28:22,536 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 11:28:22,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:22,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:28:22,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 11:28:22,536 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 11:28:22,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash -589188272, now seen corresponding path program 1 times [2023-08-26 11:28:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:22,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869478399] [2023-08-26 11:28:22,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:22,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:28:22,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:22,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869478399] [2023-08-26 11:28:22,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869478399] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:22,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:22,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:28:22,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562620521] [2023-08-26 11:28:22,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:22,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:28:22,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:22,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:28:22,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:28:22,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 646 [2023-08-26 11:28:22,741 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 11:28:22,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:22,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 646 [2023-08-26 11:28:22,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:22,881 INFO L124 PetriNetUnfolderBase]: 532/1024 cut-off events. [2023-08-26 11:28:22,881 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-08-26 11:28:22,882 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 11:28:22,884 INFO L140 encePairwiseOnDemand]: 639/646 looper letters, 53 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-08-26 11:28:22,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 318 flow [2023-08-26 11:28:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 11:28:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 11:28:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1296 transitions. [2023-08-26 11:28:22,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33436532507739936 [2023-08-26 11:28:22,887 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1296 transitions. [2023-08-26 11:28:22,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1296 transitions. [2023-08-26 11:28:22,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:22,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1296 transitions. [2023-08-26 11:28:22,889 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 11:28:22,892 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 11:28:22,892 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 11:28:22,892 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 159 flow. Second operand 6 states and 1296 transitions. [2023-08-26 11:28:22,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 318 flow [2023-08-26 11:28:22,893 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 11:28:22,894 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 216 flow [2023-08-26 11:28:22,894 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 11:28:22,894 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -33 predicate places. [2023-08-26 11:28:22,894 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 216 flow [2023-08-26 11:28:22,895 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 11:28:22,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:22,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:28:22,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 11:28:22,895 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 11:28:22,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash -568180776, now seen corresponding path program 1 times [2023-08-26 11:28:22,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:22,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709370343] [2023-08-26 11:28:22,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:22,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:23,486 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 11:28:23,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:23,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709370343] [2023-08-26 11:28:23,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709370343] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:23,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:23,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 11:28:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801814970] [2023-08-26 11:28:23,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:23,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 11:28:23,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:23,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 11:28:23,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 11:28:23,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 11:28:23,489 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 11:28:23,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:23,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 11:28:23,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:23,924 INFO L124 PetriNetUnfolderBase]: 610/1166 cut-off events. [2023-08-26 11:28:23,924 INFO L125 PetriNetUnfolderBase]: For 213/215 co-relation queries the response was YES. [2023-08-26 11:28:23,926 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 11:28:23,928 INFO L140 encePairwiseOnDemand]: 637/646 looper letters, 81 selfloop transitions, 15 changer transitions 0/99 dead transitions. [2023-08-26 11:28:23,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 507 flow [2023-08-26 11:28:23,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 11:28:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 11:28:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1131 transitions. [2023-08-26 11:28:23,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2917956656346749 [2023-08-26 11:28:23,931 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1131 transitions. [2023-08-26 11:28:23,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1131 transitions. [2023-08-26 11:28:23,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:23,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1131 transitions. [2023-08-26 11:28:23,933 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 11:28:23,936 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 11:28:23,936 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 11:28:23,936 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 216 flow. Second operand 6 states and 1131 transitions. [2023-08-26 11:28:23,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 507 flow [2023-08-26 11:28:23,938 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 11:28:23,939 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 279 flow [2023-08-26 11:28:23,939 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 11:28:23,939 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -26 predicate places. [2023-08-26 11:28:23,939 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 279 flow [2023-08-26 11:28:23,940 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 11:28:23,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:23,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:28:23,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 11:28:23,940 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 11:28:23,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1718431846, now seen corresponding path program 2 times [2023-08-26 11:28:23,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:23,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990016414] [2023-08-26 11:28:23,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:24,232 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 11:28:24,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990016414] [2023-08-26 11:28:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990016414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:24,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:24,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 11:28:24,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284711518] [2023-08-26 11:28:24,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:24,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 11:28:24,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:24,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 11:28:24,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 11:28:24,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 11:28:24,235 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 11:28:24,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:24,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 11:28:24,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:24,478 INFO L124 PetriNetUnfolderBase]: 665/1278 cut-off events. [2023-08-26 11:28:24,478 INFO L125 PetriNetUnfolderBase]: For 384/386 co-relation queries the response was YES. [2023-08-26 11:28:24,480 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 11:28:24,482 INFO L140 encePairwiseOnDemand]: 638/646 looper letters, 92 selfloop transitions, 16 changer transitions 0/111 dead transitions. [2023-08-26 11:28:24,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 111 transitions, 614 flow [2023-08-26 11:28:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 11:28:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 11:28:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1488 transitions. [2023-08-26 11:28:24,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28792569659442724 [2023-08-26 11:28:24,486 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1488 transitions. [2023-08-26 11:28:24,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1488 transitions. [2023-08-26 11:28:24,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:24,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1488 transitions. [2023-08-26 11:28:24,488 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 11:28:24,492 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 11:28:24,492 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 11:28:24,492 INFO L175 Difference]: Start difference. First operand has 78 places, 63 transitions, 279 flow. Second operand 8 states and 1488 transitions. [2023-08-26 11:28:24,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 111 transitions, 614 flow [2023-08-26 11:28:24,495 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 11:28:24,495 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 316 flow [2023-08-26 11:28:24,496 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 11:28:24,496 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -19 predicate places. [2023-08-26 11:28:24,496 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 316 flow [2023-08-26 11:28:24,496 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 11:28:24,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:24,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:28:24,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 11:28:24,497 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 11:28:24,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1081892096, now seen corresponding path program 3 times [2023-08-26 11:28:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049707143] [2023-08-26 11:28:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:24,608 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 11:28:24,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:24,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049707143] [2023-08-26 11:28:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049707143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:24,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:24,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:28:24,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197243880] [2023-08-26 11:28:24,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:24,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:28:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:24,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:28:24,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:28:24,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 646 [2023-08-26 11:28:24,610 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 11:28:24,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:24,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 646 [2023-08-26 11:28:24,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:24,726 INFO L124 PetriNetUnfolderBase]: 537/1003 cut-off events. [2023-08-26 11:28:24,726 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2023-08-26 11:28:24,728 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 11:28:24,729 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 71 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2023-08-26 11:28:24,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 499 flow [2023-08-26 11:28:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 11:28:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 11:28:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 819 transitions. [2023-08-26 11:28:24,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3169504643962848 [2023-08-26 11:28:24,731 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 819 transitions. [2023-08-26 11:28:24,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 819 transitions. [2023-08-26 11:28:24,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:24,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 819 transitions. [2023-08-26 11:28:24,735 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 11:28:24,737 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 11:28:24,737 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 11:28:24,737 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 316 flow. Second operand 4 states and 819 transitions. [2023-08-26 11:28:24,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 499 flow [2023-08-26 11:28:24,739 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 11:28:24,740 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 281 flow [2023-08-26 11:28:24,740 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 11:28:24,741 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -21 predicate places. [2023-08-26 11:28:24,741 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 281 flow [2023-08-26 11:28:24,741 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 11:28:24,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:24,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:28:24,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 11:28:24,741 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 11:28:24,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:24,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1118902209, now seen corresponding path program 1 times [2023-08-26 11:28:24,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:24,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530310600] [2023-08-26 11:28:24,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:24,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:25,157 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 11:28:25,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530310600] [2023-08-26 11:28:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530310600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:28:25,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:28:25,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 11:28:25,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405536893] [2023-08-26 11:28:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:28:25,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 11:28:25,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:25,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 11:28:25,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 11:28:25,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 11:28:25,160 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 11:28:25,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:25,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 11:28:25,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:25,386 INFO L124 PetriNetUnfolderBase]: 517/980 cut-off events. [2023-08-26 11:28:25,386 INFO L125 PetriNetUnfolderBase]: For 320/320 co-relation queries the response was YES. [2023-08-26 11:28:25,387 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 11:28:25,389 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 72 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2023-08-26 11:28:25,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 88 transitions, 509 flow [2023-08-26 11:28:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 11:28:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 11:28:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1115 transitions. [2023-08-26 11:28:25,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28766769865841074 [2023-08-26 11:28:25,392 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1115 transitions. [2023-08-26 11:28:25,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1115 transitions. [2023-08-26 11:28:25,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:25,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1115 transitions. [2023-08-26 11:28:25,394 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 11:28:25,397 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 11:28:25,398 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 11:28:25,398 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 281 flow. Second operand 6 states and 1115 transitions. [2023-08-26 11:28:25,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 88 transitions, 509 flow [2023-08-26 11:28:25,399 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 11:28:25,400 INFO L231 Difference]: Finished difference. Result has 87 places, 65 transitions, 318 flow [2023-08-26 11:28:25,400 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 11:28:25,400 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -17 predicate places. [2023-08-26 11:28:25,400 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 65 transitions, 318 flow [2023-08-26 11:28:25,401 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 11:28:25,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:25,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:28:25,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 11:28:25,401 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 11:28:25,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash 693396545, now seen corresponding path program 1 times [2023-08-26 11:28:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:25,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857416516] [2023-08-26 11:28:25,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:25,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:25,927 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 11:28:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857416516] [2023-08-26 11:28:25,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857416516] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:28:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379384044] [2023-08-26 11:28:25,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:25,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:28:25,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:28:25,933 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 11:28:25,934 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 11:28:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:26,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-26 11:28:26,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:28:26,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:26,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:26,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:26,137 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 11:28:26,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:26,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:26,177 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 11:28:26,178 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 11:28:26,192 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 11:28:26,192 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 11:28:26,282 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 11:28:26,386 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 11:28:26,531 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 11:28:26,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:26,593 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 11:28:26,635 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 11:28:26,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:28:26,660 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 11:28:26,669 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 11:28:26,728 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 11:28:31,071 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 11:28:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379384044] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:28:31,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:28:31,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-26 11:28:31,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132946696] [2023-08-26 11:28:31,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:28:31,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-26 11:28:31,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:31,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-26 11:28:31,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=400, Unknown=5, NotChecked=132, Total=650 [2023-08-26 11:28:31,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 11:28:31,077 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 11:28:31,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:31,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 11:28:31,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:38,426 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 11:28:42,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 [1] [2023-08-26 11:28:43,074 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 11:28:43,424 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 11:28:44,100 INFO L124 PetriNetUnfolderBase]: 672/1286 cut-off events. [2023-08-26 11:28:44,100 INFO L125 PetriNetUnfolderBase]: For 681/681 co-relation queries the response was YES. [2023-08-26 11:28:44,103 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 11:28:44,105 INFO L140 encePairwiseOnDemand]: 632/646 looper letters, 92 selfloop transitions, 37 changer transitions 0/132 dead transitions. [2023-08-26 11:28:44,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 132 transitions, 816 flow [2023-08-26 11:28:44,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-26 11:28:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-26 11:28:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3583 transitions. [2023-08-26 11:28:44,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2773219814241486 [2023-08-26 11:28:44,112 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3583 transitions. [2023-08-26 11:28:44,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3583 transitions. [2023-08-26 11:28:44,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:44,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3583 transitions. [2023-08-26 11:28:44,118 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 11:28:44,127 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 11:28:44,128 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 11:28:44,128 INFO L175 Difference]: Start difference. First operand has 87 places, 65 transitions, 318 flow. Second operand 20 states and 3583 transitions. [2023-08-26 11:28:44,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 132 transitions, 816 flow [2023-08-26 11:28:44,131 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 11:28:44,132 INFO L231 Difference]: Finished difference. Result has 111 places, 92 transitions, 564 flow [2023-08-26 11:28:44,132 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 11:28:44,132 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 7 predicate places. [2023-08-26 11:28:44,132 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 92 transitions, 564 flow [2023-08-26 11:28:44,133 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 11:28:44,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:44,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:28:44,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-26 11:28:44,338 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 11:28:44,338 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 11:28:44,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash -593236279, now seen corresponding path program 1 times [2023-08-26 11:28:44,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:44,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938013946] [2023-08-26 11:28:44,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:44,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:45,160 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 11:28:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938013946] [2023-08-26 11:28:45,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938013946] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:28:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95969245] [2023-08-26 11:28:45,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:45,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:28:45,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:28:45,177 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 11:28:45,221 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 11:28:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:45,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-26 11:28:45,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:28:45,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:45,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:45,385 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 11:28:45,385 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 11:28:45,403 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 11:28:45,403 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 11:28:45,510 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 11:28:45,606 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 11:28:45,717 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 11:28:45,893 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 11:28:45,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:45,941 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 11:28:45,986 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 11:28:45,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:28:46,019 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 11:28:46,087 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 11:28:46,187 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:28:46,187 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 11:28:59,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 11:28:59,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95969245] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:28:59,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:28:59,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 26 [2023-08-26 11:28:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134425867] [2023-08-26 11:28:59,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:28:59,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-26 11:28:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-26 11:28:59,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=529, Unknown=16, NotChecked=98, Total=756 [2023-08-26 11:28:59,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 11:28:59,686 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 11:28:59,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:59,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 11:28:59,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:29:04,620 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 11:29:22,541 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 11:29:23,191 INFO L124 PetriNetUnfolderBase]: 1360/2594 cut-off events. [2023-08-26 11:29:23,191 INFO L125 PetriNetUnfolderBase]: For 1995/1995 co-relation queries the response was YES. [2023-08-26 11:29:23,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6912 conditions, 2594 events. 1360/2594 cut-off events. For 1995/1995 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 14946 event pairs, 301 based on Foata normal form. 29/2482 useless extension candidates. Maximal degree in co-relation 6885. Up to 633 conditions per place. [2023-08-26 11:29:23,201 INFO L140 encePairwiseOnDemand]: 627/646 looper letters, 201 selfloop transitions, 89 changer transitions 0/293 dead transitions. [2023-08-26 11:29:23,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 293 transitions, 1761 flow [2023-08-26 11:29:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-26 11:29:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-26 11:29:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4131 transitions. [2023-08-26 11:29:23,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2780320366132723 [2023-08-26 11:29:23,221 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4131 transitions. [2023-08-26 11:29:23,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4131 transitions. [2023-08-26 11:29:23,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:29:23,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4131 transitions. [2023-08-26 11:29:23,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 179.6086956521739) internal successors, (4131), 23 states have internal predecessors, (4131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:29:23,235 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 11:29:23,236 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 11:29:23,236 INFO L175 Difference]: Start difference. First operand has 111 places, 92 transitions, 564 flow. Second operand 23 states and 4131 transitions. [2023-08-26 11:29:23,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 293 transitions, 1761 flow [2023-08-26 11:29:23,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 293 transitions, 1665 flow, removed 36 selfloop flow, removed 6 redundant places. [2023-08-26 11:29:23,246 INFO L231 Difference]: Finished difference. Result has 138 places, 144 transitions, 1069 flow [2023-08-26 11:29:23,246 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=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1069, PETRI_PLACES=138, PETRI_TRANSITIONS=144} [2023-08-26 11:29:23,247 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 34 predicate places. [2023-08-26 11:29:23,247 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 144 transitions, 1069 flow [2023-08-26 11:29:23,248 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 11:29:23,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:29:23,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:29:23,255 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 11:29:23,456 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 11:29:23,456 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 11:29:23,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:29:23,456 INFO L85 PathProgramCache]: Analyzing trace with hash 20455127, now seen corresponding path program 2 times [2023-08-26 11:29:23,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:29:23,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54530286] [2023-08-26 11:29:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:29:23,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:29:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:29:24,176 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 11:29:24,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:29:24,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54530286] [2023-08-26 11:29:24,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54530286] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:29:24,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982964711] [2023-08-26 11:29:24,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 11:29:24,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:29:24,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:29:24,177 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 11:29:24,179 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 11:29:24,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 11:29:24,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:29:24,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-26 11:29:24,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:29:24,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:29:24,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:29:24,332 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 11:29:24,332 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 11:29:24,351 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 11:29:24,352 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 11:29:24,463 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 11:29:24,572 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 11:29:24,712 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 11:29:24,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:29:24,766 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 11:29:24,821 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 11:29:24,861 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 11:29:24,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:29:25,022 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_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-08-26 11:29:25,033 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_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#id2~0#1.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 11:29:25,163 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:29:25,163 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 11:29:33,325 WARN L234 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:29:47,575 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 11:29:47,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982964711] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:29:47,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:29:47,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-26 11:29:47,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087776520] [2023-08-26 11:29:47,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:29:47,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-26 11:29:47,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:29:47,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-26 11:29:47,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=548, Unknown=28, NotChecked=102, Total=812 [2023-08-26 11:29:47,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 11:29:47,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 144 transitions, 1069 flow. Second operand has 29 states, 29 states have (on average 169.44827586206895) internal successors, (4914), 29 states have internal predecessors, (4914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:29:47,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:29:47,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 11:29:47,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:30:07,528 WARN L234 SmtUtils]: Spent 11.26s on a formula simplification. DAG size of input: 82 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:30:29,696 WARN L234 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 108 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:30:34,567 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 11:30:36,821 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 11:30:39,947 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 11:30:42,000 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 11:30:44,655 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 [0, 1] [2023-08-26 11:30:46,727 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 11:30:47,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 11:30:49,934 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 11:30:51,962 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 11:30:57,458 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 11:31:02,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 11:31:05,444 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 11:31:16,436 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 11:31:27,294 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 11:31:30,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:31:38,203 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 11:31:41,473 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 11:31:43,761 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 11:31:46,486 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 11:31:47,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:31:49,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 11:31:52,027 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 11:32:06,581 WARN L234 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 101 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:32:08,230 INFO L124 PetriNetUnfolderBase]: 2409/4588 cut-off events. [2023-08-26 11:32:08,230 INFO L125 PetriNetUnfolderBase]: For 19417/19419 co-relation queries the response was YES. [2023-08-26 11:32:08,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20114 conditions, 4588 events. 2409/4588 cut-off events. For 19417/19419 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 29571 event pairs, 544 based on Foata normal form. 39/4454 useless extension candidates. Maximal degree in co-relation 20076. Up to 1771 conditions per place. [2023-08-26 11:32:08,263 INFO L140 encePairwiseOnDemand]: 625/646 looper letters, 243 selfloop transitions, 90 changer transitions 0/336 dead transitions. [2023-08-26 11:32:08,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 336 transitions, 3152 flow [2023-08-26 11:32:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 11:32:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 11:32:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3430 transitions. [2023-08-26 11:32:08,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2794525012220955 [2023-08-26 11:32:08,310 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3430 transitions. [2023-08-26 11:32:08,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3430 transitions. [2023-08-26 11:32:08,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:32:08,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3430 transitions. [2023-08-26 11:32:08,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 180.52631578947367) internal successors, (3430), 19 states have internal predecessors, (3430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:32:08,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 646.0) internal successors, (12920), 20 states have internal predecessors, (12920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:32:08,322 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 646.0) internal successors, (12920), 20 states have internal predecessors, (12920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:32:08,322 INFO L175 Difference]: Start difference. First operand has 138 places, 144 transitions, 1069 flow. Second operand 19 states and 3430 transitions. [2023-08-26 11:32:08,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 336 transitions, 3152 flow [2023-08-26 11:32:08,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 336 transitions, 3003 flow, removed 56 selfloop flow, removed 8 redundant places. [2023-08-26 11:32:08,351 INFO L231 Difference]: Finished difference. Result has 157 places, 190 transitions, 1691 flow [2023-08-26 11:32:08,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1691, PETRI_PLACES=157, PETRI_TRANSITIONS=190} [2023-08-26 11:32:08,352 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 53 predicate places. [2023-08-26 11:32:08,352 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 190 transitions, 1691 flow [2023-08-26 11:32:08,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 169.44827586206895) internal successors, (4914), 29 states have internal predecessors, (4914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:32:08,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:32:08,353 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:32:08,363 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 11:32:08,557 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 11:32:08,558 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:32:08,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:32:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash 40705305, now seen corresponding path program 1 times [2023-08-26 11:32:08,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:32:08,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663938941] [2023-08-26 11:32:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:32:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:32:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:32:09,399 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 11:32:09,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:32:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663938941] [2023-08-26 11:32:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663938941] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:32:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283566488] [2023-08-26 11:32:09,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:32:09,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:32:09,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:32:09,400 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 11:32:09,409 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 11:32:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:32:09,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-26 11:32:09,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:32:09,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:09,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:09,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:09,562 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 11:32:10,140 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 11:32:10,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:32:10,471 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 11:32:10,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283566488] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:32:10,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:32:10,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 16 [2023-08-26 11:32:10,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041331132] [2023-08-26 11:32:10,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:32:10,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 11:32:10,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:32:10,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 11:32:10,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-08-26 11:32:10,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 646 [2023-08-26 11:32:10,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 190 transitions, 1691 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 11:32:10,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:32:10,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 646 [2023-08-26 11:32:10,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:32:13,981 INFO L124 PetriNetUnfolderBase]: 3480/6560 cut-off events. [2023-08-26 11:32:13,981 INFO L125 PetriNetUnfolderBase]: For 55263/55263 co-relation queries the response was YES. [2023-08-26 11:32:14,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35542 conditions, 6560 events. 3480/6560 cut-off events. For 55263/55263 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 42210 event pairs, 1079 based on Foata normal form. 216/6564 useless extension candidates. Maximal degree in co-relation 35498. Up to 2700 conditions per place. [2023-08-26 11:32:14,017 INFO L140 encePairwiseOnDemand]: 632/646 looper letters, 325 selfloop transitions, 79 changer transitions 0/407 dead transitions. [2023-08-26 11:32:14,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 407 transitions, 4495 flow [2023-08-26 11:32:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-26 11:32:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-26 11:32:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3931 transitions. [2023-08-26 11:32:14,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27659724176752043 [2023-08-26 11:32:14,023 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3931 transitions. [2023-08-26 11:32:14,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3931 transitions. [2023-08-26 11:32:14,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:32:14,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3931 transitions. [2023-08-26 11:32:14,027 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 11:32:14,034 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 11:32:14,035 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 11:32:14,035 INFO L175 Difference]: Start difference. First operand has 157 places, 190 transitions, 1691 flow. Second operand 22 states and 3931 transitions. [2023-08-26 11:32:14,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 407 transitions, 4495 flow [2023-08-26 11:32:14,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 407 transitions, 4175 flow, removed 142 selfloop flow, removed 6 redundant places. [2023-08-26 11:32:14,087 INFO L231 Difference]: Finished difference. Result has 180 places, 215 transitions, 1966 flow [2023-08-26 11:32:14,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1966, PETRI_PLACES=180, PETRI_TRANSITIONS=215} [2023-08-26 11:32:14,087 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 76 predicate places. [2023-08-26 11:32:14,087 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 215 transitions, 1966 flow [2023-08-26 11:32:14,088 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 11:32:14,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:32:14,088 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:32:14,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-26 11:32:14,292 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 11:32:14,292 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:32:14,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:32:14,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1994437768, now seen corresponding path program 1 times [2023-08-26 11:32:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:32:14,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580078984] [2023-08-26 11:32:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:32:14,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:32:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:32:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:32:15,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:32:15,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580078984] [2023-08-26 11:32:15,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580078984] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:32:15,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788353618] [2023-08-26 11:32:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:32:15,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:32:15,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:32:15,509 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 11:32:15,510 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 11:32:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:32:15,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 11:32:15,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:32:16,344 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 11 treesize of output 7 [2023-08-26 11:32:16,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:16,457 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 14 treesize of output 16 [2023-08-26 11:32:16,529 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 11:32:16,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:32:16,635 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_946 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_946) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_946 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_946) |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 11:32:16,649 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:32:16,649 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 11:32:16,674 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:32:16,674 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 11:32:16,685 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 11:32:16,728 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:32:16,728 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 11:32:16,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:32:16,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:16,738 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 11:32:17,126 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:32:17,127 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 11:32:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-26 11:32:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788353618] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:32:17,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:32:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 21 [2023-08-26 11:32:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559760362] [2023-08-26 11:32:17,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:32:17,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-26 11:32:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:32:17,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-26 11:32:17,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=365, Unknown=1, NotChecked=40, Total=506 [2023-08-26 11:32:17,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 11:32:17,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 215 transitions, 1966 flow. Second operand has 23 states, 23 states have (on average 175.7391304347826) internal successors, (4042), 23 states have internal predecessors, (4042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:32:17,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:32:17,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 11:32:17,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:32:20,320 INFO L124 PetriNetUnfolderBase]: 3869/7364 cut-off events. [2023-08-26 11:32:20,320 INFO L125 PetriNetUnfolderBase]: For 60402/60402 co-relation queries the response was YES. [2023-08-26 11:32:20,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39651 conditions, 7364 events. 3869/7364 cut-off events. For 60402/60402 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 48941 event pairs, 1255 based on Foata normal form. 29/6973 useless extension candidates. Maximal degree in co-relation 39597. Up to 4900 conditions per place. [2023-08-26 11:32:20,371 INFO L140 encePairwiseOnDemand]: 635/646 looper letters, 219 selfloop transitions, 40 changer transitions 0/262 dead transitions. [2023-08-26 11:32:20,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 262 transitions, 2953 flow [2023-08-26 11:32:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 11:32:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 11:32:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2006 transitions. [2023-08-26 11:32:20,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2822966507177033 [2023-08-26 11:32:20,386 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2006 transitions. [2023-08-26 11:32:20,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2006 transitions. [2023-08-26 11:32:20,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:32:20,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2006 transitions. [2023-08-26 11:32:20,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 182.36363636363637) internal successors, (2006), 11 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:32:20,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 646.0) internal successors, (7752), 12 states have internal predecessors, (7752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:32:20,391 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 646.0) internal successors, (7752), 12 states have internal predecessors, (7752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:32:20,391 INFO L175 Difference]: Start difference. First operand has 180 places, 215 transitions, 1966 flow. Second operand 11 states and 2006 transitions. [2023-08-26 11:32:20,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 262 transitions, 2953 flow [2023-08-26 11:32:20,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 262 transitions, 2828 flow, removed 52 selfloop flow, removed 6 redundant places. [2023-08-26 11:32:20,532 INFO L231 Difference]: Finished difference. Result has 185 places, 225 transitions, 2059 flow [2023-08-26 11:32:20,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2059, PETRI_PLACES=185, PETRI_TRANSITIONS=225} [2023-08-26 11:32:20,532 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 81 predicate places. [2023-08-26 11:32:20,532 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 225 transitions, 2059 flow [2023-08-26 11:32:20,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 175.7391304347826) internal successors, (4042), 23 states have internal predecessors, (4042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:32:20,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:32:20,533 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 11:32:20,539 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 11:32:20,738 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 11:32:20,738 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 11:32:20,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:32:20,738 INFO L85 PathProgramCache]: Analyzing trace with hash 197748058, now seen corresponding path program 3 times [2023-08-26 11:32:20,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:32:20,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319964240] [2023-08-26 11:32:20,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:32:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:32:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:32:22,775 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 11:32:22,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:32:22,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319964240] [2023-08-26 11:32:22,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319964240] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:32:22,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742457349] [2023-08-26 11:32:22,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 11:32:22,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:32:22,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:32:22,777 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 11:32:22,779 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 11:32:22,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 11:32:22,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:32:22,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 92 conjunts are in the unsatisfiable core [2023-08-26 11:32:22,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:32:23,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 28 [2023-08-26 11:32:23,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:23,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:23,040 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2023-08-26 11:32:23,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:23,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:23,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:23,069 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 11:32:23,312 INFO L322 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2023-08-26 11:32:23,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2023-08-26 11:32:23,862 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:32:23,862 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 1 case distinctions, treesize of input 28 treesize of output 23 [2023-08-26 11:32:24,142 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 19 treesize of output 18 [2023-08-26 11:32:24,481 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 28 treesize of output 16 [2023-08-26 11:32:24,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-26 11:32:24,739 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 14 treesize of output 16 [2023-08-26 11:32:24,951 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:32:24,951 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 1 case distinctions, treesize of input 28 treesize of output 23 [2023-08-26 11:32:25,134 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 26 treesize of output 21 [2023-08-26 11:32:25,363 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 16 [2023-08-26 11:32:25,477 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 21 treesize of output 21 [2023-08-26 11:32:25,589 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 11:32:25,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:32:25,690 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1064 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1064) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1064 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1064) |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 11:32:25,897 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_1064 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1064) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1064 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1064) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-08-26 11:32:28,881 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92|) (forall ((v_ArrVal_1058 Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1060 Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 .cse5 v_ArrVal_1058))) (store (store .cse3 .cse4 v_ArrVal_1060) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1064) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse5 0))))) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92|) (forall ((v_ArrVal_1058 Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1060 Int)) (<= 0 (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 .cse9 v_ArrVal_1058))) (store (store .cse8 .cse4 v_ArrVal_1060) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1064) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< .cse9 0))))))) is different from false [2023-08-26 11:32:32,066 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ (select .cse7 .cse8) 1))) (and (forall ((v_ArrVal_1054 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1058 Int) (v_ArrVal_1064 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int) (v_ArrVal_1060 Int)) (let ((.cse2 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1054)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92|) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 .cse5 v_ArrVal_1058))) (store (store .cse3 .cse4 v_ArrVal_1060) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1064) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)) (< .cse6 v_ArrVal_1054) (< .cse5 0))))) (forall ((v_ArrVal_1054 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1058 Int) (v_ArrVal_1064 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int) (v_ArrVal_1060 Int)) (let ((.cse10 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1054)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|)) (.cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)))) (or (< (select .cse9 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92|) (<= (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse9 .cse12 v_ArrVal_1058))) (store (store .cse11 .cse4 v_ArrVal_1060) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1064) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)) (< .cse6 v_ArrVal_1054) (< .cse12 0)))))))) is different from false [2023-08-26 11:32:32,153 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse7 .cse8))) (or (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ .cse13 1))) (and (forall ((v_ArrVal_1054 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1058 Int) (v_ArrVal_1064 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int) (v_ArrVal_1060 Int)) (let ((.cse2 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1054)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92|) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 .cse5 v_ArrVal_1058))) (store (store .cse3 .cse4 v_ArrVal_1060) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1064) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)) (< .cse6 v_ArrVal_1054) (< .cse5 0))))) (forall ((v_ArrVal_1054 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1058 Int) (v_ArrVal_1064 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int) (v_ArrVal_1060 Int)) (let ((.cse10 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1054)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|)) (.cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)))) (or (< (select .cse9 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92|) (<= (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse9 .cse12 v_ArrVal_1058))) (store (store .cse11 .cse4 v_ArrVal_1060) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1064) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)) (< .cse6 v_ArrVal_1054) (< .cse12 0))))))) (= .cse13 800)))) is different from false [2023-08-26 11:32:32,270 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse14 (select .cse7 .cse9))) (or (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ .cse14 1)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1052 Int) (v_ArrVal_1054 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1058 Int) (v_ArrVal_1064 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int) (v_ArrVal_1060 Int)) (let ((.cse2 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1052) .cse9 v_ArrVal_1054)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92|) (<= (+ (* 4 (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 .cse5 v_ArrVal_1058))) (store (store .cse3 .cse4 v_ArrVal_1060) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1064) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)) (< .cse6 v_ArrVal_1054) (< .cse5 0))))) (forall ((v_ArrVal_1052 Int) (v_ArrVal_1054 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1058 Int) (v_ArrVal_1064 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| Int) (v_ArrVal_1060 Int)) (let ((.cse10 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1052) .cse9 v_ArrVal_1054)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1056) |c_~#stored_elements~0.base| v_ArrVal_1057))) (let ((.cse12 (select .cse10 |c_~#queue~0.base|)) (.cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92| 4)))) (or (<= 0 (+ (* 4 (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse12 .cse13 v_ArrVal_1058))) (store (store .cse11 .cse4 v_ArrVal_1060) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1064) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|)) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_92|) (< .cse6 v_ArrVal_1054) (< .cse13 0))))))) (= .cse14 800)))) is different from false [2023-08-26 11:32:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-26 11:32:52,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742457349] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:32:52,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:32:52,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 39 [2023-08-26 11:32:52,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244682318] [2023-08-26 11:32:52,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:32:52,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-26 11:32:52,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:32:52,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-26 11:32:52,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1001, Unknown=33, NotChecked=426, Total=1640 [2023-08-26 11:32:52,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 11:32:52,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 225 transitions, 2059 flow. Second operand has 41 states, 41 states have (on average 169.609756097561) internal successors, (6954), 41 states have internal predecessors, (6954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:32:52,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:32:52,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 11:32:52,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:33:15,630 WARN L234 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 105 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:33:20,246 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 11:33:29,190 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 11:33:31,229 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 11:33:33,562 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 11:33:41,464 INFO L124 PetriNetUnfolderBase]: 3709/7065 cut-off events. [2023-08-26 11:33:41,464 INFO L125 PetriNetUnfolderBase]: For 57693/57693 co-relation queries the response was YES. [2023-08-26 11:33:41,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38538 conditions, 7065 events. 3709/7065 cut-off events. For 57693/57693 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 46212 event pairs, 1024 based on Foata normal form. 82/6794 useless extension candidates. Maximal degree in co-relation 38484. Up to 2794 conditions per place. [2023-08-26 11:33:41,523 INFO L140 encePairwiseOnDemand]: 627/646 looper letters, 298 selfloop transitions, 129 changer transitions 0/430 dead transitions. [2023-08-26 11:33:41,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 430 transitions, 5162 flow [2023-08-26 11:33:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-26 11:33:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-26 11:33:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4135 transitions. [2023-08-26 11:33:41,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27830125185085475 [2023-08-26 11:33:41,601 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4135 transitions. [2023-08-26 11:33:41,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4135 transitions. [2023-08-26 11:33:41,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:33:41,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4135 transitions. [2023-08-26 11:33:41,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 179.7826086956522) internal successors, (4135), 23 states have internal predecessors, (4135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:33:41,611 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 11:33:41,612 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 11:33:41,612 INFO L175 Difference]: Start difference. First operand has 185 places, 225 transitions, 2059 flow. Second operand 23 states and 4135 transitions. [2023-08-26 11:33:41,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 430 transitions, 5162 flow [2023-08-26 11:33:41,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 430 transitions, 5038 flow, removed 47 selfloop flow, removed 9 redundant places. [2023-08-26 11:33:41,662 INFO L231 Difference]: Finished difference. Result has 209 places, 275 transitions, 3120 flow [2023-08-26 11:33:41,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1784, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3120, PETRI_PLACES=209, PETRI_TRANSITIONS=275} [2023-08-26 11:33:41,662 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 105 predicate places. [2023-08-26 11:33:41,662 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 275 transitions, 3120 flow [2023-08-26 11:33:41,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 169.609756097561) internal successors, (6954), 41 states have internal predecessors, (6954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:33:41,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:33:41,663 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 11:33:41,675 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 11:33:41,868 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 11:33:41,869 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 11:33:41,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:33:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash 467873640, now seen corresponding path program 4 times [2023-08-26 11:33:41,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:33:41,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806361204] [2023-08-26 11:33:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:33:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:33:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:33:43,751 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 11:33:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:33:43,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806361204] [2023-08-26 11:33:43,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806361204] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:33:43,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112957128] [2023-08-26 11:33:43,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 11:33:43,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:33:43,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:33:43,752 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 11:33:43,754 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 11:33:43,916 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 11:33:43,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:33:43,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 93 conjunts are in the unsatisfiable core [2023-08-26 11:33:43,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:33:43,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:43,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:43,992 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 11:33:43,992 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 11:33:44,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:44,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:44,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:44,009 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 11:33:44,061 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 11:33:44,061 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 11:33:44,418 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 11:33:44,654 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 11:33:45,046 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 11:33:45,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:45,203 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 11:33:45,472 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 66 treesize of output 59 [2023-08-26 11:33:45,761 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 62 treesize of output 57 [2023-08-26 11:33:46,246 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 68 treesize of output 61 [2023-08-26 11:33:46,467 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 109 treesize of output 111 [2023-08-26 11:33:46,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:46,653 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 109 treesize of output 111 [2023-08-26 11:33:46,831 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 11:33:46,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:33:46,940 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1186 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1186 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1186) |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 11:33:46,969 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-08-26 11:33:46,992 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_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1))))))) is different from false [2023-08-26 11:33:49,659 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1179))) (store (store .cse0 .cse1 v_ArrVal_1182) .cse2 (+ (select .cse0 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse5))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1179))) (store (store .cse6 .cse1 v_ArrVal_1182) .cse2 (+ (select .cse6 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse5))))))) is different from false [2023-08-26 11:33:51,743 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse1 .cse2 v_ArrVal_1182) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse5 .cse2 v_ArrVal_1182) .cse3 (+ (select .cse5 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse3) 4))))))))) is different from false [2023-08-26 11:33:54,163 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (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))))) (and (forall ((v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse2 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse3 .cse4 v_ArrVal_1182) .cse1 (+ (select .cse3 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4)))))))) (forall ((v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse7 .cse4 v_ArrVal_1182) .cse1 (+ (select .cse7 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|))))))) is different from false [2023-08-26 11:33:54,202 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse2 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse3 .cse4 v_ArrVal_1182) .cse1 (+ (select .cse3 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse7 .cse4 v_ArrVal_1182) .cse1 (+ (select .cse7 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|))))))) is different from false [2023-08-26 11:33:54,816 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1174 Int) (v_ArrVal_1173 Int) (v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store .cse8 .cse9 v_ArrVal_1173))) (store (store .cse5 .cse6 v_ArrVal_1174) .cse7 (+ (select .cse5 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse1 .cse2 v_ArrVal_1182) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|))))) (forall ((v_ArrVal_1174 Int) (v_ArrVal_1173 Int) (v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse13 (store .cse8 .cse9 v_ArrVal_1173))) (store (store .cse13 .cse6 v_ArrVal_1174) .cse7 (+ (select .cse13 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (or (< (select .cse10 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse12 .cse2 v_ArrVal_1182) .cse3 (+ (select .cse12 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))) is different from false [2023-08-26 11:34:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-08-26 11:34:29,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112957128] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:34:29,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:34:29,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 38 [2023-08-26 11:34:29,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688679230] [2023-08-26 11:34:29,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:34:29,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-26 11:34:29,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:34:29,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-26 11:34:29,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=789, Unknown=51, NotChecked=536, Total=1560 [2023-08-26 11:34:29,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 11:34:29,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 275 transitions, 3120 flow. Second operand has 40 states, 40 states have (on average 169.65) internal successors, (6786), 40 states have internal predecessors, (6786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:34:29,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:34:29,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 11:34:29,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:34:40,172 WARN L234 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 118 DAG size of output: 113 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:35:05,750 WARN L234 SmtUtils]: Spent 17.29s on a formula simplification. DAG size of input: 156 DAG size of output: 135 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:35:10,910 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 ((.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1))) (and (forall ((v_ArrVal_1182 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1182) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) .cse5)) (forall ((v_ArrVal_1174 Int) (v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1174) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (< (select .cse6 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse8 .cse9 v_ArrVal_1182) .cse4 (+ (select .cse8 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse5)))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1182) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1174 Int) (v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1174) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (or (< (select .cse10 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse12 .cse9 v_ArrVal_1182) .cse4 (+ (select .cse12 .cse4) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))))))) is different from false [2023-08-26 11:35:12,865 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse3 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse4 .cse5 v_ArrVal_1182) .cse1 (+ (select .cse4 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse6)))))) (forall ((v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse8 .cse5 v_ArrVal_1182) .cse1 (+ (select .cse8 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|))))) (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4) 4) .cse6)))) is different from false [2023-08-26 11:35:13,689 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (select |c_#length| |c_~#queue~0.base|)) (.cse5 (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_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse2 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse3 .cse4 v_ArrVal_1182) .cse1 (+ (select .cse3 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4)))))))) (forall ((v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse7 .cse4 v_ArrVal_1182) .cse1 (+ (select .cse7 .cse1) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4)) .cse9)) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|))))) (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1)) 4) .cse9)) (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1))))))) is different from false [2023-08-26 11:35:14,007 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse1 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse1 .cse0) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse3 .cse4 v_ArrVal_1182) .cse0 (+ (select .cse3 .cse0) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse5)))))) (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse0) 4)) .cse5)) (forall ((v_ArrVal_1178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1178))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1182 Int) (v_ArrVal_1179 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_1179))) (store (store .cse7 .cse4 v_ArrVal_1182) .cse0 (+ (select .cse7 .cse0) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (< (select .cse8 .cse0) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99|))))))) is different from false [2023-08-26 11:35:18,349 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 11:35:20,579 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 11:35:41,620 WARN L234 SmtUtils]: Spent 20.35s on a formula simplification. DAG size of input: 102 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:36:04,651 WARN L234 SmtUtils]: Spent 17.72s on a formula simplification. DAG size of input: 151 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:36:07,395 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 11:36:09,442 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 [1] [2023-08-26 11:36:11,899 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 11:36:13,979 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 [1] [2023-08-26 11:36:15,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:36:18,404 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 11:36:19,230 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 ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1)) 4) .cse3)) (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1))))) (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1185) |c_~#stored_elements~0.base| v_ArrVal_1186) |c_~#queue~0.base|) .cse1) 4) 4) .cse3))))) is different from false [2023-08-26 11:36:21,338 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 11:36:23,397 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 [1] [2023-08-26 11:36:24,746 INFO L124 PetriNetUnfolderBase]: 4477/8504 cut-off events. [2023-08-26 11:36:24,746 INFO L125 PetriNetUnfolderBase]: For 156759/156759 co-relation queries the response was YES. [2023-08-26 11:36:24,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60388 conditions, 8504 events. 4477/8504 cut-off events. For 156759/156759 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 57870 event pairs, 1172 based on Foata normal form. 27/8168 useless extension candidates. Maximal degree in co-relation 60325. Up to 4114 conditions per place. [2023-08-26 11:36:24,814 INFO L140 encePairwiseOnDemand]: 625/646 looper letters, 320 selfloop transitions, 219 changer transitions 0/542 dead transitions. [2023-08-26 11:36:24,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 542 transitions, 8436 flow [2023-08-26 11:36:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-26 11:36:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-26 11:36:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6219 transitions. [2023-08-26 11:36:24,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2750552852720035 [2023-08-26 11:36:24,819 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 6219 transitions. [2023-08-26 11:36:24,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 6219 transitions. [2023-08-26 11:36:24,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:36:24,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 6219 transitions. [2023-08-26 11:36:24,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 177.68571428571428) internal successors, (6219), 35 states have internal predecessors, (6219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:36:24,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 646.0) internal successors, (23256), 36 states have internal predecessors, (23256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:36:24,834 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 646.0) internal successors, (23256), 36 states have internal predecessors, (23256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:36:24,834 INFO L175 Difference]: Start difference. First operand has 209 places, 275 transitions, 3120 flow. Second operand 35 states and 6219 transitions. [2023-08-26 11:36:24,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 542 transitions, 8436 flow [2023-08-26 11:36:24,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 542 transitions, 7775 flow, removed 314 selfloop flow, removed 4 redundant places. [2023-08-26 11:36:24,964 INFO L231 Difference]: Finished difference. Result has 256 places, 388 transitions, 5323 flow [2023-08-26 11:36:24,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=2591, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=5323, PETRI_PLACES=256, PETRI_TRANSITIONS=388} [2023-08-26 11:36:24,964 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 152 predicate places. [2023-08-26 11:36:24,964 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 388 transitions, 5323 flow [2023-08-26 11:36:24,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 169.65) internal successors, (6786), 40 states have internal predecessors, (6786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:36:24,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:36:24,965 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-08-26 11:36:24,970 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 11:36:25,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:36:25,170 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:36:25,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:36:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1681068791, now seen corresponding path program 5 times [2023-08-26 11:36:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:36:25,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032854076] [2023-08-26 11:36:25,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:36:25,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:36:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:36:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:36:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:36:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032854076] [2023-08-26 11:36:28,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032854076] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:36:28,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031017781] [2023-08-26 11:36:28,174 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-26 11:36:28,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:36:28,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:36:28,175 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 11:36:28,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 11:36:28,526 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-26 11:36:28,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:36:28,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 121 conjunts are in the unsatisfiable core [2023-08-26 11:36:28,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:36:28,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:36:28,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:36:28,607 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 11:36:28,607 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 11:36:28,658 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 11:36:28,659 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 11:36:29,173 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 11:36:29,425 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 11:36:29,888 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 11:36:30,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:36:30,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2023-08-26 11:36:30,084 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-26 11:36:30,492 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 66 treesize of output 59 [2023-08-26 11:36:30,786 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 62 treesize of output 57 [2023-08-26 11:36:31,428 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 68 treesize of output 61 [2023-08-26 11:36:31,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:36:31,658 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 109 treesize of output 111 [2023-08-26 11:36:31,692 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 109 treesize of output 111 [2023-08-26 11:36:32,242 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 123 treesize of output 116 [2023-08-26 11:36:32,963 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 119 treesize of output 114 [2023-08-26 11:36:34,068 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 125 treesize of output 118 [2023-08-26 11:36:34,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:36:34,371 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 223 treesize of output 225 [2023-08-26 11:36:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:36:34,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:36:34,804 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1330 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1330 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-26 11:36:34,824 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_1330 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1330 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1330) |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 11:36:34,845 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_1330 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1330 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1330) |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 11:36:35,242 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:36:35,242 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 11:36:51,211 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1323 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|) (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse3 .cse4 v_prenex_7) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse1) 803)))))) (forall ((v_ArrVal_1323 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|) (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse7 .cse4 v_ArrVal_1326) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))))) is different from false [2023-08-26 11:36:51,251 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse1 .cse2 v_ArrVal_1326) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int)) (let ((.cse5 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse6 .cse2 v_prenex_7) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse3) 803)) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))))) is different from false [2023-08-26 11:37:28,766 WARN L234 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:39:54,413 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse13 (select .cse12 .cse1))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111| Int)) (or (forall ((v_ArrVal_1309 Int) (v_ArrVal_1310 Int) (v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse6 (let ((.cse9 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (store .cse12 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1309))) (store (store .cse11 .cse4 v_ArrVal_1310) .cse1 (+ (select .cse11 .cse1) 1)))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1314))))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|) (forall ((v_ArrVal_1316 Int)) (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse8 (select .cse7 .cse1))) (or (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse2 (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1318) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (or (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse3 .cse4 v_prenex_7) .cse1 (+ 1 (select .cse3 .cse1))))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse1) 803)) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))) (= .cse8 800))))))))) (< .cse13 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111|))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111| Int)) (or (forall ((v_ArrVal_1309 Int) (v_ArrVal_1310 Int) (v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse17 (let ((.cse21 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse22 (store .cse12 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1309))) (store (store .cse22 .cse4 v_ArrVal_1310) .cse1 (+ (select .cse22 .cse1) 1)))))) (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1314))))) (let ((.cse20 (select .cse17 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1316 Int)) (let ((.cse18 (store .cse20 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse19 (select .cse18 .cse1))) (or (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse15 (store (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse4 v_ArrVal_1318) .cse1 (+ .cse19 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse14 (select .cse15 |c_~#queue~0.base|))) (or (< (select .cse14 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|) (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ (* (select (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse14 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse16 .cse4 v_ArrVal_1326) .cse1 (+ 1 (select .cse16 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (= .cse19 800))))) (< (select .cse20 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|))))) (< .cse13 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111|)))))) is different from false [2023-08-26 11:39:56,536 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse12 .cse2))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111| Int)) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1309 Int) (v_ArrVal_1310 Int) (v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse8 (let ((.cse10 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (store .cse12 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1309))) (store (store .cse11 .cse6 v_ArrVal_1310) .cse2 (+ (select .cse11 .cse2) 1)))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| v_ArrVal_1314))))) (let ((.cse1 (select .cse8 |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|) (forall ((v_ArrVal_1316 Int)) (let ((.cse9 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse3 (select .cse9 .cse2))) (or (= 800 .cse3) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse4 (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_1318) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ (* (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse5 .cse6 v_ArrVal_1326) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))))))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111| Int)) (or (forall ((v_ArrVal_1309 Int) (v_ArrVal_1310 Int) (v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse21 (store .cse12 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1309))) (store (store .cse21 .cse6 v_ArrVal_1310) .cse2 (+ (select .cse21 .cse2) 1)))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| v_ArrVal_1314))))) (let ((.cse13 (select .cse18 |c_~#queue~0.base|))) (or (< (select .cse13 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|) (forall ((v_ArrVal_1316 Int)) (let ((.cse19 (store .cse13 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse14 (select .cse19 .cse2))) (or (= 800 .cse14) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse15 (store (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse6 v_ArrVal_1318) .cse2 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (or (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse17 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse16 .cse6 v_prenex_7) .cse2 (+ (select .cse16 .cse2) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse2) 803)) (< (select .cse17 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))))))))))) (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111|)))))) is different from false [2023-08-26 11:39:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 2 times theorem prover too weak. 0 trivial. 12 not checked. [2023-08-26 11:39:56,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031017781] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:39:56,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:39:56,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 23] total 59 [2023-08-26 11:39:56,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38555218] [2023-08-26 11:39:56,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:39:56,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-08-26 11:39:56,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:39:56,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-08-26 11:39:56,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2479, Unknown=93, NotChecked=770, Total=3660 [2023-08-26 11:39:56,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 646 [2023-08-26 11:39:56,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 388 transitions, 5323 flow. Second operand has 61 states, 61 states have (on average 163.47540983606558) internal successors, (9972), 61 states have internal predecessors, (9972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:39:56,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:39:56,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 646 [2023-08-26 11:39:56,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:40:20,910 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse109 (select .cse3 .cse2))) (let ((.cse63 (+ .cse109 1))) (let ((.cse72 (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) (.cse32 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse2 .cse63)))) (let ((.cse16 (select .cse15 |c_~#stored_elements~0.base|)) (.cse33 (select .cse32 .cse5)) (.cse4 (+ .cse72 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse93 (select |c_#memory_int| |c_~#stored_elements~0.base|)) (.cse17 (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse6 (select .cse32 3204)) (.cse73 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1324))) (store (store .cse0 .cse1 v_ArrVal_1326) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse5) 4)))) (or (<= .cse6 800) (<= 802 .cse6)) (<= |c_~#stored_elements~0.base| 4) (<= 2 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse12 (store .cse15 |c_~#stored_elements~0.base| (store .cse16 .cse17 v_ArrVal_1314)))) (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1316 Int)) (let ((.cse13 (store .cse14 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse7 (select .cse13 .cse5))) (or (= .cse7 800) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse8 (store (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse10 v_ArrVal_1318) .cse5 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse9 .cse10 v_ArrVal_1326) .cse5 (+ (select .cse9 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (< (select .cse11 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))))))) (< (select .cse14 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|))))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1309 Int) (v_ArrVal_1310 Int) (v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse22 (let ((.cse25 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse26 (store .cse3 .cse4 v_ArrVal_1309))) (store (store .cse26 .cse1 v_ArrVal_1310) .cse2 (+ (select .cse26 .cse2) 1)))))) (store .cse25 |c_~#stored_elements~0.base| (store (select .cse25 |c_~#stored_elements~0.base|) .cse17 v_ArrVal_1314))))) (let ((.cse18 (select .cse22 |c_~#queue~0.base|))) (or (< (select .cse18 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|) (forall ((v_ArrVal_1316 Int)) (let ((.cse23 (store .cse18 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse24 (select .cse23 .cse5))) (or (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse20 (store (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse10 v_ArrVal_1318) .cse5 (+ .cse24 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse19 (select .cse20 |c_~#queue~0.base|))) (or (< (select .cse19 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|) (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse20 |c_~#queue~0.base| (let ((.cse21 (store .cse19 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse21 .cse10 v_prenex_7) .cse5 (+ (select .cse21 .cse5) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse5) 803)))))) (= 800 .cse24))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (or (forall ((v_ArrVal_1316 Int)) (let ((.cse31 (store .cse32 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse27 (select .cse31 .cse5))) (or (= .cse27 800) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse29 (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse31 .cse10 v_ArrVal_1318) .cse5 (+ .cse27 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse28 (select .cse29 |c_~#queue~0.base|))) (or (< (select .cse28 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|) (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse29 |c_~#queue~0.base| (let ((.cse30 (store .cse28 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse30 .cse10 v_ArrVal_1326) .cse5 (+ (select .cse30 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse5) 4)))))))))))) (< .cse33 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|))) (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse34 (store .cse3 .cse4 v_ArrVal_1324))) (store (store .cse34 .cse1 v_prenex_7) .cse2 (+ (select .cse34 .cse2) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse5))) (+ 3209 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int)) (let ((.cse35 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse37 (select .cse35 |c_~#queue~0.base|))) (or (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse35 |c_~#queue~0.base| (let ((.cse36 (store .cse37 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse36 .cse10 v_prenex_7) .cse5 (+ (select .cse36 .cse5) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse5) 803)) (< (select .cse37 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))) (forall ((v_ArrVal_1316 Int)) (let ((.cse41 (store .cse3 .cse4 v_ArrVal_1316))) (let ((.cse42 (select .cse41 .cse2))) (or (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse38 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse41 .cse1 v_ArrVal_1318) .cse2 (+ .cse42 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse40 (select .cse38 |c_~#queue~0.base|))) (or (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse38 |c_~#queue~0.base| (let ((.cse39 (store .cse40 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse39 .cse10 v_prenex_7) .cse5 (+ (select .cse39 .cse5) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse5) 803)) (< (select .cse40 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))) (= 800 .cse42))))) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse46 (store .cse15 |c_~#stored_elements~0.base| (store .cse16 .cse17 v_ArrVal_1314)))) (let ((.cse49 (select .cse46 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1316 Int)) (let ((.cse47 (store .cse49 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse48 (select .cse47 .cse5))) (or (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse43 (store (store (store .cse46 |c_~#queue~0.base| (store (store .cse47 .cse10 v_ArrVal_1318) .cse5 (+ .cse48 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse45 (select .cse43 |c_~#queue~0.base|))) (or (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse43 |c_~#queue~0.base| (let ((.cse44 (store .cse45 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse44 .cse10 v_prenex_7) .cse5 (+ (select .cse44 .cse5) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse5) 803)) (< (select .cse45 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))) (= .cse48 800))))) (< (select .cse49 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|))))) (forall ((v_ArrVal_1316 Int)) (let ((.cse54 (store .cse3 .cse4 v_ArrVal_1316))) (let ((.cse50 (select .cse54 .cse2))) (or (= 800 .cse50) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse51 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse54 .cse1 v_ArrVal_1318) .cse2 (+ .cse50 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse53 (select .cse51 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse51 |c_~#queue~0.base| (let ((.cse52 (store .cse53 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse52 .cse10 v_ArrVal_1326) .cse5 (+ (select .cse52 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse5) 4)))) (< (select .cse53 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))))))) (= 5 |c_~#queue~0.base|) (forall ((v_ArrVal_1310 Int) (v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse59 (let ((.cse62 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse1 v_ArrVal_1310) .cse2 .cse63)))) (store .cse62 |c_~#stored_elements~0.base| (store (select .cse62 |c_~#stored_elements~0.base|) .cse17 v_ArrVal_1314))))) (let ((.cse55 (select .cse59 |c_~#queue~0.base|))) (or (< (select .cse55 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|) (forall ((v_ArrVal_1316 Int)) (let ((.cse60 (store .cse55 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse61 (select .cse60 .cse5))) (or (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse57 (store (store (store .cse59 |c_~#queue~0.base| (store (store .cse60 .cse10 v_ArrVal_1318) .cse5 (+ .cse61 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse56 (select .cse57 |c_~#queue~0.base|))) (or (< (select .cse56 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|) (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse57 |c_~#queue~0.base| (let ((.cse58 (store .cse56 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse58 .cse10 v_prenex_7) .cse5 (+ (select .cse58 .cse5) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse5) 803)))))) (= .cse61 800))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (or (< .cse33 |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|) (forall ((v_ArrVal_1316 Int)) (let ((.cse67 (store .cse32 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse68 (select .cse67 .cse5))) (or (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse64 (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse67 .cse10 v_ArrVal_1318) .cse5 (+ .cse68 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse66 (select .cse64 |c_~#queue~0.base|))) (or (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse64 |c_~#queue~0.base| (let ((.cse65 (store .cse66 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse65 .cse10 v_prenex_7) .cse5 (+ (select .cse65 .cse5) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse5) 803)) (< (select .cse66 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))) (= .cse68 800))))))) (= (select .cse3 3204) |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int)) (let ((.cse69 (store (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse71 (select .cse69 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ (* (select (select (store (store .cse69 |c_~#queue~0.base| (let ((.cse70 (store .cse71 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse70 .cse10 v_ArrVal_1326) .cse5 (+ (select .cse70 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (< (select .cse71 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (<= (+ .cse72 3204) .cse73) (exists ((v_ArrVal_1309 Int) (|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| Int) (v_ArrVal_1310 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| Int) (v_ArrVal_1324 Int) (v_ArrVal_1316 Int)) (let ((.cse77 (store (store (store (store ((as const (Array Int Int)) 0) 3200 0) 3204 0) 3208 0) (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| 4) v_ArrVal_1309))) (let ((.cse75 (+ (select .cse77 3204) 1))) (let ((.cse76 (store (store (store .cse77 3208 v_ArrVal_1310) 3204 .cse75) (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| 4) v_ArrVal_1316))) (let ((.cse74 (+ (select .cse76 3204) 1))) (and (<= |t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse74) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| 0) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_104| .cse75) (= (store (store .cse76 3204 .cse74) (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|) v_ArrVal_1324) (select |c_#memory_int| 5)))))))) (not (= 801 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) (<= 2 .cse6) (forall ((v_ArrVal_1310 Int) (v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse82 (let ((.cse85 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse1 v_ArrVal_1310) .cse2 .cse63)))) (store .cse85 |c_~#stored_elements~0.base| (store (select .cse85 |c_~#stored_elements~0.base|) .cse17 v_ArrVal_1314))))) (let ((.cse78 (select .cse82 |c_~#queue~0.base|))) (or (< (select .cse78 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|) (forall ((v_ArrVal_1316 Int)) (let ((.cse83 (store .cse78 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse84 (select .cse83 .cse5))) (or (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse80 (store (store (store .cse82 |c_~#queue~0.base| (store (store .cse83 .cse10 v_ArrVal_1318) .cse5 (+ .cse84 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse79 (select .cse80 |c_~#queue~0.base|))) (or (< (select .cse79 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|) (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ (* (select (select (store (store .cse80 |c_~#queue~0.base| (let ((.cse81 (store .cse79 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse81 .cse10 v_ArrVal_1326) .cse5 (+ (select .cse81 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))))) (= .cse84 800))))))))) (forall ((v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse90 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse93 .cse17 v_ArrVal_1314)))) (let ((.cse92 (select .cse90 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1316 Int)) (let ((.cse91 (store .cse92 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse86 (select .cse91 .cse5))) (or (= .cse86 800) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse88 (store (store (store .cse90 |c_~#queue~0.base| (store (store .cse91 .cse10 v_ArrVal_1318) .cse5 (+ .cse86 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse87 (select .cse88 |c_~#queue~0.base|))) (or (< (select .cse87 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|) (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ (* (select (select (store (store .cse88 |c_~#queue~0.base| (let ((.cse89 (store .cse87 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse89 .cse10 v_ArrVal_1326) .cse5 (+ (select .cse89 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))))))))) (< (select .cse92 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|))))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1309 Int) (v_ArrVal_1310 Int) (v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse98 (let ((.cse101 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse102 (store .cse3 .cse4 v_ArrVal_1309))) (store (store .cse102 .cse1 v_ArrVal_1310) .cse2 (+ (select .cse102 .cse2) 1)))))) (store .cse101 |c_~#stored_elements~0.base| (store (select .cse101 |c_~#stored_elements~0.base|) .cse17 v_ArrVal_1314))))) (let ((.cse94 (select .cse98 |c_~#queue~0.base|))) (or (< (select .cse94 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|) (forall ((v_ArrVal_1316 Int)) (let ((.cse99 (store .cse94 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse100 (select .cse99 .cse5))) (or (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse96 (store (store (store .cse98 |c_~#queue~0.base| (store (store .cse99 .cse10 v_ArrVal_1318) .cse5 (+ .cse100 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse95 (select .cse96 |c_~#queue~0.base|))) (or (< (select .cse95 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|) (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ (* (select (select (store (store .cse96 |c_~#queue~0.base| (let ((.cse97 (store .cse95 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse97 .cse10 v_ArrVal_1326) .cse5 (+ (select .cse97 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))))) (= 800 .cse100))))))))) (or (and (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse103 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse1 v_ArrVal_1318) .cse2 .cse63)) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse105 (select .cse103 |c_~#queue~0.base|))) (or (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse103 |c_~#queue~0.base| (let ((.cse104 (store .cse105 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse104 .cse10 v_prenex_7) .cse5 (+ (select .cse104 .cse5) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse5) 803)) (< (select .cse105 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|))))) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse107 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse1 v_ArrVal_1318) .cse2 .cse63)) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse106 (select .cse107 |c_~#queue~0.base|))) (or (< (select .cse106 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|) (forall ((v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1324 Int) (v_ArrVal_1326 Int)) (<= 0 (+ (* (select (select (store (store .cse107 |c_~#queue~0.base| (let ((.cse108 (store .cse106 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse108 .cse10 v_ArrVal_1326) .cse5 (+ (select .cse108 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1330) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|)))))))) (= .cse109 800)) (forall ((v_ArrVal_1314 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int)) (let ((.cse114 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse93 .cse17 v_ArrVal_1314)))) (let ((.cse116 (select .cse114 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1316 Int)) (let ((.cse115 (store .cse116 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_1316))) (let ((.cse110 (select .cse115 .cse5))) (or (= .cse110 800) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| Int) (v_ArrVal_1318 Int)) (let ((.cse112 (store (store (store .cse114 |c_~#queue~0.base| (store (store .cse115 .cse10 v_ArrVal_1318) .cse5 (+ .cse110 1))) |c_~#stored_elements~0.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1323))) (let ((.cse111 (select .cse112 |c_~#queue~0.base|))) (or (< (select .cse111 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107|) (forall ((v_prenex_7 Int) (v_ArrVal_1324 Int) (v_prenex_6 (Array Int Int))) (< (select (select (store (store .cse112 |c_~#queue~0.base| (let ((.cse113 (store .cse111 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_107| 4)) v_ArrVal_1324))) (store (store .cse113 .cse10 v_prenex_7) .cse5 (+ (select .cse113 .cse5) 1)))) |c_~#stored_elements~0.base| v_prenex_6) |c_~#queue~0.base|) .cse5) 803)))))))))) (< (select .cse116 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109|))))) (<= (+ 3204 (* .cse6 4)) .cse73) (<= 3212 (select |c_#length| 5)))))))) is different from true [2023-08-26 11:41:04,057 WARN L234 SmtUtils]: Spent 14.72s on a formula simplification. DAG size of input: 422 DAG size of output: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:41:06,149 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] [2023-08-26 11:41:31,904 WARN L234 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 382 DAG size of output: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:41:34,758 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] Received shutdown request... [2023-08-26 11:42:33,862 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 11:42:33,862 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 11:42:34,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 11:42:35,063 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 11:42:35,109 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 11:42:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-26 11:42:35,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 11:42:35,111 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-26 11:42:35,114 INFO L158 Benchmark]: Toolchain (without parser) took 869624.09ms. Allocated memory was 354.4MB in the beginning and 775.9MB in the end (delta: 421.5MB). Free memory was 329.0MB in the beginning and 584.6MB in the end (delta: -255.6MB). Peak memory consumption was 557.4MB. Max. memory is 16.0GB. [2023-08-26 11:42:35,114 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 354.4MB. Free memory is still 331.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 11:42:35,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.99ms. Allocated memory is still 354.4MB. Free memory was 329.0MB in the beginning and 299.3MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 11:42:35,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.08ms. Allocated memory is still 354.4MB. Free memory was 299.3MB in the beginning and 296.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 11:42:35,114 INFO L158 Benchmark]: Boogie Preprocessor took 41.77ms. Allocated memory is still 354.4MB. Free memory was 296.1MB in the beginning and 294.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:42:35,115 INFO L158 Benchmark]: RCFGBuilder took 497.40ms. Allocated memory is still 354.4MB. Free memory was 294.0MB in the beginning and 314.7MB in the end (delta: -20.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.0GB. [2023-08-26 11:42:35,115 INFO L158 Benchmark]: TraceAbstraction took 868537.07ms. Allocated memory was 354.4MB in the beginning and 775.9MB in the end (delta: 421.5MB). Free memory was 313.7MB in the beginning and 584.6MB in the end (delta: -270.9MB). Peak memory consumption was 540.8MB. Max. memory is 16.0GB. [2023-08-26 11:42:35,115 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.09ms. Allocated memory is still 354.4MB. Free memory is still 331.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 484.99ms. Allocated memory is still 354.4MB. Free memory was 329.0MB in the beginning and 299.3MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.08ms. Allocated memory is still 354.4MB. Free memory was 299.3MB in the beginning and 296.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.77ms. Allocated memory is still 354.4MB. Free memory was 296.1MB in the beginning and 294.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 497.40ms. Allocated memory is still 354.4MB. Free memory was 294.0MB in the beginning and 314.7MB in the end (delta: -20.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.0GB. * TraceAbstraction took 868537.07ms. Allocated memory was 354.4MB in the beginning and 775.9MB in the end (delta: 421.5MB). Free memory was 313.7MB in the beginning and 584.6MB in the end (delta: -270.9MB). Peak memory consumption was 540.8MB. 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.1s, 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 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown