/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.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 11:26:47,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 11:26:47,455 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:26:47,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 11:26:47,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 11:26:47,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 11:26:47,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 11:26:47,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 11:26:47,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 11:26:47,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 11:26:47,489 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 11:26:47,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 11:26:47,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 11:26:47,490 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 11:26:47,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 11:26:47,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 11:26:47,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 11:26:47,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 11:26:47,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 11:26:47,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 11:26:47,491 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 11:26:47,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 11:26:47,491 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 11:26:47,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 11:26:47,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 11:26:47,492 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 11:26:47,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 11:26:47,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:26:47,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 11:26:47,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 11:26:47,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 11:26:47,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 11:26:47,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 11:26:47,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 11:26:47,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 11:26:47,494 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:26:47,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 11:26:47,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 11:26:47,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 11:26:47,732 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 11:26:47,732 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 11:26:47,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-08-26 11:26:48,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 11:26:48,896 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 11:26:48,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-08-26 11:26:48,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b296c9c5e/f5217711655c4f1684c33a870140c6c8/FLAG244a4baac [2023-08-26 11:26:48,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b296c9c5e/f5217711655c4f1684c33a870140c6c8 [2023-08-26 11:26:48,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 11:26:48,926 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 11:26:48,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 11:26:48,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 11:26:48,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 11:26:48,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:26:48" (1/1) ... [2023-08-26 11:26:48,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28428a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:48, skipping insertion in model container [2023-08-26 11:26:48,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:26:48" (1/1) ... [2023-08-26 11:26:48,978 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 11:26:49,321 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:26:49,332 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 11:26:49,356 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 11:26:49,357 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-26 11:26:49,362 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-26 11:26:49,375 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:26:49,417 INFO L206 MainTranslator]: Completed translation [2023-08-26 11:26:49,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:49 WrapperNode [2023-08-26 11:26:49,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 11:26:49,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 11:26:49,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 11:26:49,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 11:26:49,423 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:26:49" (1/1) ... [2023-08-26 11:26:49,446 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:26:49" (1/1) ... [2023-08-26 11:26:49,474 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 209 [2023-08-26 11:26:49,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 11:26:49,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 11:26:49,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 11:26:49,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 11:26:49,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:49" (1/1) ... [2023-08-26 11:26:49,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:49" (1/1) ... [2023-08-26 11:26:49,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:49" (1/1) ... [2023-08-26 11:26:49,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:49" (1/1) ... [2023-08-26 11:26:49,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:49" (1/1) ... [2023-08-26 11:26:49,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:49" (1/1) ... [2023-08-26 11:26:49,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:49" (1/1) ... [2023-08-26 11:26:49,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:49" (1/1) ... [2023-08-26 11:26:49,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 11:26:49,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 11:26:49,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 11:26:49,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 11:26:49,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:49" (1/1) ... [2023-08-26 11:26:49,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:26:49,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:26:49,543 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:26:49,568 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:26:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-26 11:26:49,575 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-26 11:26:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-26 11:26:49,575 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-26 11:26:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 11:26:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 11:26:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 11:26:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 11:26:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 11:26:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 11:26:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 11:26:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 11:26:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 11:26:49,577 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:26:49,718 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 11:26:49,719 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 11:26:50,062 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 11:26:50,075 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 11:26:50,075 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 11:26:50,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:26:50 BoogieIcfgContainer [2023-08-26 11:26:50,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 11:26:50,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 11:26:50,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 11:26:50,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 11:26:50,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 11:26:48" (1/3) ... [2023-08-26 11:26:50,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37463657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:26:50, skipping insertion in model container [2023-08-26 11:26:50,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:26:49" (2/3) ... [2023-08-26 11:26:50,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37463657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:26:50, skipping insertion in model container [2023-08-26 11:26:50,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:26:50" (3/3) ... [2023-08-26 11:26:50,082 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-08-26 11:26:50,093 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 11:26:50,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-08-26 11:26:50,094 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 11:26:50,236 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 11:26:50,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 274 places, 282 transitions, 580 flow [2023-08-26 11:26:50,373 INFO L124 PetriNetUnfolderBase]: 15/280 cut-off events. [2023-08-26 11:26:50,374 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 11:26:50,379 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:26:50,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 282 transitions, 580 flow [2023-08-26 11:26:50,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 271 transitions, 551 flow [2023-08-26 11:26:50,386 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 11:26:50,392 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 271 transitions, 551 flow [2023-08-26 11:26:50,393 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 271 transitions, 551 flow [2023-08-26 11:26:50,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 271 transitions, 551 flow [2023-08-26 11:26:50,422 INFO L124 PetriNetUnfolderBase]: 15/271 cut-off events. [2023-08-26 11:26:50,422 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 11:26:50,424 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:26:50,430 INFO L119 LiptonReduction]: Number of co-enabled transitions 18460 [2023-08-26 11:27:01,563 INFO L134 LiptonReduction]: Checked pairs total: 58098 [2023-08-26 11:27:01,563 INFO L136 LiptonReduction]: Total number of compositions: 364 [2023-08-26 11:27:01,572 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 11:27:01,576 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;@2d741cce, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 11:27:01,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2023-08-26 11:27:01,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 11:27:01,577 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 11:27:01,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:27:01,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:01,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 11:27:01,578 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:27:01,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:01,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1197, now seen corresponding path program 1 times [2023-08-26 11:27:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374578338] [2023-08-26 11:27:01,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:01,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:01,663 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:27:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374578338] [2023-08-26 11:27:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374578338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:01,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:01,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 11:27:01,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744699838] [2023-08-26 11:27:01,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:01,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 11:27:01,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:01,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 11:27:01,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 11:27:01,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 646 [2023-08-26 11:27:01,699 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:27:01,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:01,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 646 [2023-08-26 11:27:01,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:02,157 INFO L124 PetriNetUnfolderBase]: 4013/6423 cut-off events. [2023-08-26 11:27:02,158 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-08-26 11:27:02,163 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:27:02,184 INFO L140 encePairwiseOnDemand]: 610/646 looper letters, 61 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2023-08-26 11:27:02,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 267 flow [2023-08-26 11:27:02,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 11:27:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 11:27:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 635 transitions. [2023-08-26 11:27:02,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4914860681114551 [2023-08-26 11:27:02,194 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 635 transitions. [2023-08-26 11:27:02,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 635 transitions. [2023-08-26 11:27:02,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:02,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 635 transitions. [2023-08-26 11:27:02,200 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:27:02,204 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:27:02,204 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:27:02,206 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:27:02,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 267 flow [2023-08-26 11:27:02,208 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:27:02,209 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 140 flow [2023-08-26 11:27:02,210 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:27:02,212 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2023-08-26 11:27:02,212 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 140 flow [2023-08-26 11:27:02,213 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:27:02,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:02,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 11:27:02,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 11:27:02,213 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:27:02,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1181127, now seen corresponding path program 1 times [2023-08-26 11:27:02,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:02,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312690172] [2023-08-26 11:27:02,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:02,371 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:27:02,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:02,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312690172] [2023-08-26 11:27:02,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312690172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:02,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:02,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:27:02,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853188336] [2023-08-26 11:27:02,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:02,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:27:02,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:02,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:27:02,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:27:02,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 646 [2023-08-26 11:27:02,375 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:27:02,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:02,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 646 [2023-08-26 11:27:02,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:02,781 INFO L124 PetriNetUnfolderBase]: 4304/6761 cut-off events. [2023-08-26 11:27:02,781 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 11:27:02,785 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:27:02,811 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 60 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-08-26 11:27:02,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 258 flow [2023-08-26 11:27:02,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:27:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:27:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2023-08-26 11:27:02,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34055727554179566 [2023-08-26 11:27:02,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 660 transitions. [2023-08-26 11:27:02,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 660 transitions. [2023-08-26 11:27:02,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:02,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 660 transitions. [2023-08-26 11:27:02,817 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:27:02,820 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:27:02,821 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:27:02,821 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:27:02,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 258 flow [2023-08-26 11:27:02,822 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:27:02,823 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 138 flow [2023-08-26 11:27:02,823 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:27:02,824 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2023-08-26 11:27:02,825 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 138 flow [2023-08-26 11:27:02,827 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:27:02,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:02,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 11:27:02,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 11:27:02,828 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:27:02,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1181128, now seen corresponding path program 1 times [2023-08-26 11:27:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:02,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456732822] [2023-08-26 11:27:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:02,889 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:27:02,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:02,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456732822] [2023-08-26 11:27:02,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456732822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:02,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:02,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:27:02,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076598343] [2023-08-26 11:27:02,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:02,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:27:02,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:02,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:27:02,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:27:02,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 11:27:02,892 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:27:02,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:02,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 11:27:02,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:03,275 INFO L124 PetriNetUnfolderBase]: 4253/6661 cut-off events. [2023-08-26 11:27:03,275 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 11:27:03,279 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:27:03,300 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 58 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-08-26 11:27:03,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 252 flow [2023-08-26 11:27:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:27:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:27:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2023-08-26 11:27:03,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3364293085655315 [2023-08-26 11:27:03,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 652 transitions. [2023-08-26 11:27:03,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 652 transitions. [2023-08-26 11:27:03,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:03,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 652 transitions. [2023-08-26 11:27:03,351 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:27:03,353 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:27:03,354 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:27:03,354 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:27:03,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 252 flow [2023-08-26 11:27:03,355 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:27:03,356 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 135 flow [2023-08-26 11:27:03,356 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:27:03,357 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 11:27:03,357 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 135 flow [2023-08-26 11:27:03,357 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:27:03,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:03,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 11:27:03,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 11:27:03,358 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:27:03,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1135090846, now seen corresponding path program 1 times [2023-08-26 11:27:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:03,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519015641] [2023-08-26 11:27:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:03,502 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:27:03,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519015641] [2023-08-26 11:27:03,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519015641] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:03,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:03,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:27:03,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123091265] [2023-08-26 11:27:03,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:03,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:27:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:03,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:27:03,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:27:03,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 646 [2023-08-26 11:27:03,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 135 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:27:03,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:03,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 646 [2023-08-26 11:27:03,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:03,808 INFO L124 PetriNetUnfolderBase]: 3079/4910 cut-off events. [2023-08-26 11:27:03,808 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 11:27:03,811 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:27:03,824 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 57 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2023-08-26 11:27:03,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 249 flow [2023-08-26 11:27:03,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:27:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:27:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2023-08-26 11:27:03,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3384932920536636 [2023-08-26 11:27:03,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 656 transitions. [2023-08-26 11:27:03,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 656 transitions. [2023-08-26 11:27:03,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:03,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 656 transitions. [2023-08-26 11:27:03,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:27:03,830 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:27:03,831 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:27:03,831 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 135 flow. Second operand 3 states and 656 transitions. [2023-08-26 11:27:03,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 249 flow [2023-08-26 11:27:03,833 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:27:03,834 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 134 flow [2023-08-26 11:27:03,834 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:27:03,835 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 11:27:03,835 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 134 flow [2023-08-26 11:27:03,835 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:27:03,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:03,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 11:27:03,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 11:27:03,836 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:27:03,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:03,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1135090845, now seen corresponding path program 1 times [2023-08-26 11:27:03,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:03,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703574904] [2023-08-26 11:27:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:03,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:03,926 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:27:03,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:03,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703574904] [2023-08-26 11:27:03,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703574904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:03,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:03,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:27:03,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029921250] [2023-08-26 11:27:03,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:03,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:27:03,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:03,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:27:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:27:03,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 11:27:03,931 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:27:03,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:03,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 11:27:03,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:04,137 INFO L124 PetriNetUnfolderBase]: 1905/3159 cut-off events. [2023-08-26 11:27:04,139 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-26 11:27:04,141 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:27:04,148 INFO L140 encePairwiseOnDemand]: 644/646 looper letters, 56 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-08-26 11:27:04,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 246 flow [2023-08-26 11:27:04,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:27:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:27:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2023-08-26 11:27:04,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3302373581011352 [2023-08-26 11:27:04,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2023-08-26 11:27:04,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2023-08-26 11:27:04,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:04,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2023-08-26 11:27:04,152 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:27:04,154 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:27:04,155 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:27:04,155 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:27:04,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 246 flow [2023-08-26 11:27:04,156 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:27:04,156 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 133 flow [2023-08-26 11:27:04,156 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:27:04,157 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 11:27:04,157 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 133 flow [2023-08-26 11:27:04,157 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:27:04,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:04,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 11:27:04,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 11:27:04,158 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:27:04,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:04,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062955, now seen corresponding path program 1 times [2023-08-26 11:27:04,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:04,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257269573] [2023-08-26 11:27:04,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:04,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:04,235 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:27:04,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:04,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257269573] [2023-08-26 11:27:04,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257269573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:04,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:04,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:27:04,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319287236] [2023-08-26 11:27:04,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:04,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:27:04,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:04,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:27:04,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:27:04,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 11:27:04,237 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:27:04,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:04,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 11:27:04,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:04,402 INFO L124 PetriNetUnfolderBase]: 1691/2803 cut-off events. [2023-08-26 11:27:04,402 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-26 11:27:04,404 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:27:04,410 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 53 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2023-08-26 11:27:04,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 235 flow [2023-08-26 11:27:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:27:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:27:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2023-08-26 11:27:04,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32972136222910214 [2023-08-26 11:27:04,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 639 transitions. [2023-08-26 11:27:04,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 639 transitions. [2023-08-26 11:27:04,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:04,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 639 transitions. [2023-08-26 11:27:04,414 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:27:04,416 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:27:04,417 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:27:04,417 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:27:04,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 235 flow [2023-08-26 11:27:04,417 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:27:04,418 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 128 flow [2023-08-26 11:27:04,418 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:27:04,419 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -41 predicate places. [2023-08-26 11:27:04,419 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 128 flow [2023-08-26 11:27:04,419 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:27:04,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:04,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 11:27:04,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 11:27:04,419 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:27:04,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062954, now seen corresponding path program 1 times [2023-08-26 11:27:04,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:04,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746484211] [2023-08-26 11:27:04,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:04,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:04,513 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:27:04,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:04,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746484211] [2023-08-26 11:27:04,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746484211] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:04,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:04,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:27:04,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434092592] [2023-08-26 11:27:04,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:04,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:27:04,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:04,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:27:04,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:27:04,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 11:27:04,516 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:27:04,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:04,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 11:27:04,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:04,669 INFO L124 PetriNetUnfolderBase]: 1428/2366 cut-off events. [2023-08-26 11:27:04,669 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 11:27:04,671 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:27:04,676 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 49 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-08-26 11:27:04,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 220 flow [2023-08-26 11:27:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:27:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:27:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2023-08-26 11:27:04,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3328173374613003 [2023-08-26 11:27:04,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2023-08-26 11:27:04,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2023-08-26 11:27:04,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:04,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2023-08-26 11:27:04,680 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:27:04,682 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:27:04,682 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:27:04,682 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:27:04,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 220 flow [2023-08-26 11:27:04,682 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:27:04,683 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 121 flow [2023-08-26 11:27:04,683 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:27:04,684 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -44 predicate places. [2023-08-26 11:27:04,684 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 121 flow [2023-08-26 11:27:04,684 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:27:04,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:04,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 11:27:04,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 11:27:04,684 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:27:04,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:04,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062968, now seen corresponding path program 1 times [2023-08-26 11:27:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:04,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745044038] [2023-08-26 11:27:04,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:04,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:04,864 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:27:04,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:04,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745044038] [2023-08-26 11:27:04,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745044038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:04,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:04,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:27:04,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834225048] [2023-08-26 11:27:04,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:04,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:27:04,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:04,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:27:04,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:27:04,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 646 [2023-08-26 11:27:04,867 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:27:04,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:04,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 646 [2023-08-26 11:27:04,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:05,024 INFO L124 PetriNetUnfolderBase]: 1367/2307 cut-off events. [2023-08-26 11:27:05,025 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-26 11:27:05,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 2307 events. 1367/2307 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11560 event pairs, 919 based on Foata normal form. 0/1605 useless extension candidates. Maximal degree in co-relation 4541. Up to 2182 conditions per place. [2023-08-26 11:27:05,031 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 54 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-08-26 11:27:05,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 255 flow [2023-08-26 11:27:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:27:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:27:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2023-08-26 11:27:05,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37874097007223945 [2023-08-26 11:27:05,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 734 transitions. [2023-08-26 11:27:05,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 734 transitions. [2023-08-26 11:27:05,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:05,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 734 transitions. [2023-08-26 11:27:05,035 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:27:05,036 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:27:05,037 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:27:05,037 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:27:05,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 255 flow [2023-08-26 11:27:05,037 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:27:05,038 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 146 flow [2023-08-26 11:27:05,038 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:27:05,039 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -42 predicate places. [2023-08-26 11:27:05,039 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 146 flow [2023-08-26 11:27:05,039 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:27:05,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:05,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 11:27:05,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 11:27:05,039 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:27:05,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash 827212352, now seen corresponding path program 1 times [2023-08-26 11:27:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:05,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493719083] [2023-08-26 11:27:05,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:05,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:05,310 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:27:05,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:05,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493719083] [2023-08-26 11:27:05,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493719083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:05,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:27:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252668341] [2023-08-26 11:27:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:05,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:27:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:27:05,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:27:05,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 646 [2023-08-26 11:27:05,316 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:27:05,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:05,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 646 [2023-08-26 11:27:05,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:05,549 INFO L124 PetriNetUnfolderBase]: 1758/2954 cut-off events. [2023-08-26 11:27:05,549 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2023-08-26 11:27:05,552 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 15723 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:27:05,558 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 74 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2023-08-26 11:27:05,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 367 flow [2023-08-26 11:27:05,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:27:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:27:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2023-08-26 11:27:05,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325593395252838 [2023-08-26 11:27:05,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 631 transitions. [2023-08-26 11:27:05,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 631 transitions. [2023-08-26 11:27:05,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:05,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 631 transitions. [2023-08-26 11:27:05,562 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:27:05,564 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:27:05,564 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:27:05,564 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:27:05,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 367 flow [2023-08-26 11:27:05,565 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:27:05,566 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 178 flow [2023-08-26 11:27:05,566 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:27:05,566 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2023-08-26 11:27:05,566 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 178 flow [2023-08-26 11:27:05,567 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:27:05,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:05,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 11:27:05,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 11:27:05,567 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:27:05,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash 827214629, now seen corresponding path program 1 times [2023-08-26 11:27:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:05,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403560179] [2023-08-26 11:27:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:05,675 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:27:05,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:05,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403560179] [2023-08-26 11:27:05,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403560179] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:05,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:05,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:27:05,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630915262] [2023-08-26 11:27:05,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:05,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:27:05,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:05,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:27:05,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:27:05,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 646 [2023-08-26 11:27:05,678 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:27:05,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:05,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 646 [2023-08-26 11:27:05,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:05,937 INFO L124 PetriNetUnfolderBase]: 1851/3141 cut-off events. [2023-08-26 11:27:05,937 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2023-08-26 11:27:05,940 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 16983 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:27:05,945 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 82 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2023-08-26 11:27:05,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 406 flow [2023-08-26 11:27:05,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 11:27:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 11:27:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 830 transitions. [2023-08-26 11:27:05,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32120743034055727 [2023-08-26 11:27:05,948 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 830 transitions. [2023-08-26 11:27:05,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 830 transitions. [2023-08-26 11:27:05,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:05,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 830 transitions. [2023-08-26 11:27:05,949 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:27:05,952 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:27:05,952 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:27:05,952 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:27:05,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 406 flow [2023-08-26 11:27:05,954 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:27:05,954 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 173 flow [2023-08-26 11:27:05,955 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:27:05,955 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -39 predicate places. [2023-08-26 11:27:05,955 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 173 flow [2023-08-26 11:27:05,955 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:27:05,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:05,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:27:05,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 11:27:05,956 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:27:05,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash -986612324, now seen corresponding path program 1 times [2023-08-26 11:27:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:05,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312622193] [2023-08-26 11:27:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:05,988 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:27:05,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312622193] [2023-08-26 11:27:05,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312622193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:05,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:05,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:27:05,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791960891] [2023-08-26 11:27:05,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:05,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:27:05,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:05,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:27:05,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:27:05,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 646 [2023-08-26 11:27:05,991 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:27:05,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:05,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 646 [2023-08-26 11:27:05,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:06,094 INFO L124 PetriNetUnfolderBase]: 614/1214 cut-off events. [2023-08-26 11:27:06,094 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-08-26 11:27:06,095 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 46. Compared 6261 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:27:06,097 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 51 selfloop transitions, 2 changer transitions 8/68 dead transitions. [2023-08-26 11:27:06,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 311 flow [2023-08-26 11:27:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:27:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:27:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2023-08-26 11:27:06,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43653250773993807 [2023-08-26 11:27:06,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 846 transitions. [2023-08-26 11:27:06,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 846 transitions. [2023-08-26 11:27:06,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:06,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 846 transitions. [2023-08-26 11:27:06,101 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:27:06,103 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:27:06,103 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:27:06,103 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:27:06,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 311 flow [2023-08-26 11:27:06,104 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:27:06,105 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 165 flow [2023-08-26 11:27:06,105 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:27:06,105 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2023-08-26 11:27:06,105 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 165 flow [2023-08-26 11:27:06,106 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:27:06,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:06,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:27:06,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 11:27:06,106 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:27:06,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash -589188273, now seen corresponding path program 1 times [2023-08-26 11:27:06,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:06,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41476888] [2023-08-26 11:27:06,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:06,159 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:27:06,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:06,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41476888] [2023-08-26 11:27:06,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41476888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:06,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:06,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:27:06,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522144125] [2023-08-26 11:27:06,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:06,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:27:06,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:06,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:27:06,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:27:06,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 646 [2023-08-26 11:27:06,161 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:27:06,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:06,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 646 [2023-08-26 11:27:06,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:06,248 INFO L124 PetriNetUnfolderBase]: 539/1036 cut-off events. [2023-08-26 11:27:06,248 INFO L125 PetriNetUnfolderBase]: For 136/138 co-relation queries the response was YES. [2023-08-26 11:27:06,249 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 41. Compared 4939 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:27:06,251 INFO L140 encePairwiseOnDemand]: 643/646 looper letters, 49 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-26 11:27:06,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 53 transitions, 261 flow [2023-08-26 11:27:06,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:27:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:27:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2023-08-26 11:27:06,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32920536635706915 [2023-08-26 11:27:06,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 638 transitions. [2023-08-26 11:27:06,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 638 transitions. [2023-08-26 11:27:06,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:06,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 638 transitions. [2023-08-26 11:27:06,254 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:27:06,256 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:27:06,257 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:27:06,257 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:27:06,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 53 transitions, 261 flow [2023-08-26 11:27:06,257 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:27:06,258 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 159 flow [2023-08-26 11:27:06,258 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:27:06,258 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2023-08-26 11:27:06,259 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 159 flow [2023-08-26 11:27:06,259 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:27:06,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:06,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:27:06,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 11:27:06,259 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:27:06,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:06,259 INFO L85 PathProgramCache]: Analyzing trace with hash -589188272, now seen corresponding path program 1 times [2023-08-26 11:27:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:06,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66326838] [2023-08-26 11:27:06,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:06,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:06,349 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:27:06,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66326838] [2023-08-26 11:27:06,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66326838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:06,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:06,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:27:06,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677772048] [2023-08-26 11:27:06,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:06,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:27:06,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:06,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:27:06,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:27:06,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 11:27:06,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 196.75) internal successors, (787), 4 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have 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:27:06,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:06,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 11:27:06,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:06,451 INFO L124 PetriNetUnfolderBase]: 429/800 cut-off events. [2023-08-26 11:27:06,451 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2023-08-26 11:27:06,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 800 events. 429/800 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3362 event pairs, 260 based on Foata normal form. 10/744 useless extension candidates. Maximal degree in co-relation 1779. Up to 566 conditions per place. [2023-08-26 11:27:06,453 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 61 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2023-08-26 11:27:06,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 67 transitions, 319 flow [2023-08-26 11:27:06,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 11:27:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 11:27:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 839 transitions. [2023-08-26 11:27:06,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32469040247678016 [2023-08-26 11:27:06,455 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 839 transitions. [2023-08-26 11:27:06,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 839 transitions. [2023-08-26 11:27:06,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:06,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 839 transitions. [2023-08-26 11:27:06,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 209.75) internal successors, (839), 4 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have 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:27:06,459 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:27:06,460 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:27:06,460 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 159 flow. Second operand 4 states and 839 transitions. [2023-08-26 11:27:06,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 67 transitions, 319 flow [2023-08-26 11:27:06,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 316 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 11:27:06,461 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 168 flow [2023-08-26 11:27:06,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2023-08-26 11:27:06,462 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2023-08-26 11:27:06,462 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 168 flow [2023-08-26 11:27:06,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 196.75) internal successors, (787), 4 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have 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:27:06,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:06,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:27:06,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 11:27:06,463 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:27:06,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1084964103, now seen corresponding path program 1 times [2023-08-26 11:27:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:06,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73830119] [2023-08-26 11:27:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:06,685 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:27:06,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:06,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73830119] [2023-08-26 11:27:06,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73830119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:06,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:06,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:27:06,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897999828] [2023-08-26 11:27:06,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:06,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:27:06,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:06,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:27:06,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:27:06,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 646 [2023-08-26 11:27:06,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have 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:27:06,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:06,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 646 [2023-08-26 11:27:06,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:06,807 INFO L124 PetriNetUnfolderBase]: 421/793 cut-off events. [2023-08-26 11:27:06,807 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-08-26 11:27:06,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 793 events. 421/793 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3324 event pairs, 336 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1811. Up to 750 conditions per place. [2023-08-26 11:27:06,810 INFO L140 encePairwiseOnDemand]: 639/646 looper letters, 51 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2023-08-26 11:27:06,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 322 flow [2023-08-26 11:27:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 11:27:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 11:27:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1294 transitions. [2023-08-26 11:27:06,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33384932920536636 [2023-08-26 11:27:06,813 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1294 transitions. [2023-08-26 11:27:06,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1294 transitions. [2023-08-26 11:27:06,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:06,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1294 transitions. [2023-08-26 11:27:06,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have 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:27:06,819 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:27:06,819 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:27:06,820 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 168 flow. Second operand 6 states and 1294 transitions. [2023-08-26 11:27:06,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 322 flow [2023-08-26 11:27:06,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 64 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 11:27:06,821 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 222 flow [2023-08-26 11:27:06,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=65, 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=222, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2023-08-26 11:27:06,822 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -31 predicate places. [2023-08-26 11:27:06,822 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 222 flow [2023-08-26 11:27:06,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 208.4) internal successors, (1042), 5 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have 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:27:06,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:06,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:27:06,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 11:27:06,823 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:27:06,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:06,823 INFO L85 PathProgramCache]: Analyzing trace with hash -433731727, now seen corresponding path program 1 times [2023-08-26 11:27:06,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:06,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422774649] [2023-08-26 11:27:06,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:06,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:07,239 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:27:07,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:07,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422774649] [2023-08-26 11:27:07,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422774649] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:07,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:07,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 11:27:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735063069] [2023-08-26 11:27:07,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:07,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 11:27:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:07,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 11:27:07,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 11:27:07,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 11:27:07,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 222 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:27:07,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:07,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 11:27:07,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:07,466 INFO L124 PetriNetUnfolderBase]: 550/1031 cut-off events. [2023-08-26 11:27:07,466 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2023-08-26 11:27:07,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 1031 events. 550/1031 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4660 event pairs, 106 based on Foata normal form. 9/978 useless extension candidates. Maximal degree in co-relation 2479. Up to 687 conditions per place. [2023-08-26 11:27:07,469 INFO L140 encePairwiseOnDemand]: 636/646 looper letters, 68 selfloop transitions, 18 changer transitions 0/89 dead transitions. [2023-08-26 11:27:07,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 480 flow [2023-08-26 11:27:07,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 11:27:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 11:27:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1118 transitions. [2023-08-26 11:27:07,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2884416924664603 [2023-08-26 11:27:07,472 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1118 transitions. [2023-08-26 11:27:07,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1118 transitions. [2023-08-26 11:27:07,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:07,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1118 transitions. [2023-08-26 11:27:07,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 186.33333333333334) internal successors, (1118), 6 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have 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:27:07,477 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:27:07,477 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:27:07,478 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 222 flow. Second operand 6 states and 1118 transitions. [2023-08-26 11:27:07,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 480 flow [2023-08-26 11:27:07,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 89 transitions, 472 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 11:27:07,480 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 320 flow [2023-08-26 11:27:07,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2023-08-26 11:27:07,480 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -24 predicate places. [2023-08-26 11:27:07,480 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 320 flow [2023-08-26 11:27:07,481 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:27:07,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:07,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:27:07,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 11:27:07,481 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:27:07,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:07,481 INFO L85 PathProgramCache]: Analyzing trace with hash 821086537, now seen corresponding path program 2 times [2023-08-26 11:27:07,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:07,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489365478] [2023-08-26 11:27:07,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:07,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:07,854 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:27:07,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:07,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489365478] [2023-08-26 11:27:07,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489365478] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:27:07,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:27:07,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 11:27:07,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766594150] [2023-08-26 11:27:07,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:27:07,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 11:27:07,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:07,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 11:27:07,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 11:27:07,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 11:27:07,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 320 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:27:07,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:07,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 11:27:07,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:08,035 INFO L124 PetriNetUnfolderBase]: 519/990 cut-off events. [2023-08-26 11:27:08,036 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2023-08-26 11:27:08,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 990 events. 519/990 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4443 event pairs, 157 based on Foata normal form. 9/957 useless extension candidates. Maximal degree in co-relation 2638. Up to 646 conditions per place. [2023-08-26 11:27:08,039 INFO L140 encePairwiseOnDemand]: 640/646 looper letters, 76 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2023-08-26 11:27:08,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 91 transitions, 566 flow [2023-08-26 11:27:08,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 11:27:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 11:27:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1115 transitions. [2023-08-26 11:27:08,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28766769865841074 [2023-08-26 11:27:08,042 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1115 transitions. [2023-08-26 11:27:08,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1115 transitions. [2023-08-26 11:27:08,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:08,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1115 transitions. [2023-08-26 11:27:08,044 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:27:08,047 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:27:08,047 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:27:08,048 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 320 flow. Second operand 6 states and 1115 transitions. [2023-08-26 11:27:08,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 91 transitions, 566 flow [2023-08-26 11:27:08,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 91 transitions, 550 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 11:27:08,051 INFO L231 Difference]: Finished difference. Result has 86 places, 68 transitions, 360 flow [2023-08-26 11:27:08,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=86, PETRI_TRANSITIONS=68} [2023-08-26 11:27:08,051 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -18 predicate places. [2023-08-26 11:27:08,051 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 360 flow [2023-08-26 11:27:08,051 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:27:08,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:08,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:27:08,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 11:27:08,052 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:27:08,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash 693396545, now seen corresponding path program 1 times [2023-08-26 11:27:08,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:08,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24475966] [2023-08-26 11:27:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:08,521 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:27:08,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24475966] [2023-08-26 11:27:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24475966] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:27:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166576828] [2023-08-26 11:27:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:08,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:27:08,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:27:08,523 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:27:08,527 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:27:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:08,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-26 11:27:08,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:27:08,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:27:08,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:27:08,686 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 11:27:08,687 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:27:08,696 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 11:27:08,696 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 11 treesize of output 11 [2023-08-26 11:27:08,763 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:27:08,841 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:27:08,948 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:27:08,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:27:08,982 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:27:09,011 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:27:09,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:27:09,149 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_534 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_534) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_537) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_534 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_534) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_537) |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:27:09,161 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:27:09,161 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:27:22,725 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:27:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166576828] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:27:22,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:27:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2023-08-26 11:27:22,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897948309] [2023-08-26 11:27:22,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:27:22,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-26 11:27:22,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:27:22,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-26 11:27:22,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=421, Unknown=13, NotChecked=44, Total=600 [2023-08-26 11:27:22,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 11:27:22,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 360 flow. Second operand has 25 states, 25 states have (on average 174.56) internal successors, (4364), 25 states have internal predecessors, (4364), 0 states have call successors, (0), 0 states have 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:27:22,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:27:22,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 11:27:22,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:27:32,622 WARN L234 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 89 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:27:34,736 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:27:44,549 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:27:50,511 WARN L234 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 61 DAG size of output: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:27:55,007 INFO L124 PetriNetUnfolderBase]: 680/1309 cut-off events. [2023-08-26 11:27:55,007 INFO L125 PetriNetUnfolderBase]: For 903/903 co-relation queries the response was YES. [2023-08-26 11:27:55,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3575 conditions, 1309 events. 680/1309 cut-off events. For 903/903 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6593 event pairs, 440 based on Foata normal form. 12/1253 useless extension candidates. Maximal degree in co-relation 3557. Up to 973 conditions per place. [2023-08-26 11:27:55,012 INFO L140 encePairwiseOnDemand]: 634/646 looper letters, 105 selfloop transitions, 35 changer transitions 0/143 dead transitions. [2023-08-26 11:27:55,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 143 transitions, 948 flow [2023-08-26 11:27:55,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 11:27:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 11:27:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3417 transitions. [2023-08-26 11:27:55,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.278393351800554 [2023-08-26 11:27:55,019 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3417 transitions. [2023-08-26 11:27:55,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3417 transitions. [2023-08-26 11:27:55,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:27:55,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3417 transitions. [2023-08-26 11:27:55,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 179.8421052631579) internal successors, (3417), 19 states have internal predecessors, (3417), 0 states have call successors, (0), 0 states have 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:27:55,033 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:27:55,034 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:27:55,034 INFO L175 Difference]: Start difference. First operand has 86 places, 68 transitions, 360 flow. Second operand 19 states and 3417 transitions. [2023-08-26 11:27:55,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 143 transitions, 948 flow [2023-08-26 11:27:55,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 143 transitions, 932 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 11:27:55,039 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 634 flow [2023-08-26 11:27:55,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=634, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2023-08-26 11:27:55,039 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 7 predicate places. [2023-08-26 11:27:55,039 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 634 flow [2023-08-26 11:27:55,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 174.56) internal successors, (4364), 25 states have internal predecessors, (4364), 0 states have call successors, (0), 0 states have 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:27:55,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:27:55,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:27:55,047 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:27:55,245 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,SelfDestructingSolverStorable16 [2023-08-26 11:27:55,245 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:27:55,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:27:55,246 INFO L85 PathProgramCache]: Analyzing trace with hash -593236279, now seen corresponding path program 1 times [2023-08-26 11:27:55,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:27:55,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189388197] [2023-08-26 11:27:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:55,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:27:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:56,143 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:27:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:27:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189388197] [2023-08-26 11:27:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189388197] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:27:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892130430] [2023-08-26 11:27:56,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:27:56,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:27:56,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:27:56,144 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:27:56,146 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:27:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:27:56,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-26 11:27:56,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:27:56,337 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:27:56,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:27:56,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:27:56,371 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 11:27:56,371 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 12 treesize of output 20 [2023-08-26 11:27:56,403 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 11:27:56,404 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:27:56,525 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:27:56,698 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:27:56,699 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:27:56,866 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:27:57,010 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:27:57,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:27:57,095 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:27:57,146 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:27:57,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:27:57,199 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_630 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_630 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2023-08-26 11:27:57,309 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 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_630 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_630 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-08-26 11:27:57,480 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:27:57,480 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:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:28:05,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892130430] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:28:05,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:28:05,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2023-08-26 11:28:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390270253] [2023-08-26 11:28:05,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:28:05,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-26 11:28:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:05,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-26 11:28:05,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=487, Unknown=19, NotChecked=94, Total=702 [2023-08-26 11:28:05,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 11:28:05,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 93 transitions, 634 flow. Second operand has 27 states, 27 states have (on average 169.55555555555554) internal successors, (4578), 27 states have internal predecessors, (4578), 0 states have call successors, (0), 0 states have 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:05,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:05,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 11:28:05,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:15,136 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:17,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:28:19,614 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:21,623 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:28:29,173 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:28:38,141 INFO L124 PetriNetUnfolderBase]: 1202/2327 cut-off events. [2023-08-26 11:28:38,141 INFO L125 PetriNetUnfolderBase]: For 2355/2355 co-relation queries the response was YES. [2023-08-26 11:28:38,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6547 conditions, 2327 events. 1202/2327 cut-off events. For 2355/2355 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 13436 event pairs, 230 based on Foata normal form. 29/2248 useless extension candidates. Maximal degree in co-relation 6520. Up to 703 conditions per place. [2023-08-26 11:28:38,151 INFO L140 encePairwiseOnDemand]: 625/646 looper letters, 158 selfloop transitions, 76 changer transitions 0/237 dead transitions. [2023-08-26 11:28:38,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 237 transitions, 1641 flow [2023-08-26 11:28:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 11:28:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 11:28:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2714 transitions. [2023-08-26 11:28:38,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2800825593395253 [2023-08-26 11:28:38,157 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2714 transitions. [2023-08-26 11:28:38,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2714 transitions. [2023-08-26 11:28:38,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:38,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2714 transitions. [2023-08-26 11:28:38,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 180.93333333333334) internal successors, (2714), 15 states have internal predecessors, (2714), 0 states have call successors, (0), 0 states have 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:38,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 646.0) internal successors, (10336), 16 states have internal predecessors, (10336), 0 states have call successors, (0), 0 states have 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:38,169 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 646.0) internal successors, (10336), 16 states have internal predecessors, (10336), 0 states have call successors, (0), 0 states have 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:38,169 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 634 flow. Second operand 15 states and 2714 transitions. [2023-08-26 11:28:38,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 237 transitions, 1641 flow [2023-08-26 11:28:38,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 237 transitions, 1511 flow, removed 53 selfloop flow, removed 6 redundant places. [2023-08-26 11:28:38,180 INFO L231 Difference]: Finished difference. Result has 125 places, 138 transitions, 1072 flow [2023-08-26 11:28:38,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1072, PETRI_PLACES=125, PETRI_TRANSITIONS=138} [2023-08-26 11:28:38,181 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 21 predicate places. [2023-08-26 11:28:38,181 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 138 transitions, 1072 flow [2023-08-26 11:28:38,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 169.55555555555554) internal successors, (4578), 27 states have internal predecessors, (4578), 0 states have call successors, (0), 0 states have 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:38,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:38,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:28:38,192 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:28:38,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 11:28:38,387 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:38,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:38,388 INFO L85 PathProgramCache]: Analyzing trace with hash 20437457, now seen corresponding path program 2 times [2023-08-26 11:28:38,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:38,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371380791] [2023-08-26 11:28:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:38,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:39,127 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:39,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:39,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371380791] [2023-08-26 11:28:39,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371380791] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:28:39,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300869600] [2023-08-26 11:28:39,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 11:28:39,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:28:39,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:28:39,137 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:28:39,155 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:28:39,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 11:28:39,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:28:39,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-26 11:28:39,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:28:39,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:39,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:39,299 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 11:28:39,299 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:39,343 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 11:28:39,344 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:39,557 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:39,683 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:39,897 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:28:39,967 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:28:40,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:40,038 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:28:40,094 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:40,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:28:40,102 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 38 treesize of output 34 [2023-08-26 11:28:40,650 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_722 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_722) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_726) |c_~#stored_elements~0.base| v_ArrVal_727) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_722 Int)) (< (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_722) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_726) |c_~#stored_elements~0.base| v_ArrVal_727) |c_~#queue~0.base|) .cse4) 22))))) is different from false [2023-08-26 11:28:40,683 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |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 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_720 Int) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_722 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_720))) (store (store .cse0 .cse1 v_ArrVal_722) .cse2 (+ (select .cse0 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_726) |c_~#stored_elements~0.base| v_ArrVal_727) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_720 Int) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_722 Int)) (< (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_720))) (store (store .cse6 .cse1 v_ArrVal_722) .cse2 (+ (select .cse6 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_726) |c_~#stored_elements~0.base| v_ArrVal_727) |c_~#queue~0.base|) .cse5) 22)))) is different from false [2023-08-26 11:28:43,169 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:43,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300869600] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:28:43,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:28:43,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-26 11:28:43,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778508749] [2023-08-26 11:28:43,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:28:43,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-26 11:28:43,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:43,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-26 11:28:43,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=432, Unknown=16, NotChecked=90, Total=650 [2023-08-26 11:28:43,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 11:28:43,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 138 transitions, 1072 flow. Second operand has 26 states, 26 states have (on average 169.6153846153846) internal successors, (4410), 26 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have 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:43,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:43,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 11:28:43,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:28:58,061 INFO L124 PetriNetUnfolderBase]: 1705/3271 cut-off events. [2023-08-26 11:28:58,061 INFO L125 PetriNetUnfolderBase]: For 9219/9226 co-relation queries the response was YES. [2023-08-26 11:28:58,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13368 conditions, 3271 events. 1705/3271 cut-off events. For 9219/9226 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 20281 event pairs, 350 based on Foata normal form. 18/3159 useless extension candidates. Maximal degree in co-relation 13335. Up to 1486 conditions per place. [2023-08-26 11:28:58,076 INFO L140 encePairwiseOnDemand]: 627/646 looper letters, 206 selfloop transitions, 72 changer transitions 0/281 dead transitions. [2023-08-26 11:28:58,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 281 transitions, 2557 flow [2023-08-26 11:28:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-26 11:28:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-26 11:28:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3215 transitions. [2023-08-26 11:28:58,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2764877880976952 [2023-08-26 11:28:58,082 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3215 transitions. [2023-08-26 11:28:58,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3215 transitions. [2023-08-26 11:28:58,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:28:58,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3215 transitions. [2023-08-26 11:28:58,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 178.61111111111111) internal successors, (3215), 18 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have 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:58,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 646.0) internal successors, (12274), 19 states have internal predecessors, (12274), 0 states have call successors, (0), 0 states have 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:58,092 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 646.0) internal successors, (12274), 19 states have internal predecessors, (12274), 0 states have call successors, (0), 0 states have 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:58,092 INFO L175 Difference]: Start difference. First operand has 125 places, 138 transitions, 1072 flow. Second operand 18 states and 3215 transitions. [2023-08-26 11:28:58,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 281 transitions, 2557 flow [2023-08-26 11:28:58,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 281 transitions, 2427 flow, removed 53 selfloop flow, removed 5 redundant places. [2023-08-26 11:28:58,112 INFO L231 Difference]: Finished difference. Result has 144 places, 177 transitions, 1550 flow [2023-08-26 11:28:58,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1550, PETRI_PLACES=144, PETRI_TRANSITIONS=177} [2023-08-26 11:28:58,113 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 40 predicate places. [2023-08-26 11:28:58,113 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 177 transitions, 1550 flow [2023-08-26 11:28:58,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 169.6153846153846) internal successors, (4410), 26 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have 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:58,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:28:58,113 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:28:58,123 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:28:58,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:28:58,318 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:28:58,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:28:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash 40705305, now seen corresponding path program 1 times [2023-08-26 11:28:58,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:28:58,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658933010] [2023-08-26 11:28:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:28:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:59,088 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:28:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:28:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658933010] [2023-08-26 11:28:59,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658933010] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:28:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700062772] [2023-08-26 11:28:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:28:59,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:28:59,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:28:59,090 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:28:59,091 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:28:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:28:59,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-26 11:28:59,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:28:59,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:59,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:59,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:28:59,217 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:59,493 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:28:59,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:28:59,696 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:28:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700062772] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:28:59,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:28:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3, 3] total 15 [2023-08-26 11:28:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136702731] [2023-08-26 11:28:59,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:28:59,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 11:28:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:28:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 11:28:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-08-26 11:28:59,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 646 [2023-08-26 11:28:59,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 177 transitions, 1550 flow. Second operand has 16 states, 16 states have (on average 170.5625) internal successors, (2729), 16 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have 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,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:28:59,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 646 [2023-08-26 11:28:59,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:29:02,051 INFO L124 PetriNetUnfolderBase]: 2933/5532 cut-off events. [2023-08-26 11:29:02,051 INFO L125 PetriNetUnfolderBase]: For 31386/31386 co-relation queries the response was YES. [2023-08-26 11:29:02,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27854 conditions, 5532 events. 2933/5532 cut-off events. For 31386/31386 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 34403 event pairs, 874 based on Foata normal form. 223/5581 useless extension candidates. Maximal degree in co-relation 27814. Up to 2255 conditions per place. [2023-08-26 11:29:02,084 INFO L140 encePairwiseOnDemand]: 632/646 looper letters, 300 selfloop transitions, 82 changer transitions 0/385 dead transitions. [2023-08-26 11:29:02,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 385 transitions, 3970 flow [2023-08-26 11:29:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-26 11:29:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-26 11:29:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3931 transitions. [2023-08-26 11:29:02,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27659724176752043 [2023-08-26 11:29:02,088 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3931 transitions. [2023-08-26 11:29:02,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3931 transitions. [2023-08-26 11:29:02,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:29:02,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3931 transitions. [2023-08-26 11:29:02,092 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:29:02,099 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:29:02,099 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:29:02,100 INFO L175 Difference]: Start difference. First operand has 144 places, 177 transitions, 1550 flow. Second operand 22 states and 3931 transitions. [2023-08-26 11:29:02,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 385 transitions, 3970 flow [2023-08-26 11:29:02,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 385 transitions, 3695 flow, removed 124 selfloop flow, removed 5 redundant places. [2023-08-26 11:29:02,147 INFO L231 Difference]: Finished difference. Result has 167 places, 187 transitions, 1789 flow [2023-08-26 11:29:02,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1789, PETRI_PLACES=167, PETRI_TRANSITIONS=187} [2023-08-26 11:29:02,148 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 63 predicate places. [2023-08-26 11:29:02,148 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 187 transitions, 1789 flow [2023-08-26 11:29:02,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 170.5625) internal successors, (2729), 16 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have 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:02,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:29:02,149 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:29:02,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 11:29:02,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:29:02,353 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:29:02,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:29:02,354 INFO L85 PathProgramCache]: Analyzing trace with hash -696392966, now seen corresponding path program 1 times [2023-08-26 11:29:02,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:29:02,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543490223] [2023-08-26 11:29:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:29:02,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:29:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:29:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:29:03,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:29:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543490223] [2023-08-26 11:29:03,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543490223] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:29:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376953230] [2023-08-26 11:29:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:29:03,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:29:03,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:29:03,329 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:29:03,331 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:29:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:29:03,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 11:29:03,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:29:03,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 11:29:03,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:29:03,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 11:29:03,940 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:29:03,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:29:04,084 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:29:04,084 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:29:04,098 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:29:04,098 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 50 treesize of output 49 [2023-08-26 11:29:04,119 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 14 treesize of output 10 [2023-08-26 11:29:04,128 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:29:04,128 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:29:04,131 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:29:04,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:29:04,135 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 24 treesize of output 12 [2023-08-26 11:29:04,379 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:29:04,379 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:29:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:29:04,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376953230] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:29:04,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:29:04,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 23 [2023-08-26 11:29:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587346288] [2023-08-26 11:29:04,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:29:04,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-26 11:29:04,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:29:04,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-26 11:29:04,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=454, Unknown=5, NotChecked=0, Total=552 [2023-08-26 11:29:04,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 11:29:04,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 187 transitions, 1789 flow. Second operand has 24 states, 24 states have (on average 170.625) internal successors, (4095), 24 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have 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:04,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:29:04,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 11:29:04,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:29:07,315 INFO L124 PetriNetUnfolderBase]: 2299/4398 cut-off events. [2023-08-26 11:29:07,315 INFO L125 PetriNetUnfolderBase]: For 27622/27634 co-relation queries the response was YES. [2023-08-26 11:29:07,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22785 conditions, 4398 events. 2299/4398 cut-off events. For 27622/27634 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 25774 event pairs, 697 based on Foata normal form. 75/4277 useless extension candidates. Maximal degree in co-relation 22735. Up to 2069 conditions per place. [2023-08-26 11:29:07,337 INFO L140 encePairwiseOnDemand]: 635/646 looper letters, 213 selfloop transitions, 54 changer transitions 0/270 dead transitions. [2023-08-26 11:29:07,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 270 transitions, 3054 flow [2023-08-26 11:29:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 11:29:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 11:29:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2508 transitions. [2023-08-26 11:29:07,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2773109243697479 [2023-08-26 11:29:07,340 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2508 transitions. [2023-08-26 11:29:07,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2508 transitions. [2023-08-26 11:29:07,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:29:07,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2508 transitions. [2023-08-26 11:29:07,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 179.14285714285714) internal successors, (2508), 14 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have 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:07,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 646.0) internal successors, (9690), 15 states have internal predecessors, (9690), 0 states have call successors, (0), 0 states have 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:07,347 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 646.0) internal successors, (9690), 15 states have internal predecessors, (9690), 0 states have call successors, (0), 0 states have 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:07,347 INFO L175 Difference]: Start difference. First operand has 167 places, 187 transitions, 1789 flow. Second operand 14 states and 2508 transitions. [2023-08-26 11:29:07,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 270 transitions, 3054 flow [2023-08-26 11:29:07,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 270 transitions, 2931 flow, removed 43 selfloop flow, removed 8 redundant places. [2023-08-26 11:29:07,378 INFO L231 Difference]: Finished difference. Result has 175 places, 189 transitions, 1841 flow [2023-08-26 11:29:07,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1841, PETRI_PLACES=175, PETRI_TRANSITIONS=189} [2023-08-26 11:29:07,378 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 71 predicate places. [2023-08-26 11:29:07,378 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 189 transitions, 1841 flow [2023-08-26 11:29:07,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 170.625) internal successors, (4095), 24 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have 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:07,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:29:07,379 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 11:29:07,384 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:29:07,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:29:07,584 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:29:07,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:29:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash 197748058, now seen corresponding path program 3 times [2023-08-26 11:29:07,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:29:07,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208859554] [2023-08-26 11:29:07,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:29:07,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:29:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:29:08,983 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:29:08,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:29:08,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208859554] [2023-08-26 11:29:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208859554] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:29:08,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430192185] [2023-08-26 11:29:08,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 11:29:08,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:29:08,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:29:08,984 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:29:08,986 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:29:09,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 11:29:09,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:29:09,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 81 conjunts are in the unsatisfiable core [2023-08-26 11:29:09,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:29:09,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:29:09,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:29:09,229 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 11:29:09,229 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 21 treesize of output 29 [2023-08-26 11:29:09,234 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2023-08-26 11:29:09,266 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 11:29:09,266 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:09,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:29:09,464 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 20 [2023-08-26 11:29:09,595 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:29:09,727 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 19 treesize of output 11 [2023-08-26 11:29:09,785 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:29:09,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:29:09,857 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:29:09,963 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:29:10,052 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:29:10,234 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 19 treesize of output 11 [2023-08-26 11:29:10,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:29:10,302 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:29:10,367 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:29:10,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:29:10,432 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1022 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1022) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1022 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1022) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2023-08-26 11:29:10,729 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:29:10,729 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:29:26,522 WARN L234 SmtUtils]: Spent 6.16s 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:38,839 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1))))) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_prenex_6 Int) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1016 Int) (v_prenex_5 (Array Int Int))) (< (select (select (store (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1014))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1016)))) (store (store .cse1 .cse2 v_prenex_6) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_prenex_5) |c_~#queue~0.base|) .cse3) 23)) (forall ((v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1016 Int) (v_ArrVal_1018 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1014))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1016)))) (store (store .cse7 .cse2 v_ArrVal_1018) .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1022) |c_~#queue~0.base|) .cse3) 4)))))) is different from false [2023-08-26 11:29:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-26 11:29:47,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430192185] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:29:47,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:29:47,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 37 [2023-08-26 11:29:47,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665606163] [2023-08-26 11:29:47,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:29:47,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-08-26 11:29:47,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:29:47,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-08-26 11:29:47,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1109, Unknown=50, NotChecked=142, Total=1482 [2023-08-26 11:29:47,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 11:29:47,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 189 transitions, 1841 flow. Second operand has 39 states, 39 states have (on average 169.69230769230768) internal successors, (6618), 39 states have internal predecessors, (6618), 0 states have call successors, (0), 0 states have 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,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:29:47,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 11:29:47,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:29:57,909 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:30:12,715 WARN L234 SmtUtils]: Spent 9.63s on a formula simplification. DAG size of input: 199 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:30:16,160 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:30:30,086 WARN L234 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 191 DAG size of output: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:30:50,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:30:59,520 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:31:00,960 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (* (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 4)) (.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse5 (+ 88 |c_~#queue~0.offset|))) (and (<= 0 (+ .cse0 |c_~#queue~0.offset|)) (forall ((v_ArrVal_1022 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1022) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse2)) (forall ((v_ArrVal_1022 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1022) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1016 Int) (v_ArrVal_1018 Int)) (<= 0 (+ (* (select (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1014))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1016)))) (store (store .cse4 .cse5 v_ArrVal_1018) .cse1 (+ 1 (select .cse4 .cse1)))))) |c_~#stored_elements~0.base| v_ArrVal_1022) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (<= (+ .cse0 |c_~#queue~0.offset| 4) .cse2) (forall ((v_prenex_6 Int) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1016 Int) (v_prenex_5 (Array Int Int))) (< (select (select (store (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1014))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1016)))) (store (store .cse8 .cse5 v_prenex_6) .cse1 (+ 1 (select .cse8 .cse1)))))) |c_~#stored_elements~0.base| v_prenex_5) |c_~#queue~0.base|) .cse1) 23))))) is different from false [2023-08-26 11:31:24,989 WARN L234 SmtUtils]: Spent 7.53s on a formula simplification. DAG size of input: 93 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:31:28,369 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:31:31,266 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:31:33,342 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:31:35,972 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:31:38,050 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:31:40,261 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:31:41,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:31:44,107 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:31:46,123 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 [1] [2023-08-26 11:31:55,944 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:31:57,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:31:59,931 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:32:02,769 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 [1] [2023-08-26 11:32:04,805 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 [1] [2023-08-26 11:32:07,548 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:09,995 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:12,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:32:14,592 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 [1] [2023-08-26 11:32:16,964 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:19,729 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:32:21,752 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:23,792 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:25,800 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:32:27,808 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:32:30,146 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:32,198 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:32:34,569 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:34,594 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (+ (select .cse3 .cse5) 1))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse5 .cse6))) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_1022 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1022) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1022 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1022) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int))) (< (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_prenex_6) .cse5 .cse6)) |c_~#stored_elements~0.base| v_prenex_5) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|) (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (forall ((v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1018 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1018) .cse5 .cse6)) |c_~#stored_elements~0.base| v_ArrVal_1022) |c_~#queue~0.base|) .cse1))))) (forall ((v_ArrVal_1022 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1022) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1022 (Array Int Int))) (<= (+ (* (select (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1022) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)))))) is different from false [2023-08-26 11:32:36,658 INFO L124 PetriNetUnfolderBase]: 3000/5701 cut-off events. [2023-08-26 11:32:36,659 INFO L125 PetriNetUnfolderBase]: For 35445/35457 co-relation queries the response was YES. [2023-08-26 11:32:36,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29438 conditions, 5701 events. 3000/5701 cut-off events. For 35445/35457 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 35572 event pairs, 1078 based on Foata normal form. 28/5456 useless extension candidates. Maximal degree in co-relation 29387. Up to 2464 conditions per place. [2023-08-26 11:32:36,692 INFO L140 encePairwiseOnDemand]: 626/646 looper letters, 293 selfloop transitions, 122 changer transitions 0/418 dead transitions. [2023-08-26 11:32:36,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 418 transitions, 4815 flow [2023-08-26 11:32:36,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-26 11:32:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-26 11:32:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5331 transitions. [2023-08-26 11:32:36,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27507739938080494 [2023-08-26 11:32:36,698 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5331 transitions. [2023-08-26 11:32:36,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5331 transitions. [2023-08-26 11:32:36,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:32:36,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5331 transitions. [2023-08-26 11:32:36,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 177.7) internal successors, (5331), 30 states have internal predecessors, (5331), 0 states have call successors, (0), 0 states have 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:36,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 646.0) internal successors, (20026), 31 states have internal predecessors, (20026), 0 states have call successors, (0), 0 states have 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:36,711 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 646.0) internal successors, (20026), 31 states have internal predecessors, (20026), 0 states have call successors, (0), 0 states have 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:36,711 INFO L175 Difference]: Start difference. First operand has 175 places, 189 transitions, 1841 flow. Second operand 30 states and 5331 transitions. [2023-08-26 11:32:36,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 418 transitions, 4815 flow [2023-08-26 11:32:36,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 418 transitions, 4733 flow, removed 28 selfloop flow, removed 6 redundant places. [2023-08-26 11:32:36,752 INFO L231 Difference]: Finished difference. Result has 214 places, 266 transitions, 3081 flow [2023-08-26 11:32:36,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3081, PETRI_PLACES=214, PETRI_TRANSITIONS=266} [2023-08-26 11:32:36,753 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 110 predicate places. [2023-08-26 11:32:36,753 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 266 transitions, 3081 flow [2023-08-26 11:32:36,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 169.69230769230768) internal successors, (6618), 39 states have internal predecessors, (6618), 0 states have call successors, (0), 0 states have 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:36,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:32:36,754 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:32:36,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-26 11:32:36,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:32:36,957 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:32:36,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:32:36,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1332911837, now seen corresponding path program 1 times [2023-08-26 11:32:36,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:32:36,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178433012] [2023-08-26 11:32:36,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:32:36,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:32:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:32:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 11:32:37,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:32:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178433012] [2023-08-26 11:32:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178433012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:32:37,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:32:37,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:32:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608496033] [2023-08-26 11:32:37,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:32:37,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:32:37,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:32:37,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:32:37,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:32:37,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 646 [2023-08-26 11:32:37,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 266 transitions, 3081 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have 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:37,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:32:37,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 646 [2023-08-26 11:32:37,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:32:37,795 INFO L124 PetriNetUnfolderBase]: 1870/3858 cut-off events. [2023-08-26 11:32:37,795 INFO L125 PetriNetUnfolderBase]: For 77838/77838 co-relation queries the response was YES. [2023-08-26 11:32:37,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25777 conditions, 3858 events. 1870/3858 cut-off events. For 77838/77838 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 22962 event pairs, 274 based on Foata normal form. 325/3948 useless extension candidates. Maximal degree in co-relation 25711. Up to 3269 conditions per place. [2023-08-26 11:32:37,816 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 224 selfloop transitions, 4 changer transitions 0/248 dead transitions. [2023-08-26 11:32:37,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 248 transitions, 3329 flow [2023-08-26 11:32:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:32:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:32:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2023-08-26 11:32:37,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42724458204334365 [2023-08-26 11:32:37,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 828 transitions. [2023-08-26 11:32:37,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 828 transitions. [2023-08-26 11:32:37,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:32:37,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 828 transitions. [2023-08-26 11:32:37,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:32:37,819 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:32:37,819 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:32:37,819 INFO L175 Difference]: Start difference. First operand has 214 places, 266 transitions, 3081 flow. Second operand 3 states and 828 transitions. [2023-08-26 11:32:37,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 248 transitions, 3329 flow [2023-08-26 11:32:37,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 248 transitions, 2958 flow, removed 163 selfloop flow, removed 7 redundant places. [2023-08-26 11:32:37,861 INFO L231 Difference]: Finished difference. Result has 208 places, 237 transitions, 2379 flow [2023-08-26 11:32:37,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=2371, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2379, PETRI_PLACES=208, PETRI_TRANSITIONS=237} [2023-08-26 11:32:37,862 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 104 predicate places. [2023-08-26 11:32:37,862 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 237 transitions, 2379 flow [2023-08-26 11:32:37,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have 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:37,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:32:37,862 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:32:37,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 11:32:37,862 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:32:37,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:32:37,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1001918421, now seen corresponding path program 2 times [2023-08-26 11:32:37,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:32:37,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522065209] [2023-08-26 11:32:37,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:32:37,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:32:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:32:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:32:39,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:32:39,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522065209] [2023-08-26 11:32:39,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522065209] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:32:39,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627941124] [2023-08-26 11:32:39,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 11:32:39,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:32:39,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:32:39,147 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:32:39,148 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:32:39,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 11:32:39,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:32:39,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 95 conjunts are in the unsatisfiable core [2023-08-26 11:32:39,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:32:39,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:39,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:39,358 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 11:32:39,358 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:32:39,386 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 11:32:39,387 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 11 treesize of output 11 [2023-08-26 11:32:39,536 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:32:39,624 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:32:39,853 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:32:39,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:39,925 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:32:40,063 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 63 treesize of output 56 [2023-08-26 11:32:40,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2023-08-26 11:32:40,470 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 80 [2023-08-26 11:32:40,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:32:40,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 149 [2023-08-26 11:32:40,770 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 158 treesize of output 151 [2023-08-26 11:32:40,940 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 225 treesize of output 220 [2023-08-26 11:32:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:32:41,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:32:41,756 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_1198 Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int)) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1198) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1203)) .cse2)) 20))))) is different from false [2023-08-26 11:32:41,784 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1198 Int) (v_ArrVal_1197 Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1197)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1198) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1203)) .cse1)) 20) (= .cse4 20))))) is different from false [2023-08-26 11:32:41,949 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1198 Int) (v_ArrVal_1197 Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int) (v_ArrVal_1195 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1195))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1197)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1198) .cse1 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1203)) .cse1) 20) (= 20 .cse4)))))) is different from false [2023-08-26 11:32:42,550 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_1198 Int) (v_ArrVal_1197 Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1191) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1195))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1197)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 20 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1198) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1203)) .cse2) 20)))))) (= .cse8 20)))) is different from false [2023-08-26 11:32:42,595 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1198 Int) (v_ArrVal_1197 Int) (v_ArrVal_1189 Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1191 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1189)) (.cse8 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1191) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1195))) (let ((.cse4 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1197)))) (let ((.cse5 (select .cse4 .cse2))) (or (= 20 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1198) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1203)) .cse2) 20) (= .cse5 20)))))))) is different from false [2023-08-26 11:32:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 5 refuted. 3 times theorem prover too weak. 0 trivial. 10 not checked. [2023-08-26 11:32:43,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627941124] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:32:43,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:32:43,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 18] total 43 [2023-08-26 11:32:43,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859185240] [2023-08-26 11:32:43,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:32:43,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-08-26 11:32:43,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:32:43,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-08-26 11:32:43,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1094, Unknown=57, NotChecked=390, Total=1892 [2023-08-26 11:32:43,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 646 [2023-08-26 11:32:43,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 237 transitions, 2379 flow. Second operand has 44 states, 44 states have (on average 200.79545454545453) internal successors, (8835), 44 states have internal predecessors, (8835), 0 states have call successors, (0), 0 states have 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:43,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:32:43,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 646 [2023-08-26 11:32:43,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:32:52,550 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse10 .cse11))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse11 (+ .cse9 1)))) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse7 (= .cse9 20))) (and (or (forall ((v_ArrVal_1198 Int) (v_ArrVal_1197 Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int) (v_ArrVal_1195 (Array Int Int))) (let ((.cse3 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1195))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1197)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1198) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1203)) .cse2) 20)))))) .cse7) (or (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int)) (< (select (let ((.cse8 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse2))) v_ArrVal_1203)) .cse2) 20)) .cse7))))) is different from false [2023-08-26 11:32:55,324 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1198 Int) (v_ArrVal_1197 Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int)) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1197)))) (let ((.cse3 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1198) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1203)) .cse1) 20) (= .cse3 20))))) (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int)) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse1))) v_ArrVal_1203)) .cse1) 20)) (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int)) (< (select (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_1203)) .cse1) 20)))) is different from false [2023-08-26 11:32:56,001 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1203 Int)) (< (select (store .cse0 .cse1 v_ArrVal_1203) .cse2) 20)) (forall ((v_ArrVal_1198 Int) (v_ArrVal_1197 Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int)) (let ((.cse5 (store .cse0 .cse1 v_ArrVal_1197))) (let ((.cse6 (select .cse5 .cse2))) (or (< (let ((.cse4 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1198) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1203)) .cse4)) 20) (= .cse6 20))))))) is different from false [2023-08-26 11:32:56,269 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (or (= .cse0 20) (forall ((v_ArrVal_1198 Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int)) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1198) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1203)) .cse2)) 20))) (< .cse0 20)))) is different from false [2023-08-26 11:32:58,609 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:32:58,975 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse5 (select .cse2 .cse3))) (and (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1203)) .cse1) 20)) (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int)) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse4 .cse1))) v_ArrVal_1203)) .cse1) 20)) (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1203 Int)) (< (select (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1202) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_1203)) .cse1) 20)) (< .cse5 20)))) is different from false [2023-08-26 11:33:00,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:33:02,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:33:04,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:33:05,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:33:06,257 INFO L124 PetriNetUnfolderBase]: 2300/4775 cut-off events. [2023-08-26 11:33:06,258 INFO L125 PetriNetUnfolderBase]: For 85114/85114 co-relation queries the response was YES. [2023-08-26 11:33:06,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31257 conditions, 4775 events. 2300/4775 cut-off events. For 85114/85114 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 29958 event pairs, 1461 based on Foata normal form. 19/4470 useless extension candidates. Maximal degree in co-relation 31190. Up to 3582 conditions per place. [2023-08-26 11:33:06,283 INFO L140 encePairwiseOnDemand]: 627/646 looper letters, 275 selfloop transitions, 150 changer transitions 4/432 dead transitions. [2023-08-26 11:33:06,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 432 transitions, 5728 flow [2023-08-26 11:33:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-26 11:33:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-26 11:33:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 10200 transitions. [2023-08-26 11:33:06,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3157894736842105 [2023-08-26 11:33:06,291 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 10200 transitions. [2023-08-26 11:33:06,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 10200 transitions. [2023-08-26 11:33:06,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:33:06,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 10200 transitions. [2023-08-26 11:33:06,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 204.0) internal successors, (10200), 50 states have internal predecessors, (10200), 0 states have call successors, (0), 0 states have 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:06,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 646.0) internal successors, (32946), 51 states have internal predecessors, (32946), 0 states have call successors, (0), 0 states have 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:06,318 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 646.0) internal successors, (32946), 51 states have internal predecessors, (32946), 0 states have call successors, (0), 0 states have 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:06,318 INFO L175 Difference]: Start difference. First operand has 208 places, 237 transitions, 2379 flow. Second operand 50 states and 10200 transitions. [2023-08-26 11:33:06,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 432 transitions, 5728 flow [2023-08-26 11:33:06,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 432 transitions, 5719 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 11:33:06,365 INFO L231 Difference]: Finished difference. Result has 281 places, 332 transitions, 4181 flow [2023-08-26 11:33:06,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=4181, PETRI_PLACES=281, PETRI_TRANSITIONS=332} [2023-08-26 11:33:06,366 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 177 predicate places. [2023-08-26 11:33:06,366 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 332 transitions, 4181 flow [2023-08-26 11:33:06,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 200.79545454545453) internal successors, (8835), 44 states have internal predecessors, (8835), 0 states have call successors, (0), 0 states have 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:06,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:33:06,368 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:33:06,374 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:33:06,572 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:33:06,572 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:33:06,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:33:06,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1979962837, now seen corresponding path program 1 times [2023-08-26 11:33:06,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:33:06,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701743216] [2023-08-26 11:33:06,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:33:06,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:33:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:33:06,702 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:06,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:33:06,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701743216] [2023-08-26 11:33:06,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701743216] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:33:06,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416377982] [2023-08-26 11:33:06,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:33:06,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:33:06,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:33:06,703 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:33:06,705 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:33:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:33:06,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 11:33:06,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:33:06,890 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:06,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:33:07,000 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:07,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416377982] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:33:07,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:33:07,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-26 11:33:07,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89065053] [2023-08-26 11:33:07,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:33:07,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 11:33:07,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:33:07,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 11:33:07,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-08-26 11:33:07,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 646 [2023-08-26 11:33:07,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 332 transitions, 4181 flow. Second operand has 9 states, 9 states have (on average 266.55555555555554) internal successors, (2399), 9 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have 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:07,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:33:07,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 646 [2023-08-26 11:33:07,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:33:07,996 INFO L124 PetriNetUnfolderBase]: 1154/2610 cut-off events. [2023-08-26 11:33:07,996 INFO L125 PetriNetUnfolderBase]: For 115871/115871 co-relation queries the response was YES. [2023-08-26 11:33:08,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26323 conditions, 2610 events. 1154/2610 cut-off events. For 115871/115871 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13237 event pairs, 267 based on Foata normal form. 88/2649 useless extension candidates. Maximal degree in co-relation 26230. Up to 904 conditions per place. [2023-08-26 11:33:08,020 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 313 selfloop transitions, 48 changer transitions 0/389 dead transitions. [2023-08-26 11:33:08,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 389 transitions, 6194 flow [2023-08-26 11:33:08,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 11:33:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 11:33:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2205 transitions. [2023-08-26 11:33:08,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4266640866873065 [2023-08-26 11:33:08,022 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2205 transitions. [2023-08-26 11:33:08,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2205 transitions. [2023-08-26 11:33:08,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:33:08,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2205 transitions. [2023-08-26 11:33:08,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 275.625) internal successors, (2205), 8 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have 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:08,026 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:33:08,027 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:33:08,027 INFO L175 Difference]: Start difference. First operand has 281 places, 332 transitions, 4181 flow. Second operand 8 states and 2205 transitions. [2023-08-26 11:33:08,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 389 transitions, 6194 flow [2023-08-26 11:33:08,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 389 transitions, 5387 flow, removed 383 selfloop flow, removed 12 redundant places. [2023-08-26 11:33:08,119 INFO L231 Difference]: Finished difference. Result has 281 places, 323 transitions, 3747 flow [2023-08-26 11:33:08,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=3486, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3747, PETRI_PLACES=281, PETRI_TRANSITIONS=323} [2023-08-26 11:33:08,120 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 177 predicate places. [2023-08-26 11:33:08,120 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 323 transitions, 3747 flow [2023-08-26 11:33:08,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 266.55555555555554) internal successors, (2399), 9 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have 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:08,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:33:08,121 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-08-26 11:33:08,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-26 11:33:08,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-26 11:33:08,322 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:33:08,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:33:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash 96385593, now seen corresponding path program 4 times [2023-08-26 11:33:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:33:08,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083181428] [2023-08-26 11:33:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:33:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:33:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:33:10,389 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:33:10,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:33:10,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083181428] [2023-08-26 11:33:10,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083181428] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:33:10,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382647258] [2023-08-26 11:33:10,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 11:33:10,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:33:10,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:33:10,391 INFO L229 MonitoredProcess]: Starting monitored process 10 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:10,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 11:33:10,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 11:33:10,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:33:10,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 101 conjunts are in the unsatisfiable core [2023-08-26 11:33:10,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:33:10,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:10,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:10,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:10,561 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:10,591 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 11:33:10,591 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:11,160 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 26 treesize of output 14 [2023-08-26 11:33:11,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:11,243 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 15 treesize of output 17 [2023-08-26 11:33:11,421 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:33:11,421 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2023-08-26 11:33:11,555 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 20 treesize of output 19 [2023-08-26 11:33:11,836 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 34 treesize of output 18 [2023-08-26 11:33:11,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:11,940 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 23 treesize of output 23 [2023-08-26 11:33:12,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-08-26 11:33:12,268 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:33:12,268 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 40 [2023-08-26 11:33:12,447 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 48 treesize of output 35 [2023-08-26 11:33:12,699 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 54 treesize of output 30 [2023-08-26 11:33:12,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:33:12,841 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 41 treesize of output 37 [2023-08-26 11:33:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:33:12,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:33:13,192 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1432 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1432 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1432) |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:33:13,206 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 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1432 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1432 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1432) |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:33:13,229 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1432 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1429) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1432 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1429) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2023-08-26 11:33:19,806 WARN L234 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 11:33:28,685 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1418 Int)) (let ((.cse9 (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1417))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse7)) |c_~#queue~0.offset|) v_ArrVal_1418)))) (let ((.cse0 (select .cse10 .cse7))) (or (= 20 .cse0) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1420 Int)) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_1420) .cse7 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_1424))) (let ((.cse2 (* (select (select .cse8 |c_~#queue~0.base|) .cse7) 4))) (let ((.cse3 (+ |c_~#queue~0.offset| .cse2))) (or (< .cse1 (+ |c_~#queue~0.offset| 4 .cse2)) (< .cse3 0) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1427 Int)) (<= 0 (+ (* (select (select (store (let ((.cse4 (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1425))) (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (select .cse4 |c_~#queue~0.base|) .cse3 v_ArrVal_1427))) (store (store .cse5 .cse6 v_ArrVal_1429) .cse7 (+ 1 (select .cse5 .cse7)))))) |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset|))))))))))))) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1418 Int)) (let ((.cse19 (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1417))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* 4 (select .cse21 .cse7)) |c_~#queue~0.offset|) v_ArrVal_1418)))) (let ((.cse13 (select .cse20 .cse7))) (or (= 20 .cse13) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1420 Int)) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse6 v_ArrVal_1420) .cse7 (+ 1 .cse13))) |c_~#stored_elements~0.base| v_ArrVal_1424))) (let ((.cse14 (* (select (select .cse18 |c_~#queue~0.base|) .cse7) 4))) (let ((.cse15 (+ |c_~#queue~0.offset| .cse14))) (or (< .cse1 (+ |c_~#queue~0.offset| 4 .cse14)) (< .cse15 0) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1427 Int)) (<= (+ (* (select (select (store (let ((.cse16 (store .cse18 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1425))) (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store (select .cse16 |c_~#queue~0.base|) .cse15 v_ArrVal_1427))) (store (store .cse17 .cse6 v_ArrVal_1429) .cse7 (+ 1 (select .cse17 .cse7)))))) |c_~#stored_elements~0.base| v_ArrVal_1432) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset| 4) .cse1)))))))))))))) is different from false [2023-08-26 11:33:29,299 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:33:29,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2548 treesize of output 1222 [2023-08-26 11:33:29,372 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:33:29,372 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 4033 treesize of output 3951 [2023-08-26 11:33:29,393 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 630 treesize of output 626 [2023-08-26 11:33:29,404 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 651 treesize of output 647 [2023-08-26 11:33:29,414 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 647 treesize of output 639 [2023-08-26 11:33:29,424 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 649 treesize of output 637 [2023-08-26 11:33:29,436 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 632 treesize of output 624 [2023-08-26 11:33:29,446 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 624 treesize of output 616 [2023-08-26 11:33:29,457 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 626 treesize of output 614 [2023-08-26 11:33:29,464 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 11:33:29,470 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 609 treesize of output 601 [2023-08-26 11:33:29,508 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 7 treesize of output 3 [2023-08-26 11:33:29,674 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:33:29,674 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 485 treesize of output 345 [2023-08-26 11:33:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 2 times theorem prover too weak. 0 trivial. 11 not checked. [2023-08-26 11:33:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382647258] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:33:31,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:33:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 21] total 54 [2023-08-26 11:33:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897957930] [2023-08-26 11:33:31,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:33:31,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-08-26 11:33:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:33:31,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-08-26 11:33:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2299, Unknown=57, NotChecked=412, Total=3080 [2023-08-26 11:33:31,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 646 [2023-08-26 11:33:31,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 323 transitions, 3747 flow. Second operand has 56 states, 56 states have (on average 169.60714285714286) internal successors, (9498), 56 states have internal predecessors, (9498), 0 states have call successors, (0), 0 states have 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:31,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:33:31,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 646 [2023-08-26 11:33:31,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:33:39,401 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,477 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:42,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:33:44,559 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:48,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 11:33:50,199 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:33:52,310 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:59,779 INFO L124 PetriNetUnfolderBase]: 1667/3639 cut-off events. [2023-08-26 11:33:59,779 INFO L125 PetriNetUnfolderBase]: For 154343/154365 co-relation queries the response was YES. [2023-08-26 11:33:59,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33296 conditions, 3639 events. 1667/3639 cut-off events. For 154343/154365 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 18322 event pairs, 351 based on Foata normal form. 124/3617 useless extension candidates. Maximal degree in co-relation 33200. Up to 1176 conditions per place. [2023-08-26 11:33:59,806 INFO L140 encePairwiseOnDemand]: 630/646 looper letters, 373 selfloop transitions, 144 changer transitions 5/525 dead transitions. [2023-08-26 11:33:59,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 525 transitions, 8139 flow [2023-08-26 11:33:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-26 11:33:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-26 11:33:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4815 transitions. [2023-08-26 11:33:59,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2760577915376677 [2023-08-26 11:33:59,811 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4815 transitions. [2023-08-26 11:33:59,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4815 transitions. [2023-08-26 11:33:59,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:33:59,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4815 transitions. [2023-08-26 11:33:59,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 178.33333333333334) internal successors, (4815), 27 states have internal predecessors, (4815), 0 states have call successors, (0), 0 states have 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:59,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 646.0) internal successors, (18088), 28 states have internal predecessors, (18088), 0 states have call successors, (0), 0 states have 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:59,822 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 646.0) internal successors, (18088), 28 states have internal predecessors, (18088), 0 states have call successors, (0), 0 states have 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:59,822 INFO L175 Difference]: Start difference. First operand has 281 places, 323 transitions, 3747 flow. Second operand 27 states and 4815 transitions. [2023-08-26 11:33:59,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 525 transitions, 8139 flow [2023-08-26 11:33:59,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 525 transitions, 7890 flow, removed 53 selfloop flow, removed 14 redundant places. [2023-08-26 11:33:59,897 INFO L231 Difference]: Finished difference. Result has 299 places, 347 transitions, 4386 flow [2023-08-26 11:33:59,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=3146, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4386, PETRI_PLACES=299, PETRI_TRANSITIONS=347} [2023-08-26 11:33:59,898 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 195 predicate places. [2023-08-26 11:33:59,898 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 347 transitions, 4386 flow [2023-08-26 11:33:59,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 169.60714285714286) internal successors, (9498), 56 states have internal predecessors, (9498), 0 states have call successors, (0), 0 states have 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:59,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:33:59,899 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2023-08-26 11:33:59,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-26 11:34:00,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-26 11:34:00,099 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:34:00,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:34:00,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1061659548, now seen corresponding path program 1 times [2023-08-26 11:34:00,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:34:00,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400211876] [2023-08-26 11:34:00,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:34:00,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:34:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:34:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:34:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:34:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400211876] [2023-08-26 11:34:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400211876] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:34:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491853144] [2023-08-26 11:34:03,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:34:03,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:34:03,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:34:03,957 INFO L229 MonitoredProcess]: Starting monitored process 11 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:34:03,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 11:34:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:34:04,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-26 11:34:04,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:34:04,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:04,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:04,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:04,142 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:34:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:34:05,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:34:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:34:05,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491853144] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:34:05,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:34:05,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 6, 6] total 34 [2023-08-26 11:34:05,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230012319] [2023-08-26 11:34:05,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:34:05,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-26 11:34:05,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:34:05,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-26 11:34:05,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2023-08-26 11:34:05,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 646 [2023-08-26 11:34:05,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 347 transitions, 4386 flow. Second operand has 36 states, 36 states have (on average 170.66666666666666) internal successors, (6144), 36 states have internal predecessors, (6144), 0 states have call successors, (0), 0 states have 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:05,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:34:05,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 646 [2023-08-26 11:34:05,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:34:16,643 INFO L124 PetriNetUnfolderBase]: 5003/10536 cut-off events. [2023-08-26 11:34:16,643 INFO L125 PetriNetUnfolderBase]: For 553047/553047 co-relation queries the response was YES. [2023-08-26 11:34:16,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100007 conditions, 10536 events. 5003/10536 cut-off events. For 553047/553047 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 69583 event pairs, 2028 based on Foata normal form. 220/10144 useless extension candidates. Maximal degree in co-relation 99912. Up to 3174 conditions per place. [2023-08-26 11:34:16,736 INFO L140 encePairwiseOnDemand]: 636/646 looper letters, 715 selfloop transitions, 144 changer transitions 4/866 dead transitions. [2023-08-26 11:34:16,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 866 transitions, 14994 flow [2023-08-26 11:34:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-26 11:34:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-26 11:34:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 7076 transitions. [2023-08-26 11:34:16,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2738390092879257 [2023-08-26 11:34:16,742 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 7076 transitions. [2023-08-26 11:34:16,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 7076 transitions. [2023-08-26 11:34:16,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:34:16,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 7076 transitions. [2023-08-26 11:34:16,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 176.9) internal successors, (7076), 40 states have internal predecessors, (7076), 0 states have call successors, (0), 0 states have 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:16,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 646.0) internal successors, (26486), 41 states have internal predecessors, (26486), 0 states have call successors, (0), 0 states have 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:16,758 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 646.0) internal successors, (26486), 41 states have internal predecessors, (26486), 0 states have call successors, (0), 0 states have 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:16,759 INFO L175 Difference]: Start difference. First operand has 299 places, 347 transitions, 4386 flow. Second operand 40 states and 7076 transitions. [2023-08-26 11:34:16,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 866 transitions, 14994 flow [2023-08-26 11:34:17,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 866 transitions, 12536 flow, removed 1090 selfloop flow, removed 14 redundant places. [2023-08-26 11:34:17,205 INFO L231 Difference]: Finished difference. Result has 338 places, 383 transitions, 4730 flow [2023-08-26 11:34:17,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=3786, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=4730, PETRI_PLACES=338, PETRI_TRANSITIONS=383} [2023-08-26 11:34:17,206 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 234 predicate places. [2023-08-26 11:34:17,206 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 383 transitions, 4730 flow [2023-08-26 11:34:17,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 170.66666666666666) internal successors, (6144), 36 states have internal predecessors, (6144), 0 states have call successors, (0), 0 states have 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:17,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:34:17,207 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:34:17,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 11:34:17,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-26 11:34:17,407 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:34:17,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:34:17,408 INFO L85 PathProgramCache]: Analyzing trace with hash -8719007, now seen corresponding path program 1 times [2023-08-26 11:34:17,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:34:17,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315006917] [2023-08-26 11:34:17,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:34:17,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:34:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:34:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:34:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:34:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315006917] [2023-08-26 11:34:17,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315006917] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:34:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913700152] [2023-08-26 11:34:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:34:17,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:34:17,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:34:17,595 INFO L229 MonitoredProcess]: Starting monitored process 12 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:34:17,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-26 11:34:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:34:17,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-26 11:34:17,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:34:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:34:17,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:34:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:34:18,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913700152] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:34:18,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:34:18,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-08-26 11:34:18,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491723943] [2023-08-26 11:34:18,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:34:18,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 11:34:18,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:34:18,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 11:34:18,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2023-08-26 11:34:18,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 646 [2023-08-26 11:34:18,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 383 transitions, 4730 flow. Second operand has 17 states, 17 states have (on average 267.11764705882354) internal successors, (4541), 17 states have internal predecessors, (4541), 0 states have call successors, (0), 0 states have 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:18,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:34:18,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 646 [2023-08-26 11:34:18,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:34:21,491 INFO L124 PetriNetUnfolderBase]: 3766/8496 cut-off events. [2023-08-26 11:34:21,492 INFO L125 PetriNetUnfolderBase]: For 523869/523870 co-relation queries the response was YES. [2023-08-26 11:34:21,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94828 conditions, 8496 events. 3766/8496 cut-off events. For 523869/523870 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 50356 event pairs, 725 based on Foata normal form. 296/8651 useless extension candidates. Maximal degree in co-relation 94724. Up to 3323 conditions per place. [2023-08-26 11:34:21,585 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 751 selfloop transitions, 81 changer transitions 0/863 dead transitions. [2023-08-26 11:34:21,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 863 transitions, 12960 flow [2023-08-26 11:34:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-26 11:34:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-26 11:34:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4393 transitions. [2023-08-26 11:34:21,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42501934984520123 [2023-08-26 11:34:21,588 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4393 transitions. [2023-08-26 11:34:21,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4393 transitions. [2023-08-26 11:34:21,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:34:21,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4393 transitions. [2023-08-26 11:34:21,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 274.5625) internal successors, (4393), 16 states have internal predecessors, (4393), 0 states have call successors, (0), 0 states have 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:21,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 646.0) internal successors, (10982), 17 states have internal predecessors, (10982), 0 states have call successors, (0), 0 states have 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:21,689 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 646.0) internal successors, (10982), 17 states have internal predecessors, (10982), 0 states have call successors, (0), 0 states have 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:21,689 INFO L175 Difference]: Start difference. First operand has 338 places, 383 transitions, 4730 flow. Second operand 16 states and 4393 transitions. [2023-08-26 11:34:21,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 863 transitions, 12960 flow [2023-08-26 11:34:21,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 863 transitions, 12673 flow, removed 89 selfloop flow, removed 20 redundant places. [2023-08-26 11:34:21,983 INFO L231 Difference]: Finished difference. Result has 342 places, 401 transitions, 5076 flow [2023-08-26 11:34:21,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=4527, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5076, PETRI_PLACES=342, PETRI_TRANSITIONS=401} [2023-08-26 11:34:21,983 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 238 predicate places. [2023-08-26 11:34:21,983 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 401 transitions, 5076 flow [2023-08-26 11:34:21,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 267.11764705882354) internal successors, (4541), 17 states have internal predecessors, (4541), 0 states have call successors, (0), 0 states have 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:21,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:34:21,984 INFO L208 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1] [2023-08-26 11:34:21,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-26 11:34:22,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-26 11:34:22,189 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:34:22,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:34:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash 322471784, now seen corresponding path program 2 times [2023-08-26 11:34:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:34:22,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587567381] [2023-08-26 11:34:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:34:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:34:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:34:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 220 proven. 105 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-08-26 11:34:26,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:34:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587567381] [2023-08-26 11:34:26,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587567381] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:34:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448516017] [2023-08-26 11:34:26,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 11:34:26,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:34:26,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:34:26,560 INFO L229 MonitoredProcess]: Starting monitored process 13 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:34:26,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-26 11:34:26,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 11:34:26,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:34:26,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-26 11:34:26,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:34:26,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:26,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:26,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:26,862 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:34:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:34:28,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 11:34:28,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448516017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:34:28,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 11:34:28,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [24] total 37 [2023-08-26 11:34:28,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720747537] [2023-08-26 11:34:28,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:34:28,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 11:34:28,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:34:28,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 11:34:28,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1142, Unknown=0, NotChecked=0, Total=1406 [2023-08-26 11:34:28,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 646 [2023-08-26 11:34:28,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 401 transitions, 5076 flow. Second operand has 15 states, 15 states have (on average 200.0) internal successors, (3000), 15 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have 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:28,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:34:28,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 646 [2023-08-26 11:34:28,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:34:32,154 INFO L124 PetriNetUnfolderBase]: 3842/8404 cut-off events. [2023-08-26 11:34:32,154 INFO L125 PetriNetUnfolderBase]: For 511587/511587 co-relation queries the response was YES. [2023-08-26 11:34:32,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93673 conditions, 8404 events. 3842/8404 cut-off events. For 511587/511587 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 47963 event pairs, 461 based on Foata normal form. 220/8480 useless extension candidates. Maximal degree in co-relation 93564. Up to 3193 conditions per place. [2023-08-26 11:34:32,235 INFO L140 encePairwiseOnDemand]: 641/646 looper letters, 551 selfloop transitions, 88 changer transitions 47/688 dead transitions. [2023-08-26 11:34:32,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 688 transitions, 10581 flow [2023-08-26 11:34:32,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 11:34:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 11:34:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3094 transitions. [2023-08-26 11:34:32,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3192982456140351 [2023-08-26 11:34:32,238 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3094 transitions. [2023-08-26 11:34:32,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3094 transitions. [2023-08-26 11:34:32,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:34:32,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3094 transitions. [2023-08-26 11:34:32,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 206.26666666666668) internal successors, (3094), 15 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have 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:32,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 646.0) internal successors, (10336), 16 states have internal predecessors, (10336), 0 states have call successors, (0), 0 states have 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:32,246 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 646.0) internal successors, (10336), 16 states have internal predecessors, (10336), 0 states have call successors, (0), 0 states have 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:32,246 INFO L175 Difference]: Start difference. First operand has 342 places, 401 transitions, 5076 flow. Second operand 15 states and 3094 transitions. [2023-08-26 11:34:32,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 688 transitions, 10581 flow [2023-08-26 11:34:32,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 688 transitions, 10220 flow, removed 72 selfloop flow, removed 19 redundant places. [2023-08-26 11:34:32,497 INFO L231 Difference]: Finished difference. Result has 337 places, 389 transitions, 4924 flow [2023-08-26 11:34:32,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=4751, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4924, PETRI_PLACES=337, PETRI_TRANSITIONS=389} [2023-08-26 11:34:32,498 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 233 predicate places. [2023-08-26 11:34:32,498 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 389 transitions, 4924 flow [2023-08-26 11:34:32,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 200.0) internal successors, (3000), 15 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have 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:32,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:34:32,499 INFO L208 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 12, 12, 12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:34:32,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-26 11:34:32,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-26 11:34:32,703 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:34:32,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:34:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1371176347, now seen corresponding path program 2 times [2023-08-26 11:34:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:34:32,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935897073] [2023-08-26 11:34:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:34:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:34:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:34:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:34:33,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:34:33,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935897073] [2023-08-26 11:34:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935897073] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:34:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855258064] [2023-08-26 11:34:33,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 11:34:33,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:34:33,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:34:33,372 INFO L229 MonitoredProcess]: Starting monitored process 14 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:34:33,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-26 11:34:33,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 11:34:33,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:34:33,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-26 11:34:33,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:34:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:34:33,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:34:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:34:34,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855258064] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:34:34,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:34:34,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-08-26 11:34:34,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393489243] [2023-08-26 11:34:34,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:34:34,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-26 11:34:34,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:34:34,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-26 11:34:34,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2023-08-26 11:34:34,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 646 [2023-08-26 11:34:34,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 389 transitions, 4924 flow. Second operand has 23 states, 23 states have (on average 267.7391304347826) internal successors, (6158), 23 states have internal predecessors, (6158), 0 states have call successors, (0), 0 states have 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:34,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:34:34,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 646 [2023-08-26 11:34:34,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:34:37,703 INFO L124 PetriNetUnfolderBase]: 3054/7303 cut-off events. [2023-08-26 11:34:37,703 INFO L125 PetriNetUnfolderBase]: For 346695/346696 co-relation queries the response was YES. [2023-08-26 11:34:37,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74784 conditions, 7303 events. 3054/7303 cut-off events. For 346695/346696 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 39282 event pairs, 609 based on Foata normal form. 138/7301 useless extension candidates. Maximal degree in co-relation 74682. Up to 2448 conditions per place. [2023-08-26 11:34:37,774 INFO L140 encePairwiseOnDemand]: 642/646 looper letters, 1015 selfloop transitions, 105 changer transitions 0/1150 dead transitions. [2023-08-26 11:34:37,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 1150 transitions, 17422 flow [2023-08-26 11:34:37,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-26 11:34:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-26 11:34:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 6009 transitions. [2023-08-26 11:34:37,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4228117084154236 [2023-08-26 11:34:37,778 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 6009 transitions. [2023-08-26 11:34:37,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 6009 transitions. [2023-08-26 11:34:37,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:34:37,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 6009 transitions. [2023-08-26 11:34:37,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 273.1363636363636) internal successors, (6009), 22 states have internal predecessors, (6009), 0 states have call successors, (0), 0 states have 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:37,787 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:34:37,787 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:34:37,787 INFO L175 Difference]: Start difference. First operand has 337 places, 389 transitions, 4924 flow. Second operand 22 states and 6009 transitions. [2023-08-26 11:34:37,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 1150 transitions, 17422 flow [2023-08-26 11:34:38,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 1150 transitions, 17299 flow, removed 1 selfloop flow, removed 13 redundant places. [2023-08-26 11:34:38,105 INFO L231 Difference]: Finished difference. Result has 349 places, 419 transitions, 5722 flow [2023-08-26 11:34:38,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=4801, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5722, PETRI_PLACES=349, PETRI_TRANSITIONS=419} [2023-08-26 11:34:38,105 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 245 predicate places. [2023-08-26 11:34:38,106 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 419 transitions, 5722 flow [2023-08-26 11:34:38,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 267.7391304347826) internal successors, (6158), 23 states have internal predecessors, (6158), 0 states have call successors, (0), 0 states have 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:38,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:34:38,106 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 17, 17, 17, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:34:38,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-26 11:34:38,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:34:38,307 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:34:38,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:34:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1212548525, now seen corresponding path program 3 times [2023-08-26 11:34:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:34:38,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278681844] [2023-08-26 11:34:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:34:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:34:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:34:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 866 proven. 189 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-08-26 11:34:43,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:34:43,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278681844] [2023-08-26 11:34:43,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278681844] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:34:43,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345454636] [2023-08-26 11:34:43,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 11:34:43,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:34:43,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:34:43,791 INFO L229 MonitoredProcess]: Starting monitored process 15 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:34:43,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-26 11:34:49,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-08-26 11:34:49,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:34:49,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 163 conjunts are in the unsatisfiable core [2023-08-26 11:34:49,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:34:49,196 INFO L322 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-08-26 11:34:49,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 15 treesize of output 26 [2023-08-26 11:34:51,523 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 11:34:51,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:51,621 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 11:34:51,824 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:34:51,845 INFO L322 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-08-26 11:34:51,846 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2023-08-26 11:34:52,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:52,062 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 20 [2023-08-26 11:34:52,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:34:52,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 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:34:52,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:52,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 11:34:52,658 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:34:52,674 INFO L322 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-08-26 11:34:52,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 25 [2023-08-26 11:34:52,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:52,855 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 20 [2023-08-26 11:34:53,138 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:34:53,139 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 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:34:53,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:53,247 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 11:34:53,437 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:34:53,453 INFO L322 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-08-26 11:34:53,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 25 [2023-08-26 11:34:53,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:53,660 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 20 [2023-08-26 11:34:53,682 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 11:34:53,683 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 23 treesize of output 19 [2023-08-26 11:34:53,988 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:34:53,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 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:34:54,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:54,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 11:34:54,235 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:34:54,253 INFO L322 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-08-26 11:34:54,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 25 [2023-08-26 11:34:54,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:54,407 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 20 [2023-08-26 11:34:54,653 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:34:54,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 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:34:54,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:54,756 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 11:34:54,952 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 11:34:54,968 INFO L322 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-08-26 11:34:54,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 25 [2023-08-26 11:34:55,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:34:55,112 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 20 [2023-08-26 11:34:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 402 proven. 317 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2023-08-26 11:34:55,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:34:55,292 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2669 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2667) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2669)) .cse1)) 20))) is different from false [2023-08-26 11:34:55,548 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2669 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2667) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2669)) .cse1))))) (= .cse4 20)))) is different from false [2023-08-26 11:34:55,564 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2663 Int) (v_ArrVal_2669 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2663) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2667) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2669)) .cse1))))) (= .cse4 20)))) is different from false [2023-08-26 11:34:55,595 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2663 Int) (v_ArrVal_2662 Int) (v_ArrVal_2669 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2662)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2663) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2667) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2669)) .cse2)) 20)))))) is different from false [2023-08-26 11:34:55,895 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2663 Int) (v_ArrVal_2662 Int) (v_ArrVal_2660 (Array Int Int)) (v_ArrVal_2669 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2660))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2662)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2663) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2667) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2669)) .cse1) 20)) (= 20 .cse4)))))) is different from false [2023-08-26 11:34:55,913 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2663 Int) (v_ArrVal_2662 Int) (v_ArrVal_2660 (Array Int Int)) (v_ArrVal_2669 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2660))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_2662)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2663) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2667) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2669)) .cse1) 20)) (= .cse4 20)))))) is different from false [2023-08-26 11:35:02,702 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:35:02,703 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 28741 treesize of output 19371 [2023-08-26 11:35:02,767 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:35:02,768 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 10023 treesize of output 9785 [2023-08-26 11:35:02,785 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 1735 treesize of output 1723 [2023-08-26 11:35:02,799 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 32 treesize of output 20 [2023-08-26 11:35:02,814 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 32 treesize of output 20 [2023-08-26 11:35:02,828 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 32 treesize of output 20 [2023-08-26 11:35:02,848 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 36 treesize of output 28 [2023-08-26 11:35:02,877 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 7 treesize of output 3 [2023-08-26 11:35:02,980 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 11:35:02,980 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 1701 treesize of output 1377 [2023-08-26 11:35:03,462 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 11:35:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 41 proven. 536 refuted. 16 times theorem prover too weak. 716 trivial. 126 not checked. [2023-08-26 11:35:05,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345454636] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 11:35:05,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 11:35:05,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 36] total 82 [2023-08-26 11:35:05,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929076980] [2023-08-26 11:35:05,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 11:35:05,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2023-08-26 11:35:05,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:35:05,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2023-08-26 11:35:05,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1316, Invalid=4372, Unknown=188, NotChecked=930, Total=6806 [2023-08-26 11:35:05,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 646 [2023-08-26 11:35:05,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 419 transitions, 5722 flow. Second operand has 83 states, 83 states have (on average 175.33734939759037) internal successors, (14553), 83 states have internal predecessors, (14553), 0 states have call successors, (0), 0 states have 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:35:05,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:35:05,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 646 [2023-08-26 11:35:05,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:35:22,698 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:35:24,714 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:35:26,725 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:35:28,749 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:35:30,767 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:35:32,781 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:35:33,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 11:35:35,811 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:35:40,650 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:35:42,651 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:35:44,653 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:35:46,688 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:35:48,693 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:35:50,695 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:35:52,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 11:35:54,709 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:36:15,816 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:36:17,830 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:36:19,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 11:36:23,825 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:36:25,831 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:36:50,709 INFO L124 PetriNetUnfolderBase]: 6340/14933 cut-off events. [2023-08-26 11:36:50,709 INFO L125 PetriNetUnfolderBase]: For 767583/767583 co-relation queries the response was YES. [2023-08-26 11:36:50,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159308 conditions, 14933 events. 6340/14933 cut-off events. For 767583/767583 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 100279 event pairs, 1340 based on Foata normal form. 226/14781 useless extension candidates. Maximal degree in co-relation 159201. Up to 5213 conditions per place. [2023-08-26 11:36:50,893 INFO L140 encePairwiseOnDemand]: 632/646 looper letters, 793 selfloop transitions, 414 changer transitions 1/1210 dead transitions. [2023-08-26 11:36:50,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 1210 transitions, 21852 flow [2023-08-26 11:36:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-08-26 11:36:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-08-26 11:36:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 13583 transitions. [2023-08-26 11:36:50,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28035087719298246 [2023-08-26 11:36:50,903 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 13583 transitions. [2023-08-26 11:36:50,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 13583 transitions. [2023-08-26 11:36:50,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:36:50,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 13583 transitions. [2023-08-26 11:36:50,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 181.10666666666665) internal successors, (13583), 75 states have internal predecessors, (13583), 0 states have call successors, (0), 0 states have 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:50,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 646.0) internal successors, (49096), 76 states have internal predecessors, (49096), 0 states have call successors, (0), 0 states have 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:50,938 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 646.0) internal successors, (49096), 76 states have internal predecessors, (49096), 0 states have call successors, (0), 0 states have 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:50,939 INFO L175 Difference]: Start difference. First operand has 349 places, 419 transitions, 5722 flow. Second operand 75 states and 13583 transitions. [2023-08-26 11:36:50,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 1210 transitions, 21852 flow [2023-08-26 11:36:51,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 1210 transitions, 21671 flow, removed 0 selfloop flow, removed 11 redundant places. [2023-08-26 11:36:51,777 INFO L231 Difference]: Finished difference. Result has 445 places, 688 transitions, 11639 flow [2023-08-26 11:36:51,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=646, PETRI_DIFFERENCE_MINUEND_FLOW=5585, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=11639, PETRI_PLACES=445, PETRI_TRANSITIONS=688} [2023-08-26 11:36:51,777 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, 341 predicate places. [2023-08-26 11:36:51,777 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 688 transitions, 11639 flow [2023-08-26 11:36:51,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 175.33734939759037) internal successors, (14553), 83 states have internal predecessors, (14553), 0 states have call successors, (0), 0 states have 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:51,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:36:51,779 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 18, 18, 18, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:36:51,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-26 11:36:51,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:36:51,987 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2023-08-26 11:36:51,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:36:51,987 INFO L85 PathProgramCache]: Analyzing trace with hash -396634321, now seen corresponding path program 4 times [2023-08-26 11:36:51,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:36:51,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54973883] [2023-08-26 11:36:51,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:36:51,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:36:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:36:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 631 proven. 105 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2023-08-26 11:36:58,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:36:58,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54973883] [2023-08-26 11:36:58,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54973883] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 11:36:58,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756673946] [2023-08-26 11:36:58,629 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 11:36:58,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:36:58,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:36:58,630 INFO L229 MonitoredProcess]: Starting monitored process 16 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:58,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-26 11:36:59,445 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 11:36:59,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 11:36:59,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 1866 conjuncts, 324 conjunts are in the unsatisfiable core [2023-08-26 11:36:59,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 11:37:00,012 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:37:00,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:00,079 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:37:00,193 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:00,193 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:37:00,279 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:37:00,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 25 treesize of output 13 [2023-08-26 11:37:00,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:00,503 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:37:00,631 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:00,631 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-08-26 11:37:00,768 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:37:00,887 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 25 treesize of output 13 [2023-08-26 11:37:00,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:00,956 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:37:01,082 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:01,082 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-08-26 11:37:01,184 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:37:01,305 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 25 treesize of output 13 [2023-08-26 11:37:01,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:01,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 14 treesize of output 16 [2023-08-26 11:37:01,482 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:01,482 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-08-26 11:37:01,590 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:37:01,718 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:37:01,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:01,800 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:37:01,958 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:01,959 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:37:02,067 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:37:02,196 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:37:02,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:02,273 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:37:02,418 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:02,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 1 case distinctions, treesize of input 28 treesize of output 23 [2023-08-26 11:37:02,530 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:37:02,686 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:37:02,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:02,758 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:37:02,908 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:02,908 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:37:03,026 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:37:03,172 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:37:03,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:03,240 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:37:03,392 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:03,393 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:37:03,514 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:37:03,660 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 25 treesize of output 13 [2023-08-26 11:37:03,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:03,740 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:37:03,871 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:03,871 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-08-26 11:37:03,998 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:37:04,148 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 25 treesize of output 13 [2023-08-26 11:37:04,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:04,231 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:37:04,383 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:04,383 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-08-26 11:37:04,499 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:37:04,671 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 25 treesize of output 13 [2023-08-26 11:37:04,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:04,754 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:37:04,899 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:04,899 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-08-26 11:37:05,031 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:37:05,200 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 25 treesize of output 13 [2023-08-26 11:37:05,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:05,286 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-26 11:37:05,433 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:05,434 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-08-26 11:37:05,568 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:37:05,728 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 25 treesize of output 13 [2023-08-26 11:37:05,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:05,819 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:37:05,970 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:05,970 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-08-26 11:37:06,107 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:37:06,266 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 25 treesize of output 13 [2023-08-26 11:37:06,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 11:37:06,351 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:37:06,503 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-26 11:37:06,504 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-08-26 11:37:06,589 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:37:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 650 proven. 732 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-08-26 11:37:06,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 11:37:07,081 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3153 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse1))))) is different from false [2023-08-26 11:37:07,276 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3153 Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3148) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_3153)) .cse2)) 20)))))) is different from false [2023-08-26 11:37:07,304 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3145)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3148) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_3153)) .cse2)) 20)))))) is different from false [2023-08-26 11:37:07,497 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_3148) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse1) 20)) (= .cse4 20)))))) is different from false [2023-08-26 11:37:07,741 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse1))) v_ArrVal_3145)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_3148) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_3153)) .cse1) 20)) (= .cse4 20)))))) is different from false [2023-08-26 11:37:08,013 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3141 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3141) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_3148) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_3153)) .cse2) 20))))))) (= .cse8 20)))) is different from false [2023-08-26 11:37:08,063 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3139 Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3141 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3139)) (.cse8 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3141) .cse8 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse0 (select .cse5 .cse3))) (or (= 20 .cse0) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_3148) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse3) 20))))))))) is different from false [2023-08-26 11:37:08,880 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3139 Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3141 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) v_ArrVal_3139)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse9 .cse3))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_3141) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse5 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_3145)))) (let ((.cse0 (select .cse5 .cse3))) (or (= 20 .cse0) (= 20 .cse1) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_3148) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse3) 20)))))))))) is different from false [2023-08-26 11:37:08,912 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse11 .cse12))) (or (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3139 Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3141 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse11 .cse12 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) v_ArrVal_3139)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse9 .cse3))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_3141) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse5 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_3145)))) (let ((.cse0 (select .cse5 .cse3))) (or (= 20 .cse0) (= 20 .cse1) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_3148) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse3) 20)))))))))) (= .cse13 20)))) is different from false [2023-08-26 11:37:08,948 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse12 .cse13))) (or (= .cse0 20) (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3139 Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3141 Int)) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3134) .cse13 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3139)))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse10 .cse4))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_3141) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse6 (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse4)) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse2 (select .cse6 .cse4))) (or (= 20 .cse1) (= .cse2 20) (not (= (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_3148) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse4) 20))))))))))))) is different from false [2023-08-26 11:37:09,021 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3139 Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int)) (let ((.cse12 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3132)) (.cse13 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (select .cse12 .cse13))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3134) .cse13 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) v_ArrVal_3139)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse10 .cse1))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_3141) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse3 (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_3148) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_3153)) .cse1) 20)) (= 20 .cse5) (= .cse6 20) (= 20 .cse7))))))))))) is different from false [2023-08-26 11:37:09,409 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3139 Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3132)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse13 .cse3))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse6 v_ArrVal_3134) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) v_ArrVal_3139)))) (let ((.cse1 (select .cse10 .cse3))) (let ((.cse4 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_3141) .cse3 (+ 1 .cse1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse5 (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse7 (select .cse5 .cse3))) (or (= .cse0 20) (= 20 .cse1) (not (= 20 (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_3148) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse3))) (= .cse7 20)))))))))))) is different from false [2023-08-26 11:37:09,450 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3139 Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3148 Int) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int)) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse4) 4)) v_ArrVal_3132)))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select .cse13 .cse4))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_3134) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3139)))) (let ((.cse1 (select .cse10 .cse4))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_3141) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse6 (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse0 (select .cse6 .cse4))) (or (= .cse0 20) (= 20 .cse1) (= .cse2 20) (not (= 20 (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_3148) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_3153)) .cse4)))))))))))))) is different from false [2023-08-26 11:37:10,248 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse17 (select .cse15 .cse16))) (or (forall ((v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3137 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3126) .cse16 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3132)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse13 .cse2))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse5 v_ArrVal_3134) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_3139)))) (let ((.cse0 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_3141) .cse2 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse4 (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) v_ArrVal_3145)))) (let ((.cse6 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_3148) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_3153)) .cse2) 20)) (= 20 .cse6) (= .cse7 20)))))))))))) (= .cse17 20)))) is different from false [2023-08-26 11:37:10,354 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3125 Int) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3137 (Array Int Int))) (let ((.cse16 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3125)) (.cse17 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse16 .cse17))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3126) .cse17 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3132)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse14 .cse2))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_3134) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3139)))) (let ((.cse6 (select .cse11 .cse2))) (let ((.cse3 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_3141) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse4 (let ((.cse9 (select .cse3 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_3148) .cse2 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse2) 20)) (= .cse6 20) (= .cse7 20) (= .cse8 20)))))))))))))) is different from false [2023-08-26 11:37:12,326 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse21 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse20 .cse21))) (or (= .cse0 20) (forall ((v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3125 Int) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3137 (Array Int Int))) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse20 .cse21 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_3125)))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse18 .cse5))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse8 v_ArrVal_3126) .cse5 (+ 1 .cse3))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse5) 4)) v_ArrVal_3132)))) (let ((.cse2 (select .cse15 .cse5))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_3134) .cse5 (+ 1 .cse2))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_3139)))) (let ((.cse9 (select .cse12 .cse5))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_3141) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse7 (let ((.cse10 (select .cse6 |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse5)) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse1 (select .cse7 .cse5))) (or (= .cse1 20) (= 20 .cse2) (= 20 .cse3) (not (= 20 (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_3148) .cse5 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4)) v_ArrVal_3153)) .cse5))) (= 20 .cse9)))))))))))))))))) is different from false [2023-08-26 11:37:12,404 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse21 (select .cse19 .cse20))) (or (forall ((v_ArrVal_3119 Int) (v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3125 Int) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3137 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse19 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3119) .cse20 (+ .cse21 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3125)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse17 .cse1))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse4 v_ArrVal_3126) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) v_ArrVal_3132)))) (let ((.cse8 (select .cse14 .cse1))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse4 v_ArrVal_3134) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3139)))) (let ((.cse7 (select .cse11 .cse1))) (let ((.cse2 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_3141) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse3 (let ((.cse9 (select .cse2 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_3145)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_3148) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse1) 20)) (= .cse6 20) (= 20 .cse5) (= 20 .cse7) (= .cse8 20))))))))))))))) (= .cse21 20)))) is different from false [2023-08-26 11:37:12,557 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3119 Int) (v_ArrVal_3117 Int) (v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3125 Int) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3137 (Array Int Int))) (let ((.cse20 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3117)) (.cse21 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse20 .cse21))) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse20 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3119) .cse21 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse5) 4)) v_ArrVal_3125)))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select .cse18 .cse5))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse8 v_ArrVal_3126) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse5))) v_ArrVal_3132)))) (let ((.cse9 (select .cse15 .cse5))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_3134) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse5))) v_ArrVal_3139)))) (let ((.cse0 (select .cse12 .cse5))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_3141) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse7 (let ((.cse10 (select .cse6 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse5) 4)) v_ArrVal_3145)))) (let ((.cse3 (select .cse7 .cse5))) (or (= .cse0 20) (= .cse1 20) (= .cse2 20) (= .cse3 20) (not (= 20 (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_3148) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse5))) (= 20 .cse9))))))))))))))))) is different from false [2023-08-26 11:37:13,224 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3119 Int) (v_ArrVal_3117 Int) (v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3125 Int) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3116 (Array Int Int))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse20 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3116))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse4) 4)) v_ArrVal_3117)))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse21 .cse4))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse7 v_ArrVal_3119) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3125)))) (let ((.cse0 (select .cse18 .cse4))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse7 v_ArrVal_3126) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3132)))) (let ((.cse9 (select .cse15 .cse4))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse7 v_ArrVal_3134) .cse4 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3139)))) (let ((.cse2 (select .cse12 .cse4))) (let ((.cse5 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_3141) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse6 (let ((.cse10 (select .cse5 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse8 (select .cse6 .cse4))) (or (= 20 .cse0) (= .cse1 20) (= 20 .cse2) (not (= (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_3148) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse4) 20)) (= .cse9 20) (= 20 .cse8)))))))))))))))))) is different from false [2023-08-26 11:37:13,292 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3119 Int) (v_ArrVal_3117 Int) (v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3125 Int) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3116 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse20 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3116))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3117)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse21 .cse3))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse6 v_ArrVal_3119) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3125)))) (let ((.cse0 (select .cse18 .cse3))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse6 v_ArrVal_3126) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3132)))) (let ((.cse1 (select .cse15 .cse3))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse6 v_ArrVal_3134) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse3) 4)) v_ArrVal_3139)))) (let ((.cse8 (select .cse12 .cse3))) (let ((.cse4 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse6 v_ArrVal_3141) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse5 (let ((.cse10 (select .cse4 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse7 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_3148) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse3) 20)) (= .cse8 20) (= .cse7 20) (= 20 .cse9)))))))))))))))))) is different from false [2023-08-26 11:37:14,286 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse24 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse25 (select .cse23 .cse24))) (or (forall ((v_ArrVal_3119 Int) (v_ArrVal_3117 Int) (v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3113 Int) (v_ArrVal_3125 Int) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3116 (Array Int Int))) (let ((.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse20 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse23 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3113) .cse24 (+ .cse25 1))) |c_~#stored_elements~0.base| v_ArrVal_3116))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_3117)))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse21 .cse6))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse9 v_ArrVal_3119) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_3125)))) (let ((.cse1 (select .cse18 .cse6))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse9 v_ArrVal_3126) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse6) 4)) v_ArrVal_3132)))) (let ((.cse2 (select .cse15 .cse6))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse9 v_ArrVal_3134) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_3139)))) (let ((.cse0 (select .cse12 .cse6))) (let ((.cse7 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_3141) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse8 (let ((.cse10 (select .cse7 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse3 (select .cse8 .cse6))) (or (= 20 .cse0) (= .cse1 20) (= 20 .cse2) (= 20 .cse3) (= 20 .cse4) (not (= (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_3148) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse6)) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse6) 20))))))))))))))))))) (= .cse25 20)))) is different from false [2023-08-26 11:37:14,470 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3119 Int) (v_ArrVal_3117 Int) (v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3113 Int) (v_ArrVal_3125 Int) (v_ArrVal_3111 Int) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3116 (Array Int Int))) (let ((.cse24 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3111)) (.cse25 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse24 .cse25))) (let ((.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse24 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3113) .cse25 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3116))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_3117)))) (let ((.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse22 .cse7))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse10 v_ArrVal_3119) .cse7 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_3125)))) (let ((.cse3 (select .cse19 .cse7))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse10 v_ArrVal_3126) .cse7 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_3132)))) (let ((.cse0 (select .cse16 .cse7))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse10 v_ArrVal_3134) .cse7 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_3139)))) (let ((.cse2 (select .cse13 .cse7))) (let ((.cse8 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse10 v_ArrVal_3141) .cse7 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse9 (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse5 (select .cse9 .cse7))) (or (= .cse0 20) (= .cse1 20) (= .cse2 20) (= .cse3 20) (= 20 .cse4) (= .cse5 20) (not (= (select (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_3148) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse7) 20))))))))))))))))))))) is different from false [2023-08-26 11:37:17,491 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3119 Int) (v_ArrVal_3117 Int) (v_ArrVal_3139 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3113 Int) (v_ArrVal_3125 Int) (v_ArrVal_3111 Int) (v_ArrVal_3134 Int) (v_ArrVal_3145 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3109 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3109))) (let ((.cse1 (select .cse25 |c_~#queue~0.base|))) (let ((.cse26 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| 4) |c_~#queue~0.offset|) v_ArrVal_3111)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse26 .cse2))) (let ((.cse22 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse7 v_ArrVal_3113) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3116))) (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3117)))) (let ((.cse3 (select .cse23 .cse2))) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse7 v_ArrVal_3119) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3125)))) (let ((.cse10 (select .cse20 .cse2))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse7 v_ArrVal_3126) .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3132)))) (let ((.cse11 (select .cse17 .cse2))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse7 v_ArrVal_3134) .cse2 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* 4 (select .cse15 .cse2)) |c_~#queue~0.offset|) v_ArrVal_3139)))) (let ((.cse9 (select .cse14 .cse2))) (let ((.cse5 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse7 v_ArrVal_3141) .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse6 (let ((.cse12 (select .cse5 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse8 (select .cse6 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222|) (= .cse3 20) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_3148) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse2) 20)) (= .cse9 20) (= .cse8 20) (= 20 .cse10) (= 20 .cse11)))))))))))))))))))))) is different from false [2023-08-26 11:37:23,658 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3108 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3105 Int) (v_ArrVal_3103 Int) (v_ArrVal_3125 Int) (v_ArrVal_3145 Int) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| Int) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 Int) (v_ArrVal_3117 Int) (v_ArrVal_3139 Int) (v_ArrVal_3113 Int) (v_ArrVal_3111 Int) (v_ArrVal_3134 Int) (v_ArrVal_3153 Int) (v_ArrVal_3132 Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3109 (Array Int Int))) (let ((.cse11 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3103)) (.cse12 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse27 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3105) .cse12 v_ArrVal_3108)) |c_~#stored_elements~0.base| v_ArrVal_3109))) (let ((.cse1 (select .cse27 |c_~#queue~0.base|))) (let ((.cse28 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| 4) |c_~#queue~0.offset|) v_ArrVal_3111)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse28 .cse2))) (let ((.cse24 (store (store .cse27 |c_~#queue~0.base| (store (store .cse28 .cse7 v_ArrVal_3113) .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_3116))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse2) 4)) v_ArrVal_3117)))) (let ((.cse13 (select .cse25 .cse2))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse7 v_ArrVal_3119) .cse2 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3125)))) (let ((.cse10 (select .cse22 .cse2))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse7 v_ArrVal_3126) .cse2 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* (select .cse20 .cse2) 4)) v_ArrVal_3132)))) (let ((.cse3 (select .cse19 .cse2))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse7 v_ArrVal_3134) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse2) 4)) v_ArrVal_3139)))) (let ((.cse0 (select .cse16 .cse2))) (let ((.cse5 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse7 v_ArrVal_3141) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse6 (let ((.cse14 (select .cse5 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse8 (select .cse6 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222|) (= .cse3 20) (not (= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_3148) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse2) 4)) v_ArrVal_3153)) .cse2))) (= .cse9 20) (= .cse10 20) (= .cse8 20) (< (+ (select .cse11 .cse12) 1) v_ArrVal_3108) (= 20 .cse13))))))))))))))))))))))) is different from false [2023-08-26 11:39:10,764 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3108 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3105 Int) (v_ArrVal_3103 Int) (v_ArrVal_3125 Int) (v_ArrVal_3101 Int) (v_ArrVal_3145 Int) (v_ArrVal_3095 (Array Int Int)) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_226| Int) (v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 Int) (v_ArrVal_3117 Int) (v_ArrVal_3139 Int) (v_ArrVal_3113 Int) (v_ArrVal_3111 Int) (v_ArrVal_3134 Int) (v_ArrVal_3153 Int) (v_ArrVal_3099 Int) (v_ArrVal_3132 Int) (v_ArrVal_3096 Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3102 (Array Int Int)) (v_ArrVal_3109 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3095))) (let ((.cse15 (select .cse32 |c_~#queue~0.base|))) (let ((.cse10 (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_226| 4) |c_~#queue~0.offset|) v_ArrVal_3096)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse31 (store (store .cse32 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_3099) .cse2 v_ArrVal_3101)) |c_~#stored_elements~0.base| v_ArrVal_3102))) (let ((.cse13 (select .cse31 |c_~#queue~0.base|))) (let ((.cse14 (store .cse13 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_3103))) (let ((.cse29 (store (store .cse31 |c_~#queue~0.base| (store (store .cse14 .cse8 v_ArrVal_3105) .cse2 v_ArrVal_3108)) |c_~#stored_elements~0.base| v_ArrVal_3109))) (let ((.cse1 (select .cse29 |c_~#queue~0.base|))) (let ((.cse30 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| 4) |c_~#queue~0.offset|) v_ArrVal_3111))) (let ((.cse0 (select .cse30 .cse2))) (let ((.cse26 (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse8 v_ArrVal_3113) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3116))) (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ (* 4 (select .cse28 .cse2)) |c_~#queue~0.offset|) v_ArrVal_3117)))) (let ((.cse4 (select .cse27 .cse2))) (let ((.cse23 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse8 v_ArrVal_3119) .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (store .cse25 (+ |c_~#queue~0.offset| (* (select .cse25 .cse2) 4)) v_ArrVal_3125)))) (let ((.cse11 (select .cse24 .cse2))) (let ((.cse20 (store (store .cse23 |c_~#queue~0.base| (store (store .cse24 .cse8 v_ArrVal_3126) .cse2 (+ 1 .cse11))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse2) 4)) v_ArrVal_3132)))) (let ((.cse12 (select .cse21 .cse2))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse8 v_ArrVal_3134) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse2) 4)) v_ArrVal_3139)))) (let ((.cse9 (select .cse18 .cse2))) (let ((.cse6 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse8 v_ArrVal_3141) .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse7 (let ((.cse16 (select .cse6 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse3 (select .cse7 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222|) (= .cse3 20) (= .cse4 20) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_3148) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_3153)) .cse2) 20)) (= 20 .cse9) (< (+ (select .cse10 .cse2) 1) v_ArrVal_3101) (= 20 .cse11) (= .cse12 20) (< (select .cse13 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224|) (< (+ (select .cse14 .cse2) 1) v_ArrVal_3108) (< (select .cse15 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_226|)))))))))))))))))))))))))))) is different from false [2023-08-26 11:40:00,723 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3108 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3105 Int) (v_ArrVal_3103 Int) (v_ArrVal_3125 Int) (v_ArrVal_3101 Int) (v_ArrVal_3145 Int) (v_ArrVal_3086 Int) (v_ArrVal_3095 (Array Int Int)) (v_ArrVal_3141 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3130 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_226| Int) (v_ArrVal_3137 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228| Int) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 Int) (v_ArrVal_3117 Int) (v_ArrVal_3139 Int) (v_ArrVal_3113 Int) (v_ArrVal_3111 Int) (v_ArrVal_3134 Int) (v_ArrVal_3153 Int) (v_ArrVal_3099 Int) (v_ArrVal_3132 Int) (v_ArrVal_3096 Int) (v_ArrVal_3094 Int) (v_ArrVal_3092 Int) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3090 Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3102 (Array Int Int)) (v_ArrVal_3109 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3086)) |c_~#stored_elements~0.base| v_ArrVal_3088))) (let ((.cse15 (select .cse35 |c_~#queue~0.base|))) (let ((.cse16 (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228| 4) |c_~#queue~0.offset|) v_ArrVal_3090)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse34 (store (store .cse35 |c_~#queue~0.base| (store (store .cse16 .cse9 v_ArrVal_3092) .cse1 v_ArrVal_3094)) |c_~#stored_elements~0.base| v_ArrVal_3095))) (let ((.cse3 (select .cse34 |c_~#queue~0.base|))) (let ((.cse13 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_226| 4) |c_~#queue~0.offset|) v_ArrVal_3096))) (let ((.cse33 (store (store .cse34 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_3099) .cse1 v_ArrVal_3101)) |c_~#stored_elements~0.base| v_ArrVal_3102))) (let ((.cse0 (select .cse33 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_3103))) (let ((.cse31 (store (store .cse33 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_3105) .cse1 v_ArrVal_3108)) |c_~#stored_elements~0.base| v_ArrVal_3109))) (let ((.cse14 (select .cse31 |c_~#queue~0.base|))) (let ((.cse32 (store .cse14 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| 4) |c_~#queue~0.offset|) v_ArrVal_3111))) (let ((.cse4 (select .cse32 .cse1))) (let ((.cse28 (store (store .cse31 |c_~#queue~0.base| (store (store .cse32 .cse9 v_ArrVal_3113) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3116))) (let ((.cse29 (let ((.cse30 (select .cse28 |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse1) 4)) v_ArrVal_3117)))) (let ((.cse12 (select .cse29 .cse1))) (let ((.cse25 (store (store .cse28 |c_~#queue~0.base| (store (store .cse29 .cse9 v_ArrVal_3119) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3125)))) (let ((.cse5 (select .cse26 .cse1))) (let ((.cse22 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse9 v_ArrVal_3126) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ (* (select .cse24 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3132)))) (let ((.cse17 (select .cse23 .cse1))) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse9 v_ArrVal_3134) .cse1 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3139)))) (let ((.cse11 (select .cse20 .cse1))) (let ((.cse7 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse9 v_ArrVal_3141) .cse1 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse8 (let ((.cse18 (select .cse7 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3145)))) (let ((.cse10 (select .cse8 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_3108) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_226|) (= .cse4 20) (= .cse5 20) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_3086) (not (= (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_3148) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse1)) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse1) 20)) (= .cse10 20) (= .cse11 20) (= .cse12 20) (< (+ (select .cse13 .cse1) 1) v_ArrVal_3101) (< (select .cse14 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222|) (< (select .cse15 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228|) (< (+ (select .cse16 .cse1) 1) v_ArrVal_3094) (= .cse17 20))))))))))))))))))))))))))))))) is different from false [2023-08-26 11:40:04,708 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3108 Int) (v_ArrVal_3126 Int) (v_ArrVal_3148 Int) (v_ArrVal_3105 Int) (v_ArrVal_3103 Int) (v_ArrVal_3125 Int) (v_ArrVal_3101 Int) (v_ArrVal_3145 Int) (v_ArrVal_3086 Int) (v_ArrVal_3095 (Array Int Int)) (v_ArrVal_3141 Int) (v_ArrVal_3083 Int) (v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3084 Int) (v_ArrVal_3130 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_226| Int) (v_ArrVal_3137 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228| Int) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3119 Int) (v_ArrVal_3117 Int) (v_ArrVal_3139 Int) (v_ArrVal_3113 Int) (v_ArrVal_3111 Int) (v_ArrVal_3134 Int) (v_ArrVal_3153 Int) (v_ArrVal_3099 Int) (v_ArrVal_3132 Int) (v_ArrVal_3096 Int) (v_ArrVal_3094 Int) (v_ArrVal_3092 Int) (v_ArrVal_3088 (Array Int Int)) (v_ArrVal_3090 Int) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3123 (Array Int Int)) (v_ArrVal_3102 (Array Int Int)) (v_ArrVal_3109 (Array Int Int))) (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3083)) (.cse11 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse37 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3084) .cse11 v_ArrVal_3086)) |c_~#stored_elements~0.base| v_ArrVal_3088))) (let ((.cse17 (select .cse37 |c_~#queue~0.base|))) (let ((.cse13 (store .cse17 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228| 4) |c_~#queue~0.offset|) v_ArrVal_3090)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse36 (store (store .cse37 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_3092) .cse2 v_ArrVal_3094)) |c_~#stored_elements~0.base| v_ArrVal_3095))) (let ((.cse18 (select .cse36 |c_~#queue~0.base|))) (let ((.cse16 (store .cse18 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_226| 4) |c_~#queue~0.offset|) v_ArrVal_3096))) (let ((.cse35 (store (store .cse36 |c_~#queue~0.base| (store (store .cse16 .cse7 v_ArrVal_3099) .cse2 v_ArrVal_3101)) |c_~#stored_elements~0.base| v_ArrVal_3102))) (let ((.cse1 (select .cse35 |c_~#queue~0.base|))) (let ((.cse15 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_3103))) (let ((.cse33 (store (store .cse35 |c_~#queue~0.base| (store (store .cse15 .cse7 v_ArrVal_3105) .cse2 v_ArrVal_3108)) |c_~#stored_elements~0.base| v_ArrVal_3109))) (let ((.cse3 (select .cse33 |c_~#queue~0.base|))) (let ((.cse34 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| 4) |c_~#queue~0.offset|) v_ArrVal_3111))) (let ((.cse9 (select .cse34 .cse2))) (let ((.cse30 (store (store .cse33 |c_~#queue~0.base| (store (store .cse34 .cse7 v_ArrVal_3113) .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_3116))) (let ((.cse31 (let ((.cse32 (select .cse30 |c_~#queue~0.base|))) (store .cse32 (+ (* 4 (select .cse32 .cse2)) |c_~#queue~0.offset|) v_ArrVal_3117)))) (let ((.cse19 (select .cse31 .cse2))) (let ((.cse27 (store (store .cse30 |c_~#queue~0.base| (store (store .cse31 .cse7 v_ArrVal_3119) .cse2 (+ .cse19 1))) |c_~#stored_elements~0.base| v_ArrVal_3123))) (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse2) 4)) v_ArrVal_3125)))) (let ((.cse12 (select .cse28 .cse2))) (let ((.cse24 (store (store .cse27 |c_~#queue~0.base| (store (store .cse28 .cse7 v_ArrVal_3126) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_3130))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse2) 4)) v_ArrVal_3132)))) (let ((.cse14 (select .cse25 .cse2))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse7 v_ArrVal_3134) .cse2 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_3137))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3139)))) (let ((.cse0 (select .cse22 .cse2))) (let ((.cse5 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse7 v_ArrVal_3141) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3144))) (let ((.cse6 (let ((.cse20 (select .cse5 |c_~#queue~0.base|))) (store .cse20 (+ |c_~#queue~0.offset| (* 4 (select .cse20 .cse2))) v_ArrVal_3145)))) (let ((.cse8 (select .cse6 .cse2))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222|) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_3148) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_3151) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_3153)) .cse2) 20)) (= 20 .cse8) (= 20 .cse9) (< (+ (select .cse10 .cse11) 1) v_ArrVal_3086) (= .cse12 20) (< (+ (select .cse13 .cse2) 1) v_ArrVal_3094) (= 20 .cse14) (< (+ (select .cse15 .cse2) 1) v_ArrVal_3108) (< (+ (select .cse16 .cse2) 1) v_ArrVal_3101) (< (select .cse17 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228|) (< (select .cse18 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_226|) (= .cse19 20)))))))))))))))))))))))))))))))) is different from false Received shutdown request... [2023-08-26 11:40:50,344 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:40:50,344 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 11:40:50,638 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-26 11:40:50,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 103 remaining) [2023-08-26 11:40:50,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-26 11:40:50,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 11:40:50,841 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. [2023-08-26 11:40:50,842 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 103 remaining) [2023-08-26 11:40:50,842 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 103 remaining) [2023-08-26 11:40:50,842 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONASSERT (91 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 103 remaining) [2023-08-26 11:40:50,843 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (82 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 103 remaining) [2023-08-26 11:40:50,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 103 remaining) [2023-08-26 11:40:50,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err22ASSERT_VIOLATIONASSERT (40 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 103 remaining) [2023-08-26 11:40:50,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 103 remaining) [2023-08-26 11:40:50,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 103 remaining) [2023-08-26 11:40:50,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 103 remaining) [2023-08-26 11:40:50,849 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 103 remaining) [2023-08-26 11:40:50,849 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 103 remaining) [2023-08-26 11:40:50,849 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 103 remaining) [2023-08-26 11:40:50,849 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err22ASSERT_VIOLATIONASSERT (0 of 103 remaining) [2023-08-26 11:40:50,849 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:40:50,853 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 11:40:50,853 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 11:40:50,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 11:40:50 BasicIcfg [2023-08-26 11:40:50,854 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 11:40:50,855 INFO L158 Benchmark]: Toolchain (without parser) took 841928.53ms. Allocated memory was 354.4MB in the beginning and 3.9GB in the end (delta: 3.5GB). Free memory was 328.2MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-26 11:40:50,855 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 354.4MB. Free memory was 332.1MB in the beginning and 332.0MB in the end (delta: 91.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 11:40:50,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.24ms. Allocated memory is still 354.4MB. Free memory was 328.2MB in the beginning and 298.6MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 11:40:50,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.95ms. Allocated memory is still 354.4MB. Free memory was 298.6MB in the beginning and 295.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 11:40:50,855 INFO L158 Benchmark]: Boogie Preprocessor took 31.71ms. Allocated memory is still 354.4MB. Free memory was 295.5MB in the beginning and 293.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:40:50,855 INFO L158 Benchmark]: RCFGBuilder took 569.20ms. Allocated memory is still 354.4MB. Free memory was 293.4MB in the beginning and 264.6MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-26 11:40:50,855 INFO L158 Benchmark]: TraceAbstraction took 840776.37ms. Allocated memory was 354.4MB in the beginning and 3.9GB in the end (delta: 3.5GB). Free memory was 263.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-08-26 11:40:50,856 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 was 332.1MB in the beginning and 332.0MB in the end (delta: 91.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 491.24ms. Allocated memory is still 354.4MB. Free memory was 328.2MB in the beginning and 298.6MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.95ms. Allocated memory is still 354.4MB. Free memory was 298.6MB in the beginning and 295.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.71ms. Allocated memory is still 354.4MB. Free memory was 295.5MB in the beginning and 293.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 569.20ms. Allocated memory is still 354.4MB. Free memory was 293.4MB in the beginning and 264.6MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 840776.37ms. Allocated memory was 354.4MB in the beginning and 3.9GB in the end (delta: 3.5GB). Free memory was 263.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2s, 263 PlacesBefore, 104 PlacesAfterwards, 271 TransitionsBefore, 104 TransitionsAfterwards, 18460 CoEnabledTransitionPairs, 8 FixpointIterations, 104 TrivialSequentialCompositions, 223 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 22 ConcurrentYvCompositions, 8 ChoiceCompositions, 364 TotalNumberOfCompositions, 58098 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25857, independent: 25085, independent conditional: 0, independent unconditional: 25085, dependent: 772, dependent conditional: 0, dependent unconditional: 772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11511, independent: 11395, independent conditional: 0, independent unconditional: 11395, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25857, independent: 13690, independent conditional: 0, independent unconditional: 13690, dependent: 656, dependent conditional: 0, dependent unconditional: 656, unknown: 11511, unknown conditional: 0, unknown unconditional: 11511] , Statistics on independence cache: Total cache size (in pairs): 659, Positive cache size: 592, Positive conditional cache size: 0, Positive unconditional cache size: 592, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 173 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 186 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 103 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 840.6s, OverallIterations: 32, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 440.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.3s, HoareTripleCheckerStatistics: 593 mSolverCounterUnknown, 8221 SdHoareTripleChecker+Valid, 211.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8221 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 206.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8938 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 1207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21483 IncrementalHoareTripleChecker+Invalid, 32221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1207 mSolverCounterUnsat, 9 mSDtfsCounter, 21483 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1865 GetRequests, 1041 SyntacticMatches, 115 SemanticMatches, 709 ConstructedPredicates, 29 IntricatePredicates, 23 DeprecatedPredicates, 18113 ImplicationChecksByTransitivity, 302.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11639occurred in iteration=31, InterpolantAutomatonStates: 432, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 7.1s SatisfiabilityAnalysisTime, 137.8s InterpolantComputationTime, 1506 NumberOfCodeBlocks, 1411 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 2040 ConstructedInterpolants, 326 QuantifiedInterpolants, 190685 SizeOfPredicates, 167 NumberOfNonLiveVariables, 7691 ConjunctsInSsa, 777 ConjunctsInUnsatCore, 58 InterpolantComputations, 18 PerfectInterpolantSequences, 3875/8052 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown