/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 02:44:00,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 02:44:00,863 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-27 02:44:00,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 02:44:00,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 02:44:00,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 02:44:00,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 02:44:00,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 02:44:00,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 02:44:00,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 02:44:00,908 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 02:44:00,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 02:44:00,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 02:44:00,910 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 02:44:00,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 02:44:00,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 02:44:00,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 02:44:00,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 02:44:00,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 02:44:00,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 02:44:00,911 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 02:44:00,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 02:44:00,912 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 02:44:00,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 02:44:00,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 02:44:00,913 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 02:44:00,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 02:44:00,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 02:44:00,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 02:44:00,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 02:44:00,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 02:44:00,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 02:44:00,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 02:44:00,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 02:44:00,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 02:44:00,915 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 02:44:01,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 02:44:01,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 02:44:01,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 02:44:01,258 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 02:44:01,258 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 02:44:01,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-27 02:44:02,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 02:44:02,633 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 02:44:02,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-27 02:44:02,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b42abb7f4/7cba242bf3c6440fbc0f76b1aa24a7f2/FLAGc94d4f387 [2023-08-27 02:44:02,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b42abb7f4/7cba242bf3c6440fbc0f76b1aa24a7f2 [2023-08-27 02:44:02,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 02:44:02,672 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 02:44:02,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 02:44:02,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 02:44:02,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 02:44:02,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:44:02" (1/1) ... [2023-08-27 02:44:02,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7d360b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:02, skipping insertion in model container [2023-08-27 02:44:02,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:44:02" (1/1) ... [2023-08-27 02:44:02,730 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 02:44:03,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 02:44:03,140 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 02:44:03,155 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-27 02:44:03,156 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-27 02:44:03,164 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-27 02:44:03,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 02:44:03,236 INFO L206 MainTranslator]: Completed translation [2023-08-27 02:44:03,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03 WrapperNode [2023-08-27 02:44:03,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 02:44:03,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 02:44:03,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 02:44:03,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 02:44:03,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (1/1) ... [2023-08-27 02:44:03,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (1/1) ... [2023-08-27 02:44:03,291 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 221 [2023-08-27 02:44:03,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 02:44:03,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 02:44:03,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 02:44:03,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 02:44:03,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (1/1) ... [2023-08-27 02:44:03,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (1/1) ... [2023-08-27 02:44:03,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (1/1) ... [2023-08-27 02:44:03,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (1/1) ... [2023-08-27 02:44:03,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (1/1) ... [2023-08-27 02:44:03,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (1/1) ... [2023-08-27 02:44:03,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (1/1) ... [2023-08-27 02:44:03,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (1/1) ... [2023-08-27 02:44:03,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 02:44:03,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 02:44:03,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 02:44:03,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 02:44:03,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (1/1) ... [2023-08-27 02:44:03,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 02:44:03,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:44:03,355 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-27 02:44:03,383 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-27 02:44:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-27 02:44:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-27 02:44:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-27 02:44:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-27 02:44:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 02:44:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 02:44:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 02:44:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 02:44:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-27 02:44:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 02:44:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 02:44:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 02:44:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 02:44:03,399 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 02:44:03,516 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 02:44:03,517 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 02:44:03,826 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 02:44:03,833 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 02:44:03,834 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-27 02:44:03,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:44:03 BoogieIcfgContainer [2023-08-27 02:44:03,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 02:44:03,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 02:44:03,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 02:44:03,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 02:44:03,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 02:44:02" (1/3) ... [2023-08-27 02:44:03,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f94e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 02:44:03, skipping insertion in model container [2023-08-27 02:44:03,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:44:03" (2/3) ... [2023-08-27 02:44:03,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f94e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 02:44:03, skipping insertion in model container [2023-08-27 02:44:03,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:44:03" (3/3) ... [2023-08-27 02:44:03,842 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-08-27 02:44:03,856 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 02:44:03,856 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-27 02:44:03,857 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 02:44:03,978 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-27 02:44:04,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 248 transitions, 512 flow [2023-08-27 02:44:04,127 INFO L124 PetriNetUnfolderBase]: 15/246 cut-off events. [2023-08-27 02:44:04,127 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 02:44:04,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 246 events. 15/246 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 462 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2023-08-27 02:44:04,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 248 transitions, 512 flow [2023-08-27 02:44:04,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 237 transitions, 483 flow [2023-08-27 02:44:04,149 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 02:44:04,162 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-27 02:44:04,165 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-27 02:44:04,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 237 transitions, 483 flow [2023-08-27 02:44:04,234 INFO L124 PetriNetUnfolderBase]: 15/237 cut-off events. [2023-08-27 02:44:04,235 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 02:44:04,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 237 events. 15/237 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 385 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2023-08-27 02:44:04,247 INFO L119 LiptonReduction]: Number of co-enabled transitions 14312 [2023-08-27 02:44:11,497 INFO L134 LiptonReduction]: Checked pairs total: 33711 [2023-08-27 02:44:11,497 INFO L136 LiptonReduction]: Total number of compositions: 237 [2023-08-27 02:44:11,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 02:44:11,513 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;@40c257fa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 02:44:11,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-08-27 02:44:11,515 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 02:44:11,516 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-27 02:44:11,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 02:44:11,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:11,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-27 02:44:11,517 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:11,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash 991, now seen corresponding path program 1 times [2023-08-27 02:44:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:11,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676802622] [2023-08-27 02:44:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:11,614 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-27 02:44:11,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676802622] [2023-08-27 02:44:11,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676802622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:44:11,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:44:11,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-27 02:44:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870837143] [2023-08-27 02:44:11,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:44:11,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-27 02:44:11,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:11,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-27 02:44:11,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-27 02:44:11,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 485 [2023-08-27 02:44:11,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 127 flow. Second operand has 2 states, 2 states have (on average 235.5) internal successors, (471), 2 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:11,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:11,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 485 [2023-08-27 02:44:11,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:11,902 INFO L124 PetriNetUnfolderBase]: 1466/2404 cut-off events. [2023-08-27 02:44:11,902 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-08-27 02:44:11,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4797 conditions, 2404 events. 1466/2404 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12371 event pairs, 1185 based on Foata normal form. 0/1674 useless extension candidates. Maximal degree in co-relation 4577. Up to 2330 conditions per place. [2023-08-27 02:44:11,916 INFO L140 encePairwiseOnDemand]: 484/485 looper letters, 50 selfloop transitions, 0 changer transitions 0/58 dead transitions. [2023-08-27 02:44:11,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 225 flow [2023-08-27 02:44:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-27 02:44:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-27 02:44:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 521 transitions. [2023-08-27 02:44:11,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371134020618556 [2023-08-27 02:44:11,930 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 521 transitions. [2023-08-27 02:44:11,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 521 transitions. [2023-08-27 02:44:11,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:11,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 521 transitions. [2023-08-27 02:44:11,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 260.5) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:11,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:11,941 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:11,943 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 127 flow. Second operand 2 states and 521 transitions. [2023-08-27 02:44:11,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 225 flow [2023-08-27 02:44:11,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 02:44:11,947 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 120 flow [2023-08-27 02:44:11,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2023-08-27 02:44:11,952 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-08-27 02:44:11,952 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 120 flow [2023-08-27 02:44:11,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 235.5) internal successors, (471), 2 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:11,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:11,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:11,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 02:44:11,953 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:11,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:11,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1865824386, now seen corresponding path program 1 times [2023-08-27 02:44:11,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:11,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088910994] [2023-08-27 02:44:11,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:11,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:13,100 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-27 02:44:13,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:13,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088910994] [2023-08-27 02:44:13,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088910994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:44:13,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:44:13,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 02:44:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444717375] [2023-08-27 02:44:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:44:13,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 02:44:13,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:13,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 02:44:13,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 02:44:13,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 02:44:13,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:13,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:13,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 02:44:13,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:13,569 INFO L124 PetriNetUnfolderBase]: 1511/2489 cut-off events. [2023-08-27 02:44:13,569 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-27 02:44:13,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4962 conditions, 2489 events. 1511/2489 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12463 event pairs, 1057 based on Foata normal form. 0/1742 useless extension candidates. Maximal degree in co-relation 4959. Up to 2422 conditions per place. [2023-08-27 02:44:13,582 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 54 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2023-08-27 02:44:13,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 274 flow [2023-08-27 02:44:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:44:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:44:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1193 transitions. [2023-08-27 02:44:13,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099656357388316 [2023-08-27 02:44:13,588 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1193 transitions. [2023-08-27 02:44:13,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1193 transitions. [2023-08-27 02:44:13,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:13,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1193 transitions. [2023-08-27 02:44:13,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:13,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:13,599 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:13,599 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 120 flow. Second operand 6 states and 1193 transitions. [2023-08-27 02:44:13,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 274 flow [2023-08-27 02:44:13,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 02:44:13,602 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 186 flow [2023-08-27 02:44:13,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2023-08-27 02:44:13,603 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2023-08-27 02:44:13,603 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 186 flow [2023-08-27 02:44:13,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:13,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:13,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:13,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 02:44:13,608 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:13,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:13,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1865824368, now seen corresponding path program 1 times [2023-08-27 02:44:13,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:13,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913946790] [2023-08-27 02:44:13,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:13,997 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-27 02:44:13,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:13,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913946790] [2023-08-27 02:44:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913946790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:44:13,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:44:13,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 02:44:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67939279] [2023-08-27 02:44:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:44:13,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 02:44:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 02:44:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 02:44:14,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 02:44:14,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:14,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:14,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 02:44:14,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:14,280 INFO L124 PetriNetUnfolderBase]: 1510/2487 cut-off events. [2023-08-27 02:44:14,281 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2023-08-27 02:44:14,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5281 conditions, 2487 events. 1510/2487 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12431 event pairs, 1057 based on Foata normal form. 0/1788 useless extension candidates. Maximal degree in co-relation 5273. Up to 2421 conditions per place. [2023-08-27 02:44:14,294 INFO L140 encePairwiseOnDemand]: 479/485 looper letters, 55 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2023-08-27 02:44:14,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 70 transitions, 314 flow [2023-08-27 02:44:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 02:44:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 02:44:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1003 transitions. [2023-08-27 02:44:14,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41360824742268043 [2023-08-27 02:44:14,298 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1003 transitions. [2023-08-27 02:44:14,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1003 transitions. [2023-08-27 02:44:14,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:14,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1003 transitions. [2023-08-27 02:44:14,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 200.6) internal successors, (1003), 5 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:14,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:14,305 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:14,306 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 186 flow. Second operand 5 states and 1003 transitions. [2023-08-27 02:44:14,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 70 transitions, 314 flow [2023-08-27 02:44:14,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 02:44:14,309 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 196 flow [2023-08-27 02:44:14,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2023-08-27 02:44:14,309 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2023-08-27 02:44:14,310 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 196 flow [2023-08-27 02:44:14,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:14,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:14,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:14,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 02:44:14,311 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:14,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:14,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2006802610, now seen corresponding path program 1 times [2023-08-27 02:44:14,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:14,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755119971] [2023-08-27 02:44:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:14,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:14,701 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-27 02:44:14,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755119971] [2023-08-27 02:44:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755119971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:44:14,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:44:14,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:44:14,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024965756] [2023-08-27 02:44:14,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:44:14,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:44:14,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:14,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:44:14,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:44:14,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:44:14,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:14,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:14,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:44:14,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:15,143 INFO L124 PetriNetUnfolderBase]: 2181/3625 cut-off events. [2023-08-27 02:44:15,143 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2023-08-27 02:44:15,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7779 conditions, 3625 events. 2181/3625 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 20327 event pairs, 512 based on Foata normal form. 0/2716 useless extension candidates. Maximal degree in co-relation 7770. Up to 2528 conditions per place. [2023-08-27 02:44:15,165 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 110 selfloop transitions, 15 changer transitions 0/132 dead transitions. [2023-08-27 02:44:15,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 132 transitions, 603 flow [2023-08-27 02:44:15,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 02:44:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 02:44:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1042 transitions. [2023-08-27 02:44:15,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4296907216494845 [2023-08-27 02:44:15,169 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1042 transitions. [2023-08-27 02:44:15,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1042 transitions. [2023-08-27 02:44:15,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:15,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1042 transitions. [2023-08-27 02:44:15,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-27 02:44:15,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:15,177 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:15,177 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 196 flow. Second operand 5 states and 1042 transitions. [2023-08-27 02:44:15,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 132 transitions, 603 flow [2023-08-27 02:44:15,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 132 transitions, 587 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 02:44:15,185 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 266 flow [2023-08-27 02:44:15,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2023-08-27 02:44:15,186 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2023-08-27 02:44:15,186 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 266 flow [2023-08-27 02:44:15,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:15,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:15,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:15,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 02:44:15,187 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:15,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:15,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2005979560, now seen corresponding path program 2 times [2023-08-27 02:44:15,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:15,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835635984] [2023-08-27 02:44:15,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:15,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:15,857 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-27 02:44:15,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:15,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835635984] [2023-08-27 02:44:15,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835635984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:44:15,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:44:15,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:44:15,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650840619] [2023-08-27 02:44:15,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:44:15,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:44:15,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:15,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:44:15,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:44:15,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:44:15,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:15,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:15,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:44:15,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:16,438 INFO L124 PetriNetUnfolderBase]: 2181/3621 cut-off events. [2023-08-27 02:44:16,439 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2023-08-27 02:44:16,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8519 conditions, 3621 events. 2181/3621 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 20236 event pairs, 389 based on Foata normal form. 0/2785 useless extension candidates. Maximal degree in co-relation 8508. Up to 2528 conditions per place. [2023-08-27 02:44:16,459 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 124 selfloop transitions, 22 changer transitions 0/153 dead transitions. [2023-08-27 02:44:16,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 153 transitions, 753 flow [2023-08-27 02:44:16,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:44:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:44:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2023-08-27 02:44:16,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42577319587628865 [2023-08-27 02:44:16,464 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1239 transitions. [2023-08-27 02:44:16,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1239 transitions. [2023-08-27 02:44:16,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:16,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1239 transitions. [2023-08-27 02:44:16,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:16,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:16,472 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:16,472 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 266 flow. Second operand 6 states and 1239 transitions. [2023-08-27 02:44:16,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 153 transitions, 753 flow [2023-08-27 02:44:16,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 153 transitions, 735 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-08-27 02:44:16,486 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 376 flow [2023-08-27 02:44:16,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2023-08-27 02:44:16,489 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2023-08-27 02:44:16,489 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 376 flow [2023-08-27 02:44:16,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:16,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:16,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:16,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 02:44:16,490 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:16,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:16,491 INFO L85 PathProgramCache]: Analyzing trace with hash 752218327, now seen corresponding path program 1 times [2023-08-27 02:44:16,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:16,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963307562] [2023-08-27 02:44:16,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:16,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:16,528 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-27 02:44:16,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:16,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963307562] [2023-08-27 02:44:16,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963307562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:44:16,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:44:16,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 02:44:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280677120] [2023-08-27 02:44:16,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:44:16,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 02:44:16,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:16,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 02:44:16,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 02:44:16,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 485 [2023-08-27 02:44:16,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 225.25) internal successors, (901), 4 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:16,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:16,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 485 [2023-08-27 02:44:16,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:17,119 INFO L124 PetriNetUnfolderBase]: 3557/5851 cut-off events. [2023-08-27 02:44:17,119 INFO L125 PetriNetUnfolderBase]: For 3122/3173 co-relation queries the response was YES. [2023-08-27 02:44:17,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14120 conditions, 5851 events. 3557/5851 cut-off events. For 3122/3173 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 35750 event pairs, 1602 based on Foata normal form. 51/4420 useless extension candidates. Maximal degree in co-relation 14105. Up to 3438 conditions per place. [2023-08-27 02:44:17,151 INFO L140 encePairwiseOnDemand]: 478/485 looper letters, 153 selfloop transitions, 4 changer transitions 0/167 dead transitions. [2023-08-27 02:44:17,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 167 transitions, 1034 flow [2023-08-27 02:44:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 02:44:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 02:44:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1009 transitions. [2023-08-27 02:44:17,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201030927835052 [2023-08-27 02:44:17,155 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1009 transitions. [2023-08-27 02:44:17,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1009 transitions. [2023-08-27 02:44:17,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:17,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1009 transitions. [2023-08-27 02:44:17,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 252.25) internal successors, (1009), 4 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:17,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:17,161 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:17,161 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 376 flow. Second operand 4 states and 1009 transitions. [2023-08-27 02:44:17,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 167 transitions, 1034 flow [2023-08-27 02:44:17,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 167 transitions, 1032 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-27 02:44:17,168 INFO L231 Difference]: Finished difference. Result has 84 places, 86 transitions, 406 flow [2023-08-27 02:44:17,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=406, PETRI_PLACES=84, PETRI_TRANSITIONS=86} [2023-08-27 02:44:17,169 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2023-08-27 02:44:17,169 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 86 transitions, 406 flow [2023-08-27 02:44:17,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 225.25) internal successors, (901), 4 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:17,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:17,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:17,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 02:44:17,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:17,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:17,170 INFO L85 PathProgramCache]: Analyzing trace with hash 693783489, now seen corresponding path program 1 times [2023-08-27 02:44:17,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:17,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623210362] [2023-08-27 02:44:17,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:17,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:17,492 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-27 02:44:17,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:17,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623210362] [2023-08-27 02:44:17,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623210362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:44:17,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:44:17,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 02:44:17,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262185207] [2023-08-27 02:44:17,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:44:17,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 02:44:17,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:17,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 02:44:17,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 02:44:17,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 02:44:17,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 86 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:17,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:17,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 02:44:17,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:18,101 INFO L124 PetriNetUnfolderBase]: 3602/6015 cut-off events. [2023-08-27 02:44:18,101 INFO L125 PetriNetUnfolderBase]: For 3921/3929 co-relation queries the response was YES. [2023-08-27 02:44:18,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15567 conditions, 6015 events. 3602/6015 cut-off events. For 3921/3929 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 36577 event pairs, 2530 based on Foata normal form. 0/4858 useless extension candidates. Maximal degree in co-relation 15549. Up to 5806 conditions per place. [2023-08-27 02:44:18,132 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 77 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2023-08-27 02:44:18,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 94 transitions, 598 flow [2023-08-27 02:44:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:44:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:44:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2023-08-27 02:44:18,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.411340206185567 [2023-08-27 02:44:18,136 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1197 transitions. [2023-08-27 02:44:18,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1197 transitions. [2023-08-27 02:44:18,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:18,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1197 transitions. [2023-08-27 02:44:18,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 199.5) internal successors, (1197), 6 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:18,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:18,143 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:18,143 INFO L175 Difference]: Start difference. First operand has 84 places, 86 transitions, 406 flow. Second operand 6 states and 1197 transitions. [2023-08-27 02:44:18,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 94 transitions, 598 flow [2023-08-27 02:44:18,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 94 transitions, 596 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 02:44:18,155 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 444 flow [2023-08-27 02:44:18,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2023-08-27 02:44:18,156 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2023-08-27 02:44:18,156 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 444 flow [2023-08-27 02:44:18,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:18,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:18,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:18,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 02:44:18,157 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:18,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:18,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1288991555, now seen corresponding path program 1 times [2023-08-27 02:44:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126353261] [2023-08-27 02:44:18,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:18,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:18,843 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-27 02:44:18,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:18,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126353261] [2023-08-27 02:44:18,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126353261] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:44:18,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:44:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:44:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721601916] [2023-08-27 02:44:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:44:18,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:44:18,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:44:18,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:44:18,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:44:18,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 444 flow. Second operand has 6 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-27 02:44:18,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:18,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:44:18,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:19,670 INFO L124 PetriNetUnfolderBase]: 3916/6452 cut-off events. [2023-08-27 02:44:19,671 INFO L125 PetriNetUnfolderBase]: For 3113/3143 co-relation queries the response was YES. [2023-08-27 02:44:19,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16860 conditions, 6452 events. 3916/6452 cut-off events. For 3113/3143 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 39632 event pairs, 726 based on Foata normal form. 94/5527 useless extension candidates. Maximal degree in co-relation 16841. Up to 4791 conditions per place. [2023-08-27 02:44:19,702 INFO L140 encePairwiseOnDemand]: 475/485 looper letters, 143 selfloop transitions, 20 changer transitions 0/170 dead transitions. [2023-08-27 02:44:19,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 170 transitions, 1013 flow [2023-08-27 02:44:19,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:44:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:44:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1244 transitions. [2023-08-27 02:44:19,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274914089347079 [2023-08-27 02:44:19,707 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1244 transitions. [2023-08-27 02:44:19,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1244 transitions. [2023-08-27 02:44:19,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:19,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1244 transitions. [2023-08-27 02:44:19,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:19,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:19,715 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:19,716 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 444 flow. Second operand 6 states and 1244 transitions. [2023-08-27 02:44:19,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 170 transitions, 1013 flow [2023-08-27 02:44:19,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 170 transitions, 997 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 02:44:19,739 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 496 flow [2023-08-27 02:44:19,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=496, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2023-08-27 02:44:19,742 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 32 predicate places. [2023-08-27 02:44:19,742 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 496 flow [2023-08-27 02:44:19,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-27 02:44:19,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:19,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:19,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 02:44:19,743 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:19,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash 38670329, now seen corresponding path program 2 times [2023-08-27 02:44:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:19,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235389291] [2023-08-27 02:44:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:44:20,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:20,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235389291] [2023-08-27 02:44:20,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235389291] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:44:20,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:44:20,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:44:20,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443512307] [2023-08-27 02:44:20,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:44:20,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:44:20,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:20,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:44:20,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:44:20,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:44:20,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 496 flow. Second operand has 6 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-27 02:44:20,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:20,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:44:20,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:21,144 INFO L124 PetriNetUnfolderBase]: 4146/6845 cut-off events. [2023-08-27 02:44:21,145 INFO L125 PetriNetUnfolderBase]: For 4591/4615 co-relation queries the response was YES. [2023-08-27 02:44:21,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18567 conditions, 6845 events. 4146/6845 cut-off events. For 4591/4615 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 41941 event pairs, 730 based on Foata normal form. 94/5889 useless extension candidates. Maximal degree in co-relation 18547. Up to 4332 conditions per place. [2023-08-27 02:44:21,189 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 142 selfloop transitions, 23 changer transitions 0/172 dead transitions. [2023-08-27 02:44:21,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 172 transitions, 1073 flow [2023-08-27 02:44:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:44:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:44:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1243 transitions. [2023-08-27 02:44:21,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42714776632302404 [2023-08-27 02:44:21,193 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1243 transitions. [2023-08-27 02:44:21,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1243 transitions. [2023-08-27 02:44:21,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:21,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1243 transitions. [2023-08-27 02:44:21,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.16666666666666) internal successors, (1243), 6 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,201 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,202 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 496 flow. Second operand 6 states and 1243 transitions. [2023-08-27 02:44:21,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 172 transitions, 1073 flow [2023-08-27 02:44:21,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 172 transitions, 1050 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 02:44:21,229 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 554 flow [2023-08-27 02:44:21,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2023-08-27 02:44:21,230 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 36 predicate places. [2023-08-27 02:44:21,230 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 554 flow [2023-08-27 02:44:21,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-27 02:44:21,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:21,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:21,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 02:44:21,231 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:21,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:21,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1327212761, now seen corresponding path program 1 times [2023-08-27 02:44:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:21,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840461944] [2023-08-27 02:44:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:21,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:44:21,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:21,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840461944] [2023-08-27 02:44:21,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840461944] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:44:21,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:44:21,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:44:21,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854639768] [2023-08-27 02:44:21,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:44:21,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:44:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:21,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:44:21,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:44:21,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 485 [2023-08-27 02:44:21,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:21,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 485 [2023-08-27 02:44:21,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:21,467 INFO L124 PetriNetUnfolderBase]: 852/1653 cut-off events. [2023-08-27 02:44:21,467 INFO L125 PetriNetUnfolderBase]: For 1280/1287 co-relation queries the response was YES. [2023-08-27 02:44:21,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 1653 events. 852/1653 cut-off events. For 1280/1287 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9260 event pairs, 565 based on Foata normal form. 73/1571 useless extension candidates. Maximal degree in co-relation 4239. Up to 813 conditions per place. [2023-08-27 02:44:21,475 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 75 selfloop transitions, 2 changer transitions 7/92 dead transitions. [2023-08-27 02:44:21,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 645 flow [2023-08-27 02:44:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:44:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:44:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2023-08-27 02:44:21,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147766323024054 [2023-08-27 02:44:21,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2023-08-27 02:44:21,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2023-08-27 02:44:21,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:21,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2023-08-27 02:44:21,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,482 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 554 flow. Second operand 3 states and 749 transitions. [2023-08-27 02:44:21,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 645 flow [2023-08-27 02:44:21,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 613 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-27 02:44:21,488 INFO L231 Difference]: Finished difference. Result has 94 places, 80 transitions, 419 flow [2023-08-27 02:44:21,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2023-08-27 02:44:21,488 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 35 predicate places. [2023-08-27 02:44:21,488 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 419 flow [2023-08-27 02:44:21,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:21,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:21,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 02:44:21,489 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:21,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1005879036, now seen corresponding path program 1 times [2023-08-27 02:44:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:21,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976175984] [2023-08-27 02:44:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:21,523 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-27 02:44:21,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976175984] [2023-08-27 02:44:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976175984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:44:21,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:44:21,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:44:21,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718075842] [2023-08-27 02:44:21,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:44:21,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:44:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:44:21,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:44:21,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:44:21,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 80 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:21,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:44:21,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:21,670 INFO L124 PetriNetUnfolderBase]: 548/1083 cut-off events. [2023-08-27 02:44:21,671 INFO L125 PetriNetUnfolderBase]: For 622/627 co-relation queries the response was YES. [2023-08-27 02:44:21,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1083 events. 548/1083 cut-off events. For 622/627 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5347 event pairs, 410 based on Foata normal form. 13/971 useless extension candidates. Maximal degree in co-relation 2823. Up to 804 conditions per place. [2023-08-27 02:44:21,676 INFO L140 encePairwiseOnDemand]: 480/485 looper letters, 76 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-27 02:44:21,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 594 flow [2023-08-27 02:44:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:44:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:44:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2023-08-27 02:44:21,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140893470790378 [2023-08-27 02:44:21,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2023-08-27 02:44:21,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2023-08-27 02:44:21,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:21,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2023-08-27 02:44:21,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,684 INFO L175 Difference]: Start difference. First operand has 94 places, 80 transitions, 419 flow. Second operand 3 states and 748 transitions. [2023-08-27 02:44:21,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 594 flow [2023-08-27 02:44:21,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 581 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-27 02:44:21,689 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 414 flow [2023-08-27 02:44:21,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2023-08-27 02:44:21,689 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 34 predicate places. [2023-08-27 02:44:21,689 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 414 flow [2023-08-27 02:44:21,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:21,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:21,690 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:21,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 02:44:21,691 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:21,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash 156498137, now seen corresponding path program 1 times [2023-08-27 02:44:21,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:21,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430203038] [2023-08-27 02:44:21,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:44:22,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430203038] [2023-08-27 02:44:22,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430203038] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:44:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873715477] [2023-08-27 02:44:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:22,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:44:22,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:44:22,871 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-27 02:44:22,897 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-27 02:44:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:23,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-27 02:44:23,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:44:23,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:23,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:23,093 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:44:23,094 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-27 02:44:23,106 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 02:44:23,106 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-27 02:44:23,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-27 02:44:23,395 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-27 02:44:23,560 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 44 treesize of output 37 [2023-08-27 02:44:23,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:23,624 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 33 treesize of output 35 [2023-08-27 02:44:23,744 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 47 treesize of output 40 [2023-08-27 02:44:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:44:24,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:44:24,207 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)))) is different from false [2023-08-27 02:44:24,280 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_402)) |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_402) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|))))) is different from false [2023-08-27 02:44:24,316 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_400) .cse1 v_ArrVal_402)) |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_400) (< (+ (select .cse0 .cse1) 1) v_ArrVal_402) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|))))) is different from false [2023-08-27 02:44:24,449 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_398 Int) (v_ArrVal_404 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_398)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_400) .cse3 v_ArrVal_402)) |c_~#stored_elements~0.base| v_ArrVal_404) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_400) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_402) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_405) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 02:44:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 02:44:28,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873715477] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:44:28,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:44:28,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-27 02:44:28,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075299361] [2023-08-27 02:44:28,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:44:28,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-27 02:44:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:28,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-27 02:44:28,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=573, Unknown=12, NotChecked=220, Total=992 [2023-08-27 02:44:28,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 485 [2023-08-27 02:44:28,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 414 flow. Second operand has 32 states, 32 states have (on average 180.40625) internal successors, (5773), 32 states have internal predecessors, (5773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:28,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:28,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 485 [2023-08-27 02:44:28,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:33,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:44:35,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:44:35,960 INFO L124 PetriNetUnfolderBase]: 612/1198 cut-off events. [2023-08-27 02:44:35,960 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2023-08-27 02:44:35,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 1198 events. 612/1198 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6016 event pairs, 436 based on Foata normal form. 0/1070 useless extension candidates. Maximal degree in co-relation 3199. Up to 1046 conditions per place. [2023-08-27 02:44:35,966 INFO L140 encePairwiseOnDemand]: 468/485 looper letters, 69 selfloop transitions, 52 changer transitions 1/128 dead transitions. [2023-08-27 02:44:35,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 128 transitions, 889 flow [2023-08-27 02:44:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-27 02:44:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-27 02:44:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3868 transitions. [2023-08-27 02:44:35,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.379774177712322 [2023-08-27 02:44:35,977 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3868 transitions. [2023-08-27 02:44:35,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3868 transitions. [2023-08-27 02:44:35,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:35,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3868 transitions. [2023-08-27 02:44:35,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 184.1904761904762) internal successors, (3868), 21 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:35,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 485.0) internal successors, (10670), 22 states have internal predecessors, (10670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:35,999 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 485.0) internal successors, (10670), 22 states have internal predecessors, (10670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:35,999 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 414 flow. Second operand 21 states and 3868 transitions. [2023-08-27 02:44:35,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 128 transitions, 889 flow [2023-08-27 02:44:36,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 128 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 02:44:36,005 INFO L231 Difference]: Finished difference. Result has 119 places, 115 transitions, 777 flow [2023-08-27 02:44:36,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=777, PETRI_PLACES=119, PETRI_TRANSITIONS=115} [2023-08-27 02:44:36,006 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 60 predicate places. [2023-08-27 02:44:36,006 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 115 transitions, 777 flow [2023-08-27 02:44:36,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 180.40625) internal successors, (5773), 32 states have internal predecessors, (5773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:36,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:36,007 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:36,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-27 02:44:36,212 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,SelfDestructingSolverStorable11 [2023-08-27 02:44:36,213 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:36,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash 156498119, now seen corresponding path program 1 times [2023-08-27 02:44:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817010877] [2023-08-27 02:44:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:44:36,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:36,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817010877] [2023-08-27 02:44:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817010877] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:44:36,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497990856] [2023-08-27 02:44:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:36,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:44:36,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:44:36,640 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-27 02:44:36,642 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-27 02:44:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:36,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-27 02:44:36,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:44:36,874 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-27 02:44:36,943 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-27 02:44:36,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:36,972 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-27 02:44:37,040 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-27 02:44:37,040 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 23 treesize of output 26 [2023-08-27 02:44:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:44:37,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:44:37,156 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_487 Int) (v_ArrVal_485 (Array Int Int))) (or (< (+ v_ArrVal_487 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_485) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_487) (+ 3208 |c_~#queue~0.offset|)))))) is different from false [2023-08-27 02:44:37,232 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:44:37,233 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 2 case distinctions, treesize of input 36 treesize of output 42 [2023-08-27 02:44:37,243 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:44:37,243 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 55 treesize of output 59 [2023-08-27 02:44:37,249 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 28 treesize of output 24 [2023-08-27 02:44:37,265 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 9 treesize of output 5 [2023-08-27 02:44:37,276 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:44:37,276 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 43 treesize of output 43 [2023-08-27 02:44:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:44:37,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497990856] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:44:37,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:44:37,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-08-27 02:44:37,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840248742] [2023-08-27 02:44:37,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:44:37,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-27 02:44:37,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:37,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-27 02:44:37,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=476, Unknown=2, NotChecked=46, Total=650 [2023-08-27 02:44:37,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 485 [2023-08-27 02:44:37,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 115 transitions, 777 flow. Second operand has 26 states, 26 states have (on average 181.73076923076923) internal successors, (4725), 26 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:37,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:37,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 485 [2023-08-27 02:44:37,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:38,263 INFO L124 PetriNetUnfolderBase]: 1367/2659 cut-off events. [2023-08-27 02:44:38,263 INFO L125 PetriNetUnfolderBase]: For 1601/1601 co-relation queries the response was YES. [2023-08-27 02:44:38,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7089 conditions, 2659 events. 1367/2659 cut-off events. For 1601/1601 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 15854 event pairs, 646 based on Foata normal form. 0/2361 useless extension candidates. Maximal degree in co-relation 7060. Up to 845 conditions per place. [2023-08-27 02:44:38,279 INFO L140 encePairwiseOnDemand]: 475/485 looper letters, 173 selfloop transitions, 50 changer transitions 4/233 dead transitions. [2023-08-27 02:44:38,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 233 transitions, 1652 flow [2023-08-27 02:44:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 02:44:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 02:44:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2146 transitions. [2023-08-27 02:44:38,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022492970946579 [2023-08-27 02:44:38,284 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2146 transitions. [2023-08-27 02:44:38,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2146 transitions. [2023-08-27 02:44:38,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:38,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2146 transitions. [2023-08-27 02:44:38,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 195.0909090909091) internal successors, (2146), 11 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:38,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 485.0) internal successors, (5820), 12 states have internal predecessors, (5820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:38,295 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 485.0) internal successors, (5820), 12 states have internal predecessors, (5820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:38,295 INFO L175 Difference]: Start difference. First operand has 119 places, 115 transitions, 777 flow. Second operand 11 states and 2146 transitions. [2023-08-27 02:44:38,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 233 transitions, 1652 flow [2023-08-27 02:44:38,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 1514 flow, removed 54 selfloop flow, removed 8 redundant places. [2023-08-27 02:44:38,308 INFO L231 Difference]: Finished difference. Result has 123 places, 124 transitions, 836 flow [2023-08-27 02:44:38,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=836, PETRI_PLACES=123, PETRI_TRANSITIONS=124} [2023-08-27 02:44:38,309 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 64 predicate places. [2023-08-27 02:44:38,309 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 124 transitions, 836 flow [2023-08-27 02:44:38,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 181.73076923076923) internal successors, (4725), 26 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:38,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:38,310 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:38,318 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-27 02:44:38,515 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,SelfDestructingSolverStorable12 [2023-08-27 02:44:38,515 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:44:38,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:38,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1827680919, now seen corresponding path program 1 times [2023-08-27 02:44:38,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:38,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598442790] [2023-08-27 02:44:38,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:38,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:44:39,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598442790] [2023-08-27 02:44:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598442790] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:44:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329999894] [2023-08-27 02:44:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:39,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:44:39,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:44:39,371 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-27 02:44:39,401 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-27 02:44:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:39,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-27 02:44:39,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:44:39,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:39,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:39,543 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:44:39,544 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-27 02:44:39,562 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:44:39,562 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-27 02:44:39,634 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-08-27 02:44:39,708 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-27 02:44:39,810 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-27 02:44:39,977 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 44 treesize of output 37 [2023-08-27 02:44:40,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:40,053 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 33 treesize of output 35 [2023-08-27 02:44:40,194 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-27 02:44:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:44:40,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:44:41,055 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_585))))) is different from false [2023-08-27 02:44:41,088 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_585 Int) (v_ArrVal_584 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_587 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_584) .cse2 v_ArrVal_585)) |c_~#stored_elements~0.base| v_ArrVal_587) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_584) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_~#queue~0.offset|) v_ArrVal_588) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_585) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|))))) is different from false [2023-08-27 02:44:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:44:50,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329999894] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:44:50,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:44:50,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 02:44:50,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893864929] [2023-08-27 02:44:50,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:44:50,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 02:44:50,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:50,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 02:44:50,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=800, Unknown=30, NotChecked=126, Total=1190 [2023-08-27 02:44:50,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:44:50,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 124 transitions, 836 flow. Second operand has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:44:50,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:50,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:44:50,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:52,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:44:56,483 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-27 02:44:58,498 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-27 02:45:00,961 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-27 02:45:02,084 INFO L124 PetriNetUnfolderBase]: 2267/4394 cut-off events. [2023-08-27 02:45:02,084 INFO L125 PetriNetUnfolderBase]: For 3580/3580 co-relation queries the response was YES. [2023-08-27 02:45:02,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11899 conditions, 4394 events. 2267/4394 cut-off events. For 3580/3580 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 29516 event pairs, 831 based on Foata normal form. 21/3964 useless extension candidates. Maximal degree in co-relation 11869. Up to 2278 conditions per place. [2023-08-27 02:45:02,102 INFO L140 encePairwiseOnDemand]: 463/485 looper letters, 181 selfloop transitions, 99 changer transitions 3/289 dead transitions. [2023-08-27 02:45:02,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 289 transitions, 2033 flow [2023-08-27 02:45:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 02:45:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 02:45:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4604 transitions. [2023-08-27 02:45:02,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797113402061856 [2023-08-27 02:45:02,114 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4604 transitions. [2023-08-27 02:45:02,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4604 transitions. [2023-08-27 02:45:02,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:45:02,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4604 transitions. [2023-08-27 02:45:02,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 184.16) internal successors, (4604), 25 states have internal predecessors, (4604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:45:02,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 485.0) internal successors, (12610), 26 states have internal predecessors, (12610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:45:02,136 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 485.0) internal successors, (12610), 26 states have internal predecessors, (12610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:45:02,136 INFO L175 Difference]: Start difference. First operand has 123 places, 124 transitions, 836 flow. Second operand 25 states and 4604 transitions. [2023-08-27 02:45:02,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 289 transitions, 2033 flow [2023-08-27 02:45:02,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 289 transitions, 1963 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-27 02:45:02,158 INFO L231 Difference]: Finished difference. Result has 152 places, 169 transitions, 1414 flow [2023-08-27 02:45:02,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1414, PETRI_PLACES=152, PETRI_TRANSITIONS=169} [2023-08-27 02:45:02,159 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 93 predicate places. [2023-08-27 02:45:02,159 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 169 transitions, 1414 flow [2023-08-27 02:45:02,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:45:02,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:45:02,161 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:45:02,166 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-27 02:45:02,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:45:02,366 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:45:02,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:45:02,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1968124125, now seen corresponding path program 1 times [2023-08-27 02:45:02,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:45:02,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223496091] [2023-08-27 02:45:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:45:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:45:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:45:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:45:02,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:45:02,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223496091] [2023-08-27 02:45:02,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223496091] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:45:02,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118312277] [2023-08-27 02:45:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:45:02,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:45:02,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:45:02,842 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-27 02:45:02,844 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-27 02:45:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:45:02,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-27 02:45:02,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:45:02,997 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:45:02,998 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-27 02:45:03,133 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-27 02:45:03,169 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-27 02:45:03,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 21 treesize of output 20 [2023-08-27 02:45:03,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:03,258 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-27 02:45:03,323 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-27 02:45:03,323 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 23 treesize of output 26 [2023-08-27 02:45:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:45:03,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:45:03,624 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:45:03,624 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 57 treesize of output 48 [2023-08-27 02:45:03,639 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:45:03,640 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 2657 treesize of output 2623 [2023-08-27 02:45:03,662 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 490 treesize of output 458 [2023-08-27 02:45:03,680 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 612 treesize of output 588 [2023-08-27 02:45:04,182 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 24 treesize of output 20 [2023-08-27 02:45:04,247 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:45:04,247 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 408 treesize of output 384 [2023-08-27 02:45:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:45:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118312277] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:45:04,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:45:04,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-27 02:45:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435849174] [2023-08-27 02:45:04,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:45:04,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-27 02:45:04,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:45:04,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-27 02:45:04,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=650, Unknown=9, NotChecked=0, Total=812 [2023-08-27 02:45:04,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 485 [2023-08-27 02:45:04,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 169 transitions, 1414 flow. Second operand has 29 states, 29 states have (on average 177.6551724137931) internal successors, (5152), 29 states have internal predecessors, (5152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:45:04,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:45:04,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 485 [2023-08-27 02:45:04,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:45:05,340 INFO L124 PetriNetUnfolderBase]: 2389/4636 cut-off events. [2023-08-27 02:45:05,340 INFO L125 PetriNetUnfolderBase]: For 10157/10305 co-relation queries the response was YES. [2023-08-27 02:45:05,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17015 conditions, 4636 events. 2389/4636 cut-off events. For 10157/10305 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 31362 event pairs, 1271 based on Foata normal form. 14/4172 useless extension candidates. Maximal degree in co-relation 16977. Up to 3718 conditions per place. [2023-08-27 02:45:05,373 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 169 selfloop transitions, 30 changer transitions 3/208 dead transitions. [2023-08-27 02:45:05,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 208 transitions, 1967 flow [2023-08-27 02:45:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:45:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:45:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1144 transitions. [2023-08-27 02:45:05,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.393127147766323 [2023-08-27 02:45:05,375 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1144 transitions. [2023-08-27 02:45:05,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1144 transitions. [2023-08-27 02:45:05,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:45:05,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1144 transitions. [2023-08-27 02:45:05,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:45:05,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:45:05,380 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:45:05,380 INFO L175 Difference]: Start difference. First operand has 152 places, 169 transitions, 1414 flow. Second operand 6 states and 1144 transitions. [2023-08-27 02:45:05,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 208 transitions, 1967 flow [2023-08-27 02:45:05,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 208 transitions, 1777 flow, removed 54 selfloop flow, removed 10 redundant places. [2023-08-27 02:45:05,410 INFO L231 Difference]: Finished difference. Result has 147 places, 168 transitions, 1294 flow [2023-08-27 02:45:05,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1294, PETRI_PLACES=147, PETRI_TRANSITIONS=168} [2023-08-27 02:45:05,411 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 88 predicate places. [2023-08-27 02:45:05,411 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 168 transitions, 1294 flow [2023-08-27 02:45:05,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 177.6551724137931) internal successors, (5152), 29 states have internal predecessors, (5152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:45:05,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:45:05,412 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:45:05,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-27 02:45:05,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-27 02:45:05,617 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:45:05,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:45:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash -40465009, now seen corresponding path program 2 times [2023-08-27 02:45:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:45:05,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624374533] [2023-08-27 02:45:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:45:05,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:45:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:45:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:45:06,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:45:06,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624374533] [2023-08-27 02:45:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624374533] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:45:06,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602963074] [2023-08-27 02:45:06,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 02:45:06,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:45:06,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:45:06,475 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-27 02:45:06,478 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-27 02:45:06,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 02:45:06,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:45:06,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 77 conjunts are in the unsatisfiable core [2023-08-27 02:45:06,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:45:06,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:06,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:06,661 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:45:06,665 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-27 02:45:06,680 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:45:06,681 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-27 02:45:06,800 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-27 02:45:06,909 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-27 02:45:07,049 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 37 treesize of output 37 [2023-08-27 02:45:07,124 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 35 treesize of output 30 [2023-08-27 02:45:07,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:07,174 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 33 treesize of output 35 [2023-08-27 02:45:07,293 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 47 treesize of output 40 [2023-08-27 02:45:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:45:07,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:45:07,586 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (Array Int Int)) (v_ArrVal_780 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_780) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|)))) is different from false [2023-08-27 02:45:07,600 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (Array Int Int)) (v_ArrVal_780 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_776 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_776)) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_780) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_776)))) is different from false [2023-08-27 02:45:07,615 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (Array Int Int)) (v_ArrVal_780 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_776 Int)) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_775))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_776))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_780) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_776)))) is different from false [2023-08-27 02:45:07,741 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_780 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_776 Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse2 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_774)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_775))) (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1 v_ArrVal_776))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_776) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_780) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_774) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|))))) is different from false [2023-08-27 02:45:07,776 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_780 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_776 Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse2 v_ArrVal_774)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_775))) (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1 v_ArrVal_776))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_776) (< (+ (select .cse0 .cse2) 1) v_ArrVal_774) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_780) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|))))) is different from false [2023-08-27 02:45:07,806 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_ArrVal_772 Int) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_780 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_776 Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_772)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse2 v_ArrVal_774)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_775))) (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1 v_ArrVal_776))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_776) (< (+ (select .cse0 .cse2) 1) v_ArrVal_774) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_780) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|))))) is different from false [2023-08-27 02:45:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 02:45:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602963074] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:45:11,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:45:11,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 02:45:11,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395580215] [2023-08-27 02:45:11,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:45:11,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 02:45:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:45:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 02:45:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=612, Unknown=11, NotChecked=354, Total=1190 [2023-08-27 02:45:11,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:45:11,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 168 transitions, 1294 flow. Second operand has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:45:11,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:45:11,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:45:11,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:45:20,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:45:22,750 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-27 02:45:24,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:45:26,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:45:41,396 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-27 02:45:49,566 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-27 02:45:51,580 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-27 02:45:53,612 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-27 02:45:55,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:45:57,722 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-27 02:46:09,893 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-27 02:46:18,253 WARN L234 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 117 DAG size of output: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:46:20,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:46:22,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:46:24,307 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-27 02:46:26,348 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-27 02:46:28,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:46:40,544 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-27 02:46:45,198 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-27 02:46:47,237 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-27 02:46:49,288 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-27 02:46:56,232 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-27 02:46:58,245 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-27 02:47:00,576 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-27 02:47:02,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:47:04,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:47:06,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:47:08,723 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-27 02:47:10,856 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-27 02:47:12,883 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-27 02:47:13,184 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_778 (Array Int Int)) (v_ArrVal_780 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_776 Int)) (let ((.cse0 (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_775))) (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 v_ArrVal_776))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_780) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_776)))) (forall ((v_ArrVal_778 (Array Int Int)) (v_ArrVal_780 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_776 Int)) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_775))) (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 v_ArrVal_776))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (or (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4) 1) v_ArrVal_776) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_780) .cse1) 2147483647) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|)))))) is different from false [2023-08-27 02:47:15,208 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-27 02:47:17,251 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-27 02:47:19,272 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-27 02:47:21,304 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-27 02:47:23,359 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-27 02:47:25,400 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-27 02:47:27,421 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-27 02:47:29,481 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-27 02:47:31,556 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-27 02:47:33,575 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-27 02:47:35,596 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-27 02:47:37,665 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-27 02:47:38,037 INFO L124 PetriNetUnfolderBase]: 3382/6566 cut-off events. [2023-08-27 02:47:38,037 INFO L125 PetriNetUnfolderBase]: For 14017/14147 co-relation queries the response was YES. [2023-08-27 02:47:38,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23565 conditions, 6566 events. 3382/6566 cut-off events. For 14017/14147 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 47986 event pairs, 1285 based on Foata normal form. 23/5971 useless extension candidates. Maximal degree in co-relation 23530. Up to 3422 conditions per place. [2023-08-27 02:47:38,073 INFO L140 encePairwiseOnDemand]: 468/485 looper letters, 228 selfloop transitions, 120 changer transitions 3/357 dead transitions. [2023-08-27 02:47:38,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 357 transitions, 3383 flow [2023-08-27 02:47:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-27 02:47:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-27 02:47:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4772 transitions. [2023-08-27 02:47:38,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3784298176050753 [2023-08-27 02:47:38,080 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4772 transitions. [2023-08-27 02:47:38,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4772 transitions. [2023-08-27 02:47:38,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:47:38,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4772 transitions. [2023-08-27 02:47:38,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 183.53846153846155) internal successors, (4772), 26 states have internal predecessors, (4772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:47:38,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 485.0) internal successors, (13095), 27 states have internal predecessors, (13095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:47:38,095 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 485.0) internal successors, (13095), 27 states have internal predecessors, (13095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:47:38,096 INFO L175 Difference]: Start difference. First operand has 147 places, 168 transitions, 1294 flow. Second operand 26 states and 4772 transitions. [2023-08-27 02:47:38,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 357 transitions, 3383 flow [2023-08-27 02:47:38,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 357 transitions, 3341 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 02:47:38,131 INFO L231 Difference]: Finished difference. Result has 179 places, 236 transitions, 2244 flow [2023-08-27 02:47:38,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2244, PETRI_PLACES=179, PETRI_TRANSITIONS=236} [2023-08-27 02:47:38,131 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 120 predicate places. [2023-08-27 02:47:38,131 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 236 transitions, 2244 flow [2023-08-27 02:47:38,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:47:38,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:47:38,133 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:47:38,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-27 02:47:38,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-27 02:47:38,338 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:47:38,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:47:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 541353221, now seen corresponding path program 3 times [2023-08-27 02:47:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:47:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768580489] [2023-08-27 02:47:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:47:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:47:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:47:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:47:39,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:47:39,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768580489] [2023-08-27 02:47:39,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768580489] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:47:39,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94750629] [2023-08-27 02:47:39,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 02:47:39,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:47:39,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:47:39,033 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-27 02:47:39,034 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-27 02:47:39,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 02:47:39,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:47:39,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 80 conjunts are in the unsatisfiable core [2023-08-27 02:47:39,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:47:39,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:47:39,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:47:39,195 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2023-08-27 02:47:39,238 INFO L322 Elim1Store]: treesize reduction 37, result has 49.3 percent of original size [2023-08-27 02:47:39,239 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 67 [2023-08-27 02:47:39,397 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-27 02:47:39,525 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-27 02:47: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 44 treesize of output 37 [2023-08-27 02:47:39,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-08-27 02:47:39,798 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 33 treesize of output 35 [2023-08-27 02:47:39,891 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 47 treesize of output 40 [2023-08-27 02:47:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:47:39,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:47:40,068 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_882 Int) (v_ArrVal_880 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_882) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:47:40,078 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_882 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_879) |c_~#stored_elements~0.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_882) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:47:40,095 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_882 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_877)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_879) |c_~#stored_elements~0.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_877) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_882) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:47:40,108 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_882 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_877)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_879) |c_~#stored_elements~0.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_877) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_882) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 02:47:40,340 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_882 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_877 Int) (v_ArrVal_875 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_874)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_875) .cse2 v_ArrVal_877)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_879) |c_~#stored_elements~0.base| v_ArrVal_880) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_882) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_877) (< (+ (select .cse1 .cse3) 1) v_ArrVal_875))))) is different from false [2023-08-27 02:47:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 02:47:44,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94750629] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:47:44,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:47:44,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 02:47:44,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180010526] [2023-08-27 02:47:44,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:47:44,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 02:47:44,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:47:44,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 02:47:44,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=642, Unknown=12, NotChecked=300, Total=1190 [2023-08-27 02:47:44,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:47:44,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 236 transitions, 2244 flow. Second operand has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:47:44,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:47:44,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:47:44,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:47:47,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:48:01,287 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-27 02:48:10,022 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-27 02:48:12,506 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-27 02:48:16,400 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-27 02:48:18,561 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-27 02:48:20,568 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-27 02:48:23,273 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-27 02:48:24,722 INFO L124 PetriNetUnfolderBase]: 4545/8787 cut-off events. [2023-08-27 02:48:24,723 INFO L125 PetriNetUnfolderBase]: For 94786/95507 co-relation queries the response was YES. [2023-08-27 02:48:24,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45841 conditions, 8787 events. 4545/8787 cut-off events. For 94786/95507 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 68015 event pairs, 1487 based on Foata normal form. 37/7976 useless extension candidates. Maximal degree in co-relation 45796. Up to 3757 conditions per place. [2023-08-27 02:48:24,770 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 287 selfloop transitions, 187 changer transitions 3/483 dead transitions. [2023-08-27 02:48:24,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 483 transitions, 6422 flow [2023-08-27 02:48:24,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-27 02:48:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-27 02:48:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6250 transitions. [2023-08-27 02:48:24,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790175864160097 [2023-08-27 02:48:24,778 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 6250 transitions. [2023-08-27 02:48:24,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 6250 transitions. [2023-08-27 02:48:24,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:48:24,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 6250 transitions. [2023-08-27 02:48:24,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 183.8235294117647) internal successors, (6250), 34 states have internal predecessors, (6250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:48:24,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 485.0) internal successors, (16975), 35 states have internal predecessors, (16975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:48:24,798 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 485.0) internal successors, (16975), 35 states have internal predecessors, (16975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:48:24,798 INFO L175 Difference]: Start difference. First operand has 179 places, 236 transitions, 2244 flow. Second operand 34 states and 6250 transitions. [2023-08-27 02:48:24,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 483 transitions, 6422 flow [2023-08-27 02:48:24,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 483 transitions, 6198 flow, removed 101 selfloop flow, removed 4 redundant places. [2023-08-27 02:48:24,882 INFO L231 Difference]: Finished difference. Result has 219 places, 311 transitions, 3582 flow [2023-08-27 02:48:24,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=3582, PETRI_PLACES=219, PETRI_TRANSITIONS=311} [2023-08-27 02:48:24,883 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 160 predicate places. [2023-08-27 02:48:24,883 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 311 transitions, 3582 flow [2023-08-27 02:48:24,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:48:24,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:48:24,884 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:48:24,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-27 02:48:25,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-27 02:48:25,089 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:48:25,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:48:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 556475951, now seen corresponding path program 4 times [2023-08-27 02:48:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:48:25,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854283397] [2023-08-27 02:48:25,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:48:25,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:48:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:48:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:48:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:48:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854283397] [2023-08-27 02:48:25,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854283397] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:48:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771927084] [2023-08-27 02:48:25,987 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 02:48:25,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:48:25,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:48:25,989 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-27 02:48:25,993 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-27 02:48:26,147 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 02:48:26,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:48:26,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-27 02:48:26,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:48:26,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:48:26,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:48:26,176 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:48:26,177 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-27 02:48:26,194 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:48:26,194 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-27 02:48:26,295 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-27 02:48:26,379 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-27 02:48:26,513 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 44 treesize of output 37 [2023-08-27 02:48:26,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:48:26,581 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 33 treesize of output 35 [2023-08-27 02:48:26,682 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 47 treesize of output 40 [2023-08-27 02:48:26,856 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 38 treesize of output 40 [2023-08-27 02:48:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:48:27,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:48:28,078 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|)))) is different from false [2023-08-27 02:48:28,085 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 02:48:28,097 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_981) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|))))) is different from false [2023-08-27 02:48:28,110 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_981) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|)))))) is different from false [2023-08-27 02:48:28,137 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_978 Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_978) .cse1 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_981) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_978) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-27 02:48:28,232 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_981 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_978 Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_976 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_976)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_978) .cse3 v_ArrVal_981)) |c_~#stored_elements~0.base| v_ArrVal_982))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_978) (< (+ (select .cse1 .cse3) 1) v_ArrVal_981) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_984)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_985) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-27 02:48:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 02:48:30,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771927084] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:48:30,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:48:30,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 02:48:30,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338498077] [2023-08-27 02:48:30,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:48:30,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 02:48:30,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:48:30,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 02:48:30,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=597, Unknown=8, NotChecked=354, Total=1190 [2023-08-27 02:48:30,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:48:30,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 311 transitions, 3582 flow. Second operand has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:48:30,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:48:30,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:48:30,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:48:42,150 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-27 02:48:44,154 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-27 02:48:46,159 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-27 02:48:48,163 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-27 02:48:50,168 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-27 02:48:52,242 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-27 02:48:54,247 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-27 02:48:56,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 [0, 1] [2023-08-27 02:48:58,270 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-27 02:49:02,629 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-27 02:49:04,104 INFO L124 PetriNetUnfolderBase]: 4836/9274 cut-off events. [2023-08-27 02:49:04,104 INFO L125 PetriNetUnfolderBase]: For 221113/222355 co-relation queries the response was YES. [2023-08-27 02:49:04,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63120 conditions, 9274 events. 4836/9274 cut-off events. For 221113/222355 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 71585 event pairs, 1591 based on Foata normal form. 47/8427 useless extension candidates. Maximal degree in co-relation 63063. Up to 4413 conditions per place. [2023-08-27 02:49:04,256 INFO L140 encePairwiseOnDemand]: 463/485 looper letters, 236 selfloop transitions, 230 changer transitions 3/475 dead transitions. [2023-08-27 02:49:04,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 475 transitions, 8121 flow [2023-08-27 02:49:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-27 02:49:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-27 02:49:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4409 transitions. [2023-08-27 02:49:04,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787800687285223 [2023-08-27 02:49:04,262 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4409 transitions. [2023-08-27 02:49:04,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4409 transitions. [2023-08-27 02:49:04,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:49:04,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4409 transitions. [2023-08-27 02:49:04,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 183.70833333333334) internal successors, (4409), 24 states have internal predecessors, (4409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:04,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 485.0) internal successors, (12125), 25 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:04,275 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 485.0) internal successors, (12125), 25 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:04,275 INFO L175 Difference]: Start difference. First operand has 219 places, 311 transitions, 3582 flow. Second operand 24 states and 4409 transitions. [2023-08-27 02:49:04,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 475 transitions, 8121 flow [2023-08-27 02:49:04,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 475 transitions, 7257 flow, removed 387 selfloop flow, removed 12 redundant places. [2023-08-27 02:49:04,432 INFO L231 Difference]: Finished difference. Result has 240 places, 391 transitions, 5287 flow [2023-08-27 02:49:04,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2996, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5287, PETRI_PLACES=240, PETRI_TRANSITIONS=391} [2023-08-27 02:49:04,433 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 181 predicate places. [2023-08-27 02:49:04,433 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 391 transitions, 5287 flow [2023-08-27 02:49:04,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 176.37142857142857) internal successors, (6173), 35 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:04,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:49:04,434 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:49:04,439 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-27 02:49:04,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:49:04,634 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:49:04,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:49:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash 652400669, now seen corresponding path program 1 times [2023-08-27 02:49:04,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:49:04,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692101261] [2023-08-27 02:49:04,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:04,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:49:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:05,370 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-27 02:49:05,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:49:05,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692101261] [2023-08-27 02:49:05,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692101261] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:49:05,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070318104] [2023-08-27 02:49:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:05,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:49:05,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:49:05,371 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-27 02:49:05,377 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-27 02:49:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:05,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-27 02:49:05,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:49:05,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:05,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:05,560 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:49:05,560 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-27 02:49:05,574 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:49:05,574 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-27 02:49:05,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-27 02:49:05,708 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-27 02:49:05,810 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 44 treesize of output 37 [2023-08-27 02:49:05,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:05,861 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 33 treesize of output 35 [2023-08-27 02:49:05,906 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 33 treesize of output 35 [2023-08-27 02:49:06,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2023-08-27 02:49:06,080 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 43 treesize of output 38 [2023-08-27 02:49:06,304 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-27 02:49:06,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:49:06,409 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1091) .cse1) 2147483647)))) is different from false [2023-08-27 02:49:06,527 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1088 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1088)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1091) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1088) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)))) is different from false [2023-08-27 02:49:06,544 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1088 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1088)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1091) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1088) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|))))) is different from false [2023-08-27 02:49:06,648 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1085 Int) (v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1088 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1085) .cse1 v_ArrVal_1088)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1088) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1091) .cse3) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|))))) is different from false [2023-08-27 02:49:06,688 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (v_ArrVal_1085 Int) (v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1088 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1083)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1085) .cse3 v_ArrVal_1088)) |c_~#stored_elements~0.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1091) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1088))))) is different from false [2023-08-27 02:49:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-27 02:49:08,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070318104] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:49:08,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:49:08,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-08-27 02:49:08,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127771718] [2023-08-27 02:49:08,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:49:08,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 02:49:08,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:49:08,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 02:49:08,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=469, Unknown=7, NotChecked=260, Total=930 [2023-08-27 02:49:08,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 485 [2023-08-27 02:49:08,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 391 transitions, 5287 flow. Second operand has 31 states, 31 states have (on average 182.83870967741936) internal successors, (5668), 31 states have internal predecessors, (5668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:08,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:49:08,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 485 [2023-08-27 02:49:08,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:49:16,834 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1090 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1091 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1091) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1091 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1091) .cse1) 2147483647)))) (forall ((v_ArrVal_1090 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1091 Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_~#queue~0.base|))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1091) .cse1) 2147483647)))))) is different from false [2023-08-27 02:49:17,212 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1090 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_1091 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_1091) .cse1) 2147483647)))) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-27 02:49:22,779 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-27 02:49:23,861 INFO L124 PetriNetUnfolderBase]: 6219/12135 cut-off events. [2023-08-27 02:49:23,861 INFO L125 PetriNetUnfolderBase]: For 600955/601164 co-relation queries the response was YES. [2023-08-27 02:49:23,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102247 conditions, 12135 events. 6219/12135 cut-off events. For 600955/601164 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 99563 event pairs, 2136 based on Foata normal form. 164/11211 useless extension candidates. Maximal degree in co-relation 102184. Up to 4180 conditions per place. [2023-08-27 02:49:23,965 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 421 selfloop transitions, 222 changer transitions 3/652 dead transitions. [2023-08-27 02:49:23,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 652 transitions, 12165 flow [2023-08-27 02:49:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-27 02:49:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-27 02:49:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 5001 transitions. [2023-08-27 02:49:23,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3965900079302141 [2023-08-27 02:49:23,971 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 5001 transitions. [2023-08-27 02:49:23,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 5001 transitions. [2023-08-27 02:49:23,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:49:23,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 5001 transitions. [2023-08-27 02:49:23,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 192.34615384615384) internal successors, (5001), 26 states have internal predecessors, (5001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:23,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 485.0) internal successors, (13095), 27 states have internal predecessors, (13095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:23,986 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 485.0) internal successors, (13095), 27 states have internal predecessors, (13095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:23,986 INFO L175 Difference]: Start difference. First operand has 240 places, 391 transitions, 5287 flow. Second operand 26 states and 5001 transitions. [2023-08-27 02:49:23,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 652 transitions, 12165 flow [2023-08-27 02:49:24,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 652 transitions, 10870 flow, removed 583 selfloop flow, removed 11 redundant places. [2023-08-27 02:49:24,258 INFO L231 Difference]: Finished difference. Result has 265 places, 467 transitions, 6573 flow [2023-08-27 02:49:24,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=4252, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=6573, PETRI_PLACES=265, PETRI_TRANSITIONS=467} [2023-08-27 02:49:24,259 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 206 predicate places. [2023-08-27 02:49:24,259 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 467 transitions, 6573 flow [2023-08-27 02:49:24,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 182.83870967741936) internal successors, (5668), 31 states have internal predecessors, (5668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:24,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:49:24,260 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:49:24,265 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-27 02:49:24,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:49:24,460 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:49:24,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:49:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash -147603924, now seen corresponding path program 1 times [2023-08-27 02:49:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:49:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835967666] [2023-08-27 02:49:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:49:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:24,973 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-27 02:49:24,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:49:24,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835967666] [2023-08-27 02:49:24,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835967666] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:49:24,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914567703] [2023-08-27 02:49:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:24,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:49:24,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:49:24,977 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-27 02:49:24,979 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-27 02:49:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:25,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-27 02:49:25,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:49:25,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:25,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:25,170 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:49:25,170 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-27 02:49:25,186 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:49:25,187 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-27 02:49:25,282 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-27 02:49:25,350 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-27 02:49:25,481 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-27 02:49:25,524 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-27 02:49:25,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:25,566 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-27 02:49:25,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2023-08-27 02:49:25,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 62 treesize of output 57 [2023-08-27 02:49:25,755 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-27 02:49:25,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:49:25,898 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1200 Int) (v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1198) |c_~#stored_elements~0.base| v_ArrVal_1199) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_1200) .cse1)))))) is different from false [2023-08-27 02:49:26,109 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (v_ArrVal_1200 Int) (v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1192 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1192)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1194) .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1198) |c_~#stored_elements~0.base| v_ArrVal_1199) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_1200) .cse1)))))) is different from false [2023-08-27 02:49:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 02:49:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914567703] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:49:26,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:49:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2023-08-27 02:49:26,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325591522] [2023-08-27 02:49:26,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:49:26,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-27 02:49:26,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:49:26,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-27 02:49:26,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=533, Unknown=22, NotChecked=102, Total=812 [2023-08-27 02:49:26,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 485 [2023-08-27 02:49:26,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 467 transitions, 6573 flow. Second operand has 29 states, 29 states have (on average 181.9655172413793) internal successors, (5277), 29 states have internal predecessors, (5277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:26,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:49:26,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 485 [2023-08-27 02:49:26,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:49:33,606 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-27 02:49:39,423 INFO L124 PetriNetUnfolderBase]: 7122/13790 cut-off events. [2023-08-27 02:49:39,423 INFO L125 PetriNetUnfolderBase]: For 891819/894484 co-relation queries the response was YES. [2023-08-27 02:49:39,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128876 conditions, 13790 events. 7122/13790 cut-off events. For 891819/894484 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 115258 event pairs, 2269 based on Foata normal form. 265/12814 useless extension candidates. Maximal degree in co-relation 128802. Up to 3987 conditions per place. [2023-08-27 02:49:39,551 INFO L140 encePairwiseOnDemand]: 460/485 looper letters, 338 selfloop transitions, 307 changer transitions 3/654 dead transitions. [2023-08-27 02:49:39,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 654 transitions, 12498 flow [2023-08-27 02:49:39,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-27 02:49:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-27 02:49:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4590 transitions. [2023-08-27 02:49:39,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943298969072165 [2023-08-27 02:49:39,555 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4590 transitions. [2023-08-27 02:49:39,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4590 transitions. [2023-08-27 02:49:39,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:49:39,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4590 transitions. [2023-08-27 02:49:39,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 191.25) internal successors, (4590), 24 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:39,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 485.0) internal successors, (12125), 25 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:39,568 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 485.0) internal successors, (12125), 25 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:39,568 INFO L175 Difference]: Start difference. First operand has 265 places, 467 transitions, 6573 flow. Second operand 24 states and 4590 transitions. [2023-08-27 02:49:39,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 654 transitions, 12498 flow [2023-08-27 02:49:39,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 654 transitions, 11264 flow, removed 533 selfloop flow, removed 17 redundant places. [2023-08-27 02:49:39,966 INFO L231 Difference]: Finished difference. Result has 278 places, 524 transitions, 8185 flow [2023-08-27 02:49:39,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=5251, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8185, PETRI_PLACES=278, PETRI_TRANSITIONS=524} [2023-08-27 02:49:39,966 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 219 predicate places. [2023-08-27 02:49:39,966 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 524 transitions, 8185 flow [2023-08-27 02:49:39,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 181.9655172413793) internal successors, (5277), 29 states have internal predecessors, (5277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:39,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:49:39,967 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:49:39,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-27 02:49:40,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:49:40,172 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:49:40,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:49:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash -864116643, now seen corresponding path program 1 times [2023-08-27 02:49:40,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:49:40,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615720740] [2023-08-27 02:49:40,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:40,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:49:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:49:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:49:40,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615720740] [2023-08-27 02:49:40,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615720740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:49:40,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:49:40,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:49:40,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641766883] [2023-08-27 02:49:40,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:49:40,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:49:40,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:49:40,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:49:40,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:49:40,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:49:40,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 524 transitions, 8185 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:40,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:49:40,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:49:40,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:49:43,368 INFO L124 PetriNetUnfolderBase]: 6893/13514 cut-off events. [2023-08-27 02:49:43,369 INFO L125 PetriNetUnfolderBase]: For 928507/931204 co-relation queries the response was YES. [2023-08-27 02:49:43,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131024 conditions, 13514 events. 6893/13514 cut-off events. For 928507/931204 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 114345 event pairs, 3496 based on Foata normal form. 61/12527 useless extension candidates. Maximal degree in co-relation 130945. Up to 12534 conditions per place. [2023-08-27 02:49:43,495 INFO L140 encePairwiseOnDemand]: 483/485 looper letters, 481 selfloop transitions, 1 changer transitions 3/516 dead transitions. [2023-08-27 02:49:43,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 516 transitions, 9129 flow [2023-08-27 02:49:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:49:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:49:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 740 transitions. [2023-08-27 02:49:43,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085910652920962 [2023-08-27 02:49:43,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 740 transitions. [2023-08-27 02:49:43,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 740 transitions. [2023-08-27 02:49:43,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:49:43,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 740 transitions. [2023-08-27 02:49:43,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:43,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:43,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:43,499 INFO L175 Difference]: Start difference. First operand has 278 places, 524 transitions, 8185 flow. Second operand 3 states and 740 transitions. [2023-08-27 02:49:43,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 516 transitions, 9129 flow [2023-08-27 02:49:44,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 516 transitions, 8130 flow, removed 428 selfloop flow, removed 13 redundant places. [2023-08-27 02:49:44,054 INFO L231 Difference]: Finished difference. Result has 266 places, 508 transitions, 6936 flow [2023-08-27 02:49:44,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=6934, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=6936, PETRI_PLACES=266, PETRI_TRANSITIONS=508} [2023-08-27 02:49:44,054 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 207 predicate places. [2023-08-27 02:49:44,054 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 508 transitions, 6936 flow [2023-08-27 02:49:44,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:44,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:49:44,055 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:49:44,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-27 02:49:44,055 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:49:44,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:49:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash -113573207, now seen corresponding path program 1 times [2023-08-27 02:49:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:49:44,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941096670] [2023-08-27 02:49:44,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:44,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:49:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 02:49:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:49:44,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941096670] [2023-08-27 02:49:44,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941096670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:49:44,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:49:44,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:49:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547063929] [2023-08-27 02:49:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:49:44,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:49:44,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:49:44,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:49:44,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:49:44,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:49:44,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 508 transitions, 6936 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:44,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:49:44,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:49:44,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:49:46,923 INFO L124 PetriNetUnfolderBase]: 6706/13264 cut-off events. [2023-08-27 02:49:46,923 INFO L125 PetriNetUnfolderBase]: For 886429/890697 co-relation queries the response was YES. [2023-08-27 02:49:46,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123355 conditions, 13264 events. 6706/13264 cut-off events. For 886429/890697 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 113041 event pairs, 3656 based on Foata normal form. 158/12384 useless extension candidates. Maximal degree in co-relation 123278. Up to 8932 conditions per place. [2023-08-27 02:49:47,046 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 410 selfloop transitions, 61 changer transitions 0/502 dead transitions. [2023-08-27 02:49:47,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 502 transitions, 7890 flow [2023-08-27 02:49:47,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:49:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:49:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2023-08-27 02:49:47,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5065292096219931 [2023-08-27 02:49:47,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 737 transitions. [2023-08-27 02:49:47,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 737 transitions. [2023-08-27 02:49:47,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:49:47,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 737 transitions. [2023-08-27 02:49:47,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:47,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:47,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:47,051 INFO L175 Difference]: Start difference. First operand has 266 places, 508 transitions, 6936 flow. Second operand 3 states and 737 transitions. [2023-08-27 02:49:47,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 502 transitions, 7890 flow [2023-08-27 02:49:47,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 502 transitions, 7873 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-27 02:49:47,441 INFO L231 Difference]: Finished difference. Result has 266 places, 491 transitions, 6786 flow [2023-08-27 02:49:47,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=6664, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=6786, PETRI_PLACES=266, PETRI_TRANSITIONS=491} [2023-08-27 02:49:47,442 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 207 predicate places. [2023-08-27 02:49:47,442 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 491 transitions, 6786 flow [2023-08-27 02:49:47,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:47,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:49:47,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:49:47,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-27 02:49:47,442 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:49:47,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:49:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash -286124216, now seen corresponding path program 1 times [2023-08-27 02:49:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:49:47,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77407194] [2023-08-27 02:49:47,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:47,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:49:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:47,487 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-27 02:49:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:49:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77407194] [2023-08-27 02:49:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77407194] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:49:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579784498] [2023-08-27 02:49:47,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:47,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:49:47,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:49:47,489 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-27 02:49:47,492 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-27 02:49:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:47,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 02:49:47,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:49:47,645 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-27 02:49:47,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:49:47,667 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-27 02:49:47,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579784498] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:49:47,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:49:47,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-27 02:49:47,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964222119] [2023-08-27 02:49:47,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:49:47,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 02:49:47,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:49:47,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 02:49:47,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 02:49:47,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:49:47,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 491 transitions, 6786 flow. Second operand has 7 states, 7 states have (on average 233.71428571428572) internal successors, (1636), 7 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:47,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:49:47,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:49:47,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:49:49,549 INFO L124 PetriNetUnfolderBase]: 4302/8413 cut-off events. [2023-08-27 02:49:49,549 INFO L125 PetriNetUnfolderBase]: For 635406/638892 co-relation queries the response was YES. [2023-08-27 02:49:49,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97295 conditions, 8413 events. 4302/8413 cut-off events. For 635406/638892 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 57882 event pairs, 1682 based on Foata normal form. 336/8341 useless extension candidates. Maximal degree in co-relation 97218. Up to 2830 conditions per place. [2023-08-27 02:49:49,641 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 510 selfloop transitions, 36 changer transitions 0/577 dead transitions. [2023-08-27 02:49:49,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 577 transitions, 9765 flow [2023-08-27 02:49:49,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:49:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:49:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1464 transitions. [2023-08-27 02:49:49,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030927835051546 [2023-08-27 02:49:49,644 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1464 transitions. [2023-08-27 02:49:49,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1464 transitions. [2023-08-27 02:49:49,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:49:49,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1464 transitions. [2023-08-27 02:49:49,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:49,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:49,647 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:49,647 INFO L175 Difference]: Start difference. First operand has 266 places, 491 transitions, 6786 flow. Second operand 6 states and 1464 transitions. [2023-08-27 02:49:49,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 577 transitions, 9765 flow [2023-08-27 02:49:49,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 577 transitions, 9657 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-08-27 02:49:50,036 INFO L231 Difference]: Finished difference. Result has 274 places, 489 transitions, 6886 flow [2023-08-27 02:49:50,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=6515, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6886, PETRI_PLACES=274, PETRI_TRANSITIONS=489} [2023-08-27 02:49:50,037 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 215 predicate places. [2023-08-27 02:49:50,037 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 489 transitions, 6886 flow [2023-08-27 02:49:50,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 233.71428571428572) internal successors, (1636), 7 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:49:50,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:49:50,038 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:49:50,042 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-27 02:49:50,238 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,SelfDestructingSolverStorable22 [2023-08-27 02:49:50,238 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:49:50,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:49:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash -622793095, now seen corresponding path program 1 times [2023-08-27 02:49:50,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:49:50,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468305926] [2023-08-27 02:49:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:49:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:49:51,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:49:51,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468305926] [2023-08-27 02:49:51,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468305926] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:49:51,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911959049] [2023-08-27 02:49:51,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:49:51,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:49:51,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:49:51,760 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-27 02:49:51,762 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-27 02:49:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:49:51,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 96 conjunts are in the unsatisfiable core [2023-08-27 02:49:51,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:49:51,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:51,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:51,936 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:49:51,937 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-27 02:49:51,950 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:49:51,951 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-27 02:49:52,045 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-27 02:49:52,167 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-27 02:49:52,334 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 44 treesize of output 37 [2023-08-27 02:49:52,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:52,418 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 33 treesize of output 35 [2023-08-27 02:49:52,524 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 47 treesize of output 40 [2023-08-27 02:49:52,731 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 52 treesize of output 45 [2023-08-27 02:49:53,268 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 43 [2023-08-27 02:49:53,554 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 55 treesize of output 48 [2023-08-27 02:49:54,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:49:54,156 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 44 treesize of output 46 [2023-08-27 02:49:54,844 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 58 treesize of output 51 [2023-08-27 02:49:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:49:59,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:49:59,481 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1493) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:49:59,612 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1493)))))) is different from false [2023-08-27 02:49:59,638 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1491)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1491) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1493) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-27 02:49:59,667 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1491)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse2 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1491) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1493) (< (select .cse4 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-08-27 02:49:59,697 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1489 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1489)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1491)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1491) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1493))))))) is different from false [2023-08-27 02:49:59,728 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1489 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1489)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1491)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1493) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1491) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)))))))) is different from false [2023-08-27 02:49:59,762 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1489 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1487))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1489)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1491)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1493) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1491) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) .cse3) 2147483647))))))))) is different from false [2023-08-27 02:49:59,801 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1485 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1489 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1485)) |c_~#stored_elements~0.base| v_ArrVal_1487))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1489)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1491)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1491) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1485) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) .cse1) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1493) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|))))))))) is different from false [2023-08-27 02:49:59,845 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1485 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1489 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1485)) |c_~#stored_elements~0.base| v_ArrVal_1487))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1489)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1491)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1491) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) .cse1) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1493) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1485) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)))))))))) is different from false [2023-08-27 02:49:59,935 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1484 Int) (v_ArrVal_1485 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1489 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1484) .cse7 v_ArrVal_1485)) |c_~#stored_elements~0.base| v_ArrVal_1487))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1489)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1491)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1491) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1484) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1493) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1485) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)))))))))) is different from false [2023-08-27 02:49:59,984 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1484 Int) (v_ArrVal_1485 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1489 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1484) .cse8 v_ArrVal_1485)) |c_~#stored_elements~0.base| v_ArrVal_1487))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1489)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1491)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store .cse7 .cse3 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1491) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) .cse1) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1484) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1493) (< (+ (select .cse5 .cse8) 1) v_ArrVal_1485) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)))))))))) is different from false [2023-08-27 02:50:00,028 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1495 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int) (v_ArrVal_1491 Int) (v_ArrVal_1482 Int) (v_ArrVal_1493 Int) (v_ArrVal_1484 Int) (v_ArrVal_1485 Int) (v_ArrVal_1496 Int) (v_ArrVal_1489 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1482)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1484) .cse7 v_ArrVal_1485)) |c_~#stored_elements~0.base| v_ArrVal_1487))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1489)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1491)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store .cse8 .cse6 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1491) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1484) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|) (< (select .cse0 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (+ (select .cse3 .cse7) 1) v_ArrVal_1485) (< (+ (select .cse8 .cse6) 1) v_ArrVal_1493)))))))))) is different from false [2023-08-27 02:50:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-08-27 02:50:06,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911959049] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:50:06,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:50:06,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2023-08-27 02:50:06,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411430975] [2023-08-27 02:50:06,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:50:06,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-27 02:50:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:50:06,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-27 02:50:06,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=1278, Unknown=21, NotChecked=1092, Total=2862 [2023-08-27 02:50:06,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:50:06,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 489 transitions, 6886 flow. Second operand has 54 states, 54 states have (on average 176.38888888888889) internal successors, (9525), 54 states have internal predecessors, (9525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:50:06,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:50:06,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:50:06,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:50:22,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 02:50:32,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 02:50:37,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 02:50:41,873 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-27 02:50:43,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:50:45,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:50:47,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:50:49,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:50:51,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:50:53,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:50:55,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:50:58,283 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-27 02:51:10,637 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-27 02:51:17,415 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-27 02:51:19,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:51:21,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:51:23,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:51:25,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:51:27,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:51:29,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:51:31,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:51:33,585 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-27 02:51:48,108 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-27 02:51:50,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:51:52,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:51:54,281 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-27 02:51:56,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:51:58,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:52:00,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:52:02,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:52:04,322 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-27 02:52:06,333 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-27 02:52:09,489 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-27 02:52:11,494 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-27 02:52:13,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:52:26,420 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-27 02:52:56,261 WARN L234 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 164 DAG size of output: 163 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:52:58,287 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-27 02:53:00,325 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-27 02:53:02,336 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-27 02:53:04,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:53:06,767 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-27 02:53:08,773 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-27 02:53:15,433 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-27 02:53:16,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:53:41,467 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-27 02:53:43,576 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-27 02:54:13,368 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-27 02:54:15,376 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-27 02:54:17,386 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-27 02:54:19,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-27 02:54:21,409 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-27 02:54:23,417 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-27 02:54:23,792 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1493)))))) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1485 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1496 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1489 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (v_ArrVal_1492 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92| Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse9 .cse4 v_ArrVal_1485)) |c_~#stored_elements~0.base| v_ArrVal_1487))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (let ((.cse6 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)) v_ArrVal_1489))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store .cse6 .cse2 v_ArrVal_1491)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1492))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (select (store (store .cse11 |c_~#queue~0.base| (store .cse8 .cse1 v_ArrVal_1493)) |c_~#stored_elements~0.base| v_ArrVal_1495) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse2) 1) v_ArrVal_1491) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) v_ArrVal_1496) .cse2) 2147483647) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1493) (< (+ (select .cse9 .cse4) 1) v_ArrVal_1485) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_92|)))))))))))) is different from false [2023-08-27 02:54:25,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:54:27,879 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-27 02:54:29,914 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-27 02:54:31,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:54:33,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:54:35,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 [0, 1] [2023-08-27 02:54:59,439 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-27 02:55:01,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:55:03,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:55:06,062 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-27 02:55:08,070 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-27 02:55:10,079 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-27 02:55:19,000 INFO L124 PetriNetUnfolderBase]: 5344/10447 cut-off events. [2023-08-27 02:55:19,000 INFO L125 PetriNetUnfolderBase]: For 784604/788463 co-relation queries the response was YES. [2023-08-27 02:55:19,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125442 conditions, 10447 events. 5344/10447 cut-off events. For 784604/788463 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 74659 event pairs, 1648 based on Foata normal form. 180/10202 useless extension candidates. Maximal degree in co-relation 125361. Up to 4937 conditions per place. [2023-08-27 02:55:19,149 INFO L140 encePairwiseOnDemand]: 466/485 looper letters, 343 selfloop transitions, 522 changer transitions 3/874 dead transitions. [2023-08-27 02:55:19,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 874 transitions, 20945 flow [2023-08-27 02:55:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-08-27 02:55:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-08-27 02:55:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 9996 transitions. [2023-08-27 02:55:19,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37473289597000936 [2023-08-27 02:55:19,159 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 9996 transitions. [2023-08-27 02:55:19,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 9996 transitions. [2023-08-27 02:55:19,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:55:19,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 9996 transitions. [2023-08-27 02:55:19,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 181.74545454545455) internal successors, (9996), 55 states have internal predecessors, (9996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:55:19,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 485.0) internal successors, (27160), 56 states have internal predecessors, (27160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:55:19,188 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 485.0) internal successors, (27160), 56 states have internal predecessors, (27160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:55:19,188 INFO L175 Difference]: Start difference. First operand has 274 places, 489 transitions, 6886 flow. Second operand 55 states and 9996 transitions. [2023-08-27 02:55:19,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 874 transitions, 20945 flow [2023-08-27 02:55:19,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 874 transitions, 20892 flow, removed 23 selfloop flow, removed 1 redundant places. [2023-08-27 02:55:19,735 INFO L231 Difference]: Finished difference. Result has 357 places, 734 transitions, 15344 flow [2023-08-27 02:55:19,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=6855, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=293, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=15344, PETRI_PLACES=357, PETRI_TRANSITIONS=734} [2023-08-27 02:55:19,736 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 298 predicate places. [2023-08-27 02:55:19,736 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 734 transitions, 15344 flow [2023-08-27 02:55:19,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 176.38888888888889) internal successors, (9525), 54 states have internal predecessors, (9525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:55:19,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:55:19,738 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 02:55:19,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-27 02:55:19,938 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,SelfDestructingSolverStorable23 [2023-08-27 02:55:19,938 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:55:19,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:55:19,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1534980110, now seen corresponding path program 5 times [2023-08-27 02:55:19,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:55:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684737253] [2023-08-27 02:55:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:55:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:55:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:55:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:55:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:55:21,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684737253] [2023-08-27 02:55:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684737253] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:55:21,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835798378] [2023-08-27 02:55:21,270 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 02:55:21,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:55:21,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:55:21,271 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-27 02:55:21,273 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-27 02:55:21,450 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-27 02:55:21,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:55:21,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 106 conjunts are in the unsatisfiable core [2023-08-27 02:55:21,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:55:21,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:55:21,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:55:21,483 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:55:21,484 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-27 02:55:21,498 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:55:21,498 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-27 02:55:21,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-08-27 02:55:21,735 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2023-08-27 02:55:21,886 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 42 treesize of output 35 [2023-08-27 02:55:21,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:55:21,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-08-27 02:55:22,054 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 45 treesize of output 38 [2023-08-27 02:55:22,203 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 50 treesize of output 43 [2023-08-27 02:55:22,433 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 53 treesize of output 46 [2023-08-27 02:55:22,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:55:22,615 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 42 treesize of output 44 [2023-08-27 02:55:22,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 49 treesize of output 49 [2023-08-27 02:55:22,904 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 56 treesize of output 49 [2023-08-27 02:55:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:55:31,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:55:31,052 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1622 Int)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1621) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1622) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-27 02:55:31,061 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1622 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1621) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) |c_~#queue~0.offset|) v_ArrVal_1622) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|))) is different from false [2023-08-27 02:55:31,070 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1622 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1620))) (or (< (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1621) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) |c_~#queue~0.offset|) v_ArrVal_1622) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:55:31,342 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1616 Int) (v_ArrVal_1618 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1622 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1616) .cse2 v_ArrVal_1618)) |c_~#stored_elements~0.base| v_ArrVal_1620))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1616) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1618) (< (select (store (select (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1621) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) |c_~#queue~0.offset|) v_ArrVal_1622) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select (select .cse3 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|))))) is different from false [2023-08-27 02:55:35,035 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1616 Int) (v_ArrVal_1613 (Array Int Int)) (v_ArrVal_1618 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1622 Int) (v_ArrVal_1614 Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1613))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1614)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1616) .cse1 v_ArrVal_1618)) |c_~#stored_elements~0.base| v_ArrVal_1620))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1618) (< (select (store (select (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1621) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) |c_~#queue~0.offset|) v_ArrVal_1622) .cse3) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1616) (< (select (select .cse2 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|))))))) is different from false [2023-08-27 02:55:35,076 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1616 Int) (v_ArrVal_1613 (Array Int Int)) (v_ArrVal_1618 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1622 Int) (v_ArrVal_1612 Int) (v_ArrVal_1614 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1612)) |c_~#stored_elements~0.base| v_ArrVal_1613))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1614)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1616) .cse1 v_ArrVal_1618)) |c_~#stored_elements~0.base| v_ArrVal_1620))) (or (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1612) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1621) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) |c_~#queue~0.offset|) v_ArrVal_1622) .cse3) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1618) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1616))))))) is different from false [2023-08-27 02:55:35,112 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1616 Int) (v_ArrVal_1613 (Array Int Int)) (v_ArrVal_1618 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1622 Int) (v_ArrVal_1612 Int) (v_ArrVal_1614 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1612)) |c_~#stored_elements~0.base| v_ArrVal_1613))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1614)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1616) .cse3 v_ArrVal_1618)) |c_~#stored_elements~0.base| v_ArrVal_1620))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1612) (< (select (select .cse2 |c_~#queue~0.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|) (< (select (store (select (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1621) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) |c_~#queue~0.offset|) v_ArrVal_1622) .cse5) 2147483647) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1618) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1616)))))))) is different from false [2023-08-27 02:55:35,149 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= 800 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1616 Int) (v_ArrVal_1613 (Array Int Int)) (v_ArrVal_1618 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1622 Int) (v_ArrVal_1612 Int) (v_ArrVal_1614 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1612)) |c_~#stored_elements~0.base| v_ArrVal_1613))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1614)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1616) .cse2 v_ArrVal_1618)) |c_~#stored_elements~0.base| v_ArrVal_1620))) (or (< (+ .cse0 1) v_ArrVal_1612) (< (select (select .cse1 |c_~#queue~0.base|) .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|) (< (select (store (select (store .cse1 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1621) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) |c_~#queue~0.offset|) v_ArrVal_1622) .cse4) 2147483647) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1618) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1616)))))))))) is different from false [2023-08-27 02:55:35,198 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse7 .cse8))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1616 Int) (v_ArrVal_1613 (Array Int Int)) (v_ArrVal_1618 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1609 Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1622 Int) (v_ArrVal_1612 Int) (v_ArrVal_1614 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1609) .cse8 v_ArrVal_1612)) |c_~#stored_elements~0.base| v_ArrVal_1613))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1614)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1616) .cse1 v_ArrVal_1618)) |c_~#stored_elements~0.base| v_ArrVal_1620))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1618) (< (+ .cse2 1) v_ArrVal_1612) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1609) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1616) (< (select (select .cse5 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) (< (select (store (select (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1621) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) |c_~#queue~0.offset|) v_ArrVal_1622) .cse4) 2147483647))))))) (= 800 .cse2)))) is different from false [2023-08-27 02:55:35,249 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse6 .cse9))) (or (= 800 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1616 Int) (v_ArrVal_1613 (Array Int Int)) (v_ArrVal_1618 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1609 Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1622 Int) (v_ArrVal_1612 Int) (v_ArrVal_1614 Int)) (let ((.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1609) .cse9 v_ArrVal_1612)) |c_~#stored_elements~0.base| v_ArrVal_1613))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse1 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1614)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (store (store .cse1 .cse4 v_ArrVal_1616) .cse2 v_ArrVal_1618)) |c_~#stored_elements~0.base| v_ArrVal_1620))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_1618) (< (+ .cse0 1) v_ArrVal_1612) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|) (< (+ (select .cse1 .cse4) 1) v_ArrVal_1616) (< (select (select .cse5 |c_~#queue~0.base|) .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1609) (< (select (store (select (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1621) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) |c_~#queue~0.offset|) v_ArrVal_1622) .cse4) 2147483647))))))))))) is different from false [2023-08-27 02:55:35,308 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1616 Int) (v_ArrVal_1613 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1618 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98| Int) (v_ArrVal_1609 Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1622 Int) (v_ArrVal_1612 Int) (v_ArrVal_1614 Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1607)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1609) .cse8 v_ArrVal_1612)) |c_~#stored_elements~0.base| v_ArrVal_1613))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1614)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1616) .cse1 v_ArrVal_1618)) |c_~#stored_elements~0.base| v_ArrVal_1620)) (.cse4 (select .cse6 .cse8))) (or (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1618) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1621) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) |c_~#queue~0.offset|) v_ArrVal_1622) .cse3) 2147483647) (= 800 .cse4) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1616) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1609) (< (+ .cse4 1) v_ArrVal_1612)))))))) is different from false [2023-08-27 02:55:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2023-08-27 02:55:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835798378] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:55:41,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:55:41,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 55 [2023-08-27 02:55:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451581490] [2023-08-27 02:55:41,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:55:41,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-08-27 02:55:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:55:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-08-27 02:55:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1614, Unknown=28, NotChecked=1078, Total=3192 [2023-08-27 02:55:41,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 485 [2023-08-27 02:55:41,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 734 transitions, 15344 flow. Second operand has 57 states, 57 states have (on average 170.26315789473685) internal successors, (9705), 57 states have internal predecessors, (9705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 02:55:41,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:55:41,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 485 [2023-08-27 02:55:41,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:56:01,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 02:56:06,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 02:56:16,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 02:56:23,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 02:56:37,810 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-27 02:56:39,817 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-27 02:56:42,118 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-27 02:57:08,316 WARN L234 SmtUtils]: Spent 16.64s on a formula simplification. DAG size of input: 217 DAG size of output: 97 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:57:21,177 WARN L234 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 124 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:57:27,522 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-27 02:57:29,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 [1] [2023-08-27 02:57:31,654 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-27 02:57:33,721 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-27 02:57:35,733 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-27 02:57:45,750 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-27 02:57:48,011 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-27 02:57:50,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Received shutdown request... [2023-08-27 02:58:07,775 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-27 02:58:07,793 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 02:58:08,802 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-27 02:58:08,976 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-27 02:58:09,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-27 02:58:09,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-27 02:58:09,040 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-27 02:58:09,042 INFO L158 Benchmark]: Toolchain (without parser) took 846370.15ms. Allocated memory was 356.5MB in the beginning and 7.8GB in the end (delta: 7.5GB). Free memory was 331.1MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 5.0GB. Max. memory is 16.0GB. [2023-08-27 02:58:09,043 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 356.5MB. Free memory is still 332.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 02:58:09,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.05ms. Allocated memory is still 356.5MB. Free memory was 331.1MB in the beginning and 300.9MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-27 02:58:09,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.37ms. Allocated memory is still 356.5MB. Free memory was 300.9MB in the beginning and 298.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 02:58:09,043 INFO L158 Benchmark]: Boogie Preprocessor took 29.63ms. Allocated memory is still 356.5MB. Free memory was 298.2MB in the beginning and 296.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 02:58:09,043 INFO L158 Benchmark]: RCFGBuilder took 513.27ms. Allocated memory is still 356.5MB. Free memory was 296.1MB in the beginning and 324.9MB in the end (delta: -28.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.0GB. [2023-08-27 02:58:09,043 INFO L158 Benchmark]: TraceAbstraction took 845204.80ms. Allocated memory was 356.5MB in the beginning and 7.8GB in the end (delta: 7.5GB). Free memory was 324.0MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 5.0GB. Max. memory is 16.0GB. [2023-08-27 02:58:09,044 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2023-08-27 02:58:09,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 356.5MB. Free memory is still 332.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 562.05ms. Allocated memory is still 356.5MB. Free memory was 331.1MB in the beginning and 300.9MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.37ms. Allocated memory is still 356.5MB. Free memory was 300.9MB in the beginning and 298.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.63ms. Allocated memory is still 356.5MB. Free memory was 298.2MB in the beginning and 296.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 513.27ms. Allocated memory is still 356.5MB. Free memory was 296.1MB in the beginning and 324.9MB in the end (delta: -28.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.0GB. * TraceAbstraction took 845204.80ms. Allocated memory was 356.5MB in the beginning and 7.8GB in the end (delta: 7.5GB). Free memory was 324.0MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 5.0GB. 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: 7.3s, 229 PlacesBefore, 59 PlacesAfterwards, 237 TransitionsBefore, 59 TransitionsAfterwards, 14312 CoEnabledTransitionPairs, 9 FixpointIterations, 68 TrivialSequentialCompositions, 134 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 18 ConcurrentYvCompositions, 8 ChoiceCompositions, 237 TotalNumberOfCompositions, 33711 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15553, independent: 14894, independent conditional: 0, independent unconditional: 14894, dependent: 659, dependent conditional: 0, dependent unconditional: 659, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7952, independent: 7855, independent conditional: 0, independent unconditional: 7855, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15553, independent: 7039, independent conditional: 0, independent unconditional: 7039, dependent: 562, dependent conditional: 0, dependent unconditional: 562, unknown: 7952, unknown conditional: 0, unknown unconditional: 7952] , Statistics on independence cache: Total cache size (in pairs): 375, Positive cache size: 336, Positive conditional cache size: 0, Positive unconditional cache size: 336, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown