/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.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 02:42:40,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 02:42:40,282 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:42:40,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 02:42:40,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 02:42:40,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 02:42:40,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 02:42:40,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 02:42:40,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 02:42:40,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 02:42:40,316 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 02:42:40,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 02:42:40,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 02:42:40,316 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 02:42:40,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 02:42:40,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 02:42:40,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 02:42:40,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 02:42:40,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 02:42:40,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 02:42:40,318 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 02:42:40,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 02:42:40,321 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 02:42:40,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 02:42:40,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 02:42:40,322 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 02:42:40,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 02:42:40,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 02:42:40,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 02:42:40,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 02:42:40,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 02:42:40,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 02:42:40,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 02:42:40,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 02:42:40,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 02:42:40,324 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:42:40,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 02:42:40,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 02:42:40,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 02:42:40,599 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 02:42:40,599 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 02:42:40,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-08-27 02:42:41,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 02:42:41,748 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 02:42:41,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-08-27 02:42:41,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68fbd7037/3d59cc3977d946fdb93773d83901fe4a/FLAG0b4cf21aa [2023-08-27 02:42:41,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68fbd7037/3d59cc3977d946fdb93773d83901fe4a [2023-08-27 02:42:41,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 02:42:41,769 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 02:42:41,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 02:42:41,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 02:42:41,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 02:42:41,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:42:41" (1/1) ... [2023-08-27 02:42:41,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a79ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:41, skipping insertion in model container [2023-08-27 02:42:41,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:42:41" (1/1) ... [2023-08-27 02:42:41,800 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 02:42:42,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 02:42:42,098 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 02:42:42,120 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-27 02:42:42,121 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-27 02:42:42,126 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-27 02:42:42,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 02:42:42,194 INFO L206 MainTranslator]: Completed translation [2023-08-27 02:42:42,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:42 WrapperNode [2023-08-27 02:42:42,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 02:42:42,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 02:42:42,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 02:42:42,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 02:42:42,202 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:42:42" (1/1) ... [2023-08-27 02:42:42,222 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:42:42" (1/1) ... [2023-08-27 02:42:42,249 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 221 [2023-08-27 02:42:42,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 02:42:42,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 02:42:42,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 02:42:42,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 02:42:42,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:42" (1/1) ... [2023-08-27 02:42:42,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:42" (1/1) ... [2023-08-27 02:42:42,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:42" (1/1) ... [2023-08-27 02:42:42,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:42" (1/1) ... [2023-08-27 02:42:42,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:42" (1/1) ... [2023-08-27 02:42:42,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:42" (1/1) ... [2023-08-27 02:42:42,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:42" (1/1) ... [2023-08-27 02:42:42,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:42" (1/1) ... [2023-08-27 02:42:42,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 02:42:42,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 02:42:42,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 02:42:42,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 02:42:42,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:42" (1/1) ... [2023-08-27 02:42:42,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 02:42:42,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:42:42,323 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:42:42,339 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:42:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-27 02:42:42,348 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-27 02:42:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-27 02:42:42,348 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-27 02:42:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 02:42:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 02:42:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 02:42:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 02:42:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-27 02:42:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 02:42:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 02:42:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 02:42:42,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 02:42:42,350 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:42:42,443 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 02:42:42,445 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 02:42:42,674 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 02:42:42,680 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 02:42:42,681 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-27 02:42:42,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:42:42 BoogieIcfgContainer [2023-08-27 02:42:42,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 02:42:42,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 02:42:42,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 02:42:42,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 02:42:42,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 02:42:41" (1/3) ... [2023-08-27 02:42:42,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c4814a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 02:42:42, skipping insertion in model container [2023-08-27 02:42:42,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:42:42" (2/3) ... [2023-08-27 02:42:42,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c4814a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 02:42:42, skipping insertion in model container [2023-08-27 02:42:42,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:42:42" (3/3) ... [2023-08-27 02:42:42,687 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-08-27 02:42:42,698 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 02:42:42,698 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-27 02:42:42,698 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 02:42:42,813 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-27 02:42:42,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 248 transitions, 512 flow [2023-08-27 02:42:42,934 INFO L124 PetriNetUnfolderBase]: 15/246 cut-off events. [2023-08-27 02:42:42,934 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 02:42:42,942 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:42:42,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 248 transitions, 512 flow [2023-08-27 02:42:42,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 237 transitions, 483 flow [2023-08-27 02:42:42,952 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 02:42:42,959 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-27 02:42:42,961 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-27 02:42:42,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 237 transitions, 483 flow [2023-08-27 02:42:43,028 INFO L124 PetriNetUnfolderBase]: 15/237 cut-off events. [2023-08-27 02:42:43,028 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 02:42:43,032 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:42:43,036 INFO L119 LiptonReduction]: Number of co-enabled transitions 14312 [2023-08-27 02:42:49,389 INFO L134 LiptonReduction]: Checked pairs total: 33711 [2023-08-27 02:42:49,389 INFO L136 LiptonReduction]: Total number of compositions: 237 [2023-08-27 02:42:49,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 02:42:49,402 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;@4f88c4f5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 02:42:49,402 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-08-27 02:42:49,403 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 02:42:49,403 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-27 02:42:49,403 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 02:42:49,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:49,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-27 02:42:49,404 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:42:49,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash 991, now seen corresponding path program 1 times [2023-08-27 02:42:49,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:49,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013864746] [2023-08-27 02:42:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:49,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:49,478 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:42:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:49,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013864746] [2023-08-27 02:42:49,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013864746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:42:49,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:42:49,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-27 02:42:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189307025] [2023-08-27 02:42:49,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:42:49,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-27 02:42:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:42:49,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-27 02:42:49,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-27 02:42:49,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 485 [2023-08-27 02:42:49,512 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:42:49,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:42:49,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 485 [2023-08-27 02:42:49,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:42:49,707 INFO L124 PetriNetUnfolderBase]: 1466/2404 cut-off events. [2023-08-27 02:42:49,707 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-08-27 02:42:49,709 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:42:49,718 INFO L140 encePairwiseOnDemand]: 484/485 looper letters, 50 selfloop transitions, 0 changer transitions 0/58 dead transitions. [2023-08-27 02:42:49,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 225 flow [2023-08-27 02:42:49,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-27 02:42:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-27 02:42:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 521 transitions. [2023-08-27 02:42:49,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371134020618556 [2023-08-27 02:42:49,734 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 521 transitions. [2023-08-27 02:42:49,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 521 transitions. [2023-08-27 02:42:49,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:42:49,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 521 transitions. [2023-08-27 02:42:49,741 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:42:49,746 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:42:49,746 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:42:49,748 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:42:49,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 225 flow [2023-08-27 02:42:49,750 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:42:49,751 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 120 flow [2023-08-27 02:42:49,752 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:42:49,754 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-08-27 02:42:49,755 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 120 flow [2023-08-27 02:42:49,755 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:42:49,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:49,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:42:49,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 02:42:49,755 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:42:49,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1865824386, now seen corresponding path program 1 times [2023-08-27 02:42:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:49,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837907202] [2023-08-27 02:42:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:49,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:50,625 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:42:50,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:50,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837907202] [2023-08-27 02:42:50,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837907202] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:42:50,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:42:50,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 02:42:50,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084532219] [2023-08-27 02:42:50,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:42:50,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 02:42:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:42:50,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 02:42:50,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 02:42:50,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 02:42:50,630 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:42:50,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:42:50,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 02:42:50,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:42:50,962 INFO L124 PetriNetUnfolderBase]: 1510/2487 cut-off events. [2023-08-27 02:42:50,962 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-27 02:42:50,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4958 conditions, 2487 events. 1510/2487 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12438 event pairs, 1057 based on Foata normal form. 0/1741 useless extension candidates. Maximal degree in co-relation 4955. Up to 2421 conditions per place. [2023-08-27 02:42:50,971 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 54 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-08-27 02:42:50,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 270 flow [2023-08-27 02:42:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:42:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:42:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1193 transitions. [2023-08-27 02:42:50,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099656357388316 [2023-08-27 02:42:50,975 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1193 transitions. [2023-08-27 02:42:50,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1193 transitions. [2023-08-27 02:42:50,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:42:50,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1193 transitions. [2023-08-27 02:42:50,978 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:42:50,981 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:42:50,982 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:42:50,982 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:42:50,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 270 flow [2023-08-27 02:42:50,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 02:42:50,985 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 180 flow [2023-08-27 02:42:50,985 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=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-08-27 02:42:50,986 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2023-08-27 02:42:50,986 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 180 flow [2023-08-27 02:42:50,986 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:42:50,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:50,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:42:50,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 02:42:50,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:42:50,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2006802628, now seen corresponding path program 1 times [2023-08-27 02:42:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:50,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426615354] [2023-08-27 02:42:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:51,640 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:42:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:51,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426615354] [2023-08-27 02:42:51,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426615354] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:42:51,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:42:51,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:42:51,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096573006] [2023-08-27 02:42:51,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:42:51,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:42:51,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:42:51,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:42:51,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:42:51,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:42:51,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 180 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:42:51,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:42:51,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:42:51,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:42:52,200 INFO L124 PetriNetUnfolderBase]: 1996/3312 cut-off events. [2023-08-27 02:42:52,200 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2023-08-27 02:42:52,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7029 conditions, 3312 events. 1996/3312 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 18180 event pairs, 376 based on Foata normal form. 0/2513 useless extension candidates. Maximal degree in co-relation 7021. Up to 2493 conditions per place. [2023-08-27 02:42:52,212 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 121 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2023-08-27 02:42:52,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 145 transitions, 633 flow [2023-08-27 02:42:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:42:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:42:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1240 transitions. [2023-08-27 02:42:52,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4261168384879725 [2023-08-27 02:42:52,215 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1240 transitions. [2023-08-27 02:42:52,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1240 transitions. [2023-08-27 02:42:52,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:42:52,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1240 transitions. [2023-08-27 02:42:52,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:42:52,220 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:42:52,222 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:42:52,222 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 180 flow. Second operand 6 states and 1240 transitions. [2023-08-27 02:42:52,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 145 transitions, 633 flow [2023-08-27 02:42:52,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 145 transitions, 633 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 02:42:52,226 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 274 flow [2023-08-27 02:42:52,227 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=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2023-08-27 02:42:52,227 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2023-08-27 02:42:52,227 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 274 flow [2023-08-27 02:42:52,228 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:42:52,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:52,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:42:52,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 02:42:52,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:42:52,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2005979578, now seen corresponding path program 2 times [2023-08-27 02:42:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:52,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922702039] [2023-08-27 02:42:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:42:52,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:52,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922702039] [2023-08-27 02:42:52,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922702039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:42:52,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:42:52,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:42:52,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115773044] [2023-08-27 02:42:52,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:42:52,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:42:52,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:42:52,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:42:52,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:42:52,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:42:52,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 274 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:42:52,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:42:52,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:42:52,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:42:53,198 INFO L124 PetriNetUnfolderBase]: 2162/3618 cut-off events. [2023-08-27 02:42:53,199 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2023-08-27 02:42:53,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8454 conditions, 3618 events. 2162/3618 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 20490 event pairs, 373 based on Foata normal form. 0/2744 useless extension candidates. Maximal degree in co-relation 8442. Up to 2455 conditions per place. [2023-08-27 02:42:53,215 INFO L140 encePairwiseOnDemand]: 475/485 looper letters, 147 selfloop transitions, 24 changer transitions 0/178 dead transitions. [2023-08-27 02:42:53,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 178 transitions, 856 flow [2023-08-27 02:42:53,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 02:42:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 02:42:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1450 transitions. [2023-08-27 02:42:53,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270986745213549 [2023-08-27 02:42:53,218 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1450 transitions. [2023-08-27 02:42:53,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1450 transitions. [2023-08-27 02:42:53,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:42:53,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1450 transitions. [2023-08-27 02:42:53,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 207.14285714285714) internal successors, (1450), 7 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states 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:42:53,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 485.0) internal successors, (3880), 8 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states 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:42:53,226 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 485.0) internal successors, (3880), 8 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states 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:42:53,226 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 274 flow. Second operand 7 states and 1450 transitions. [2023-08-27 02:42:53,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 178 transitions, 856 flow [2023-08-27 02:42:53,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 178 transitions, 836 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-27 02:42:53,238 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 377 flow [2023-08-27 02:42:53,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=377, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2023-08-27 02:42:53,240 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 23 predicate places. [2023-08-27 02:42:53,240 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 377 flow [2023-08-27 02:42:53,240 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:42:53,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:53,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:42:53,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 02:42:53,240 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:42:53,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2005678240, now seen corresponding path program 1 times [2023-08-27 02:42:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330815891] [2023-08-27 02:42:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:53,779 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:42:53,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330815891] [2023-08-27 02:42:53,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330815891] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:42:53,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:42:53,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:42:53,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881982020] [2023-08-27 02:42:53,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:42:53,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:42:53,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:42:53,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:42:53,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:42:53,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:42:53,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 377 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:42:53,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:42:53,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:42:53,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:42:54,273 INFO L124 PetriNetUnfolderBase]: 2163/3625 cut-off events. [2023-08-27 02:42:54,273 INFO L125 PetriNetUnfolderBase]: For 1188/1188 co-relation queries the response was YES. [2023-08-27 02:42:54,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8783 conditions, 3625 events. 2163/3625 cut-off events. For 1188/1188 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 20402 event pairs, 402 based on Foata normal form. 0/2826 useless extension candidates. Maximal degree in co-relation 8767. Up to 2643 conditions per place. [2023-08-27 02:42:54,289 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 128 selfloop transitions, 20 changer transitions 0/155 dead transitions. [2023-08-27 02:42:54,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 155 transitions, 828 flow [2023-08-27 02:42:54,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:42:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:42:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1238 transitions. [2023-08-27 02:42:54,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254295532646048 [2023-08-27 02:42:54,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1238 transitions. [2023-08-27 02:42:54,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1238 transitions. [2023-08-27 02:42:54,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:42:54,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1238 transitions. [2023-08-27 02:42:54,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.33333333333334) internal successors, (1238), 6 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states 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:42:54,299 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:42:54,299 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:42:54,299 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 377 flow. Second operand 6 states and 1238 transitions. [2023-08-27 02:42:54,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 155 transitions, 828 flow [2023-08-27 02:42:54,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 155 transitions, 822 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-27 02:42:54,310 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 430 flow [2023-08-27 02:42:54,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2023-08-27 02:42:54,312 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 29 predicate places. [2023-08-27 02:42:54,312 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 430 flow [2023-08-27 02:42:54,313 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:42:54,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:54,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:42:54,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 02:42:54,313 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:42:54,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash 752218327, now seen corresponding path program 1 times [2023-08-27 02:42:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:54,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492915275] [2023-08-27 02:42:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:54,342 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:42:54,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:54,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492915275] [2023-08-27 02:42:54,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492915275] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:42:54,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:42:54,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 02:42:54,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826716753] [2023-08-27 02:42:54,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:42:54,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 02:42:54,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:42:54,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 02:42:54,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 02:42:54,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 485 [2023-08-27 02:42:54,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 430 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:42:54,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:42:54,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 485 [2023-08-27 02:42:54,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:42:54,789 INFO L124 PetriNetUnfolderBase]: 3532/5858 cut-off events. [2023-08-27 02:42:54,789 INFO L125 PetriNetUnfolderBase]: For 4832/4959 co-relation queries the response was YES. [2023-08-27 02:42:54,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14416 conditions, 5858 events. 3532/5858 cut-off events. For 4832/4959 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 36074 event pairs, 1580 based on Foata normal form. 127/4562 useless extension candidates. Maximal degree in co-relation 14398. Up to 3434 conditions per place. [2023-08-27 02:42:54,813 INFO L140 encePairwiseOnDemand]: 478/485 looper letters, 156 selfloop transitions, 4 changer transitions 0/170 dead transitions. [2023-08-27 02:42:54,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 170 transitions, 1141 flow [2023-08-27 02:42:54,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 02:42:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 02:42:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1009 transitions. [2023-08-27 02:42:54,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201030927835052 [2023-08-27 02:42:54,815 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1009 transitions. [2023-08-27 02:42:54,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1009 transitions. [2023-08-27 02:42:54,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:42:54,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1009 transitions. [2023-08-27 02:42:54,817 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:42:54,820 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:42:54,821 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:42:54,821 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 430 flow. Second operand 4 states and 1009 transitions. [2023-08-27 02:42:54,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 170 transitions, 1141 flow [2023-08-27 02:42:54,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 170 transitions, 1080 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-27 02:42:54,828 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 429 flow [2023-08-27 02:42:54,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=429, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2023-08-27 02:42:54,830 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2023-08-27 02:42:54,830 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 429 flow [2023-08-27 02:42:54,830 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:42:54,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:54,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:42:54,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 02:42:54,830 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:42:54,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:54,831 INFO L85 PathProgramCache]: Analyzing trace with hash 693783489, now seen corresponding path program 1 times [2023-08-27 02:42:54,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:54,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168729563] [2023-08-27 02:42:54,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:54,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:55,187 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:42:55,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:55,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168729563] [2023-08-27 02:42:55,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168729563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:42:55,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:42:55,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 02:42:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028351608] [2023-08-27 02:42:55,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:42:55,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 02:42:55,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:42:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 02:42:55,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 02:42:55,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 02:42:55,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 429 flow. Second operand has 6 states, 6 states have (on average 189.66666666666666) internal successors, (1138), 6 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states 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:42:55,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:42:55,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 02:42:55,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:42:55,855 INFO L124 PetriNetUnfolderBase]: 4038/6730 cut-off events. [2023-08-27 02:42:55,855 INFO L125 PetriNetUnfolderBase]: For 4591/4601 co-relation queries the response was YES. [2023-08-27 02:42:55,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17008 conditions, 6730 events. 4038/6730 cut-off events. For 4591/4601 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 40943 event pairs, 2164 based on Foata normal form. 0/5415 useless extension candidates. Maximal degree in co-relation 16988. Up to 5735 conditions per place. [2023-08-27 02:42:55,886 INFO L140 encePairwiseOnDemand]: 471/485 looper letters, 104 selfloop transitions, 19 changer transitions 0/130 dead transitions. [2023-08-27 02:42:55,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 130 transitions, 799 flow [2023-08-27 02:42:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 02:42:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 02:42:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1416 transitions. [2023-08-27 02:42:55,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4170839469808542 [2023-08-27 02:42:55,890 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1416 transitions. [2023-08-27 02:42:55,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1416 transitions. [2023-08-27 02:42:55,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:42:55,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1416 transitions. [2023-08-27 02:42:55,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 202.28571428571428) internal successors, (1416), 7 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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:42:55,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 485.0) internal successors, (3880), 8 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states 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:42:55,896 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 485.0) internal successors, (3880), 8 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states 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:42:55,896 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 429 flow. Second operand 7 states and 1416 transitions. [2023-08-27 02:42:55,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 130 transitions, 799 flow [2023-08-27 02:42:55,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 130 transitions, 795 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 02:42:55,904 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 534 flow [2023-08-27 02:42:55,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=534, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2023-08-27 02:42:55,905 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places. [2023-08-27 02:42:55,906 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 534 flow [2023-08-27 02:42:55,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.66666666666666) internal successors, (1138), 6 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states 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:42:55,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:55,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:42:55,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 02:42:55,906 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:42:55,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1288991555, now seen corresponding path program 1 times [2023-08-27 02:42:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:55,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317102227] [2023-08-27 02:42:55,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:55,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:56,147 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:42:56,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317102227] [2023-08-27 02:42:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317102227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:42:56,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:42:56,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 02:42:56,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748154134] [2023-08-27 02:42:56,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:42:56,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 02:42:56,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:42:56,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 02:42:56,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-27 02:42:56,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:42:56,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 534 flow. Second operand has 7 states, 7 states have (on average 185.57142857142858) internal successors, (1299), 7 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states 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:42:56,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:42:56,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:42:56,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:42:56,821 INFO L124 PetriNetUnfolderBase]: 5236/8617 cut-off events. [2023-08-27 02:42:56,821 INFO L125 PetriNetUnfolderBase]: For 4997/5027 co-relation queries the response was YES. [2023-08-27 02:42:56,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23556 conditions, 8617 events. 5236/8617 cut-off events. For 4997/5027 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 53990 event pairs, 974 based on Foata normal form. 199/7504 useless extension candidates. Maximal degree in co-relation 23534. Up to 4745 conditions per place. [2023-08-27 02:42:56,854 INFO L140 encePairwiseOnDemand]: 470/485 looper letters, 180 selfloop transitions, 32 changer transitions 0/219 dead transitions. [2023-08-27 02:42:56,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 219 transitions, 1352 flow [2023-08-27 02:42:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 02:42:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 02:42:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1470 transitions. [2023-08-27 02:42:56,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329896907216495 [2023-08-27 02:42:56,857 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1470 transitions. [2023-08-27 02:42:56,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1470 transitions. [2023-08-27 02:42:56,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:42:56,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1470 transitions. [2023-08-27 02:42:56,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:42:56,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 485.0) internal successors, (3880), 8 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states 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:42:56,863 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 485.0) internal successors, (3880), 8 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states 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:42:56,863 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 534 flow. Second operand 7 states and 1470 transitions. [2023-08-27 02:42:56,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 219 transitions, 1352 flow [2023-08-27 02:42:56,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 219 transitions, 1333 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-27 02:42:56,899 INFO L231 Difference]: Finished difference. Result has 103 places, 104 transitions, 691 flow [2023-08-27 02:42:56,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=691, PETRI_PLACES=103, PETRI_TRANSITIONS=104} [2023-08-27 02:42:56,900 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 44 predicate places. [2023-08-27 02:42:56,900 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 691 flow [2023-08-27 02:42:56,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 185.57142857142858) internal successors, (1299), 7 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states 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:42:56,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:56,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:42:56,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 02:42:56,901 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:42:56,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:56,901 INFO L85 PathProgramCache]: Analyzing trace with hash 38670346, now seen corresponding path program 1 times [2023-08-27 02:42:56,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:56,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473681632] [2023-08-27 02:42:56,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:56,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:42:57,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:57,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473681632] [2023-08-27 02:42:57,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473681632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:42:57,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:42:57,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 02:42:57,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970600571] [2023-08-27 02:42:57,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:42:57,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 02:42:57,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:42:57,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 02:42:57,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 02:42:57,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:42:57,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 104 transitions, 691 flow. Second operand has 7 states, 7 states have (on average 185.57142857142858) internal successors, (1299), 7 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states 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:42:57,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:42:57,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:42:57,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:42:58,164 INFO L124 PetriNetUnfolderBase]: 5520/9165 cut-off events. [2023-08-27 02:42:58,164 INFO L125 PetriNetUnfolderBase]: For 12179/12201 co-relation queries the response was YES. [2023-08-27 02:42:58,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27324 conditions, 9165 events. 5520/9165 cut-off events. For 12179/12201 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 57891 event pairs, 1410 based on Foata normal form. 141/7938 useless extension candidates. Maximal degree in co-relation 27299. Up to 6466 conditions per place. [2023-08-27 02:42:58,204 INFO L140 encePairwiseOnDemand]: 473/485 looper letters, 182 selfloop transitions, 27 changer transitions 0/216 dead transitions. [2023-08-27 02:42:58,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 216 transitions, 1460 flow [2023-08-27 02:42:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 02:42:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 02:42:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1454 transitions. [2023-08-27 02:42:58,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4282768777614138 [2023-08-27 02:42:58,208 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1454 transitions. [2023-08-27 02:42:58,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1454 transitions. [2023-08-27 02:42:58,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:42:58,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1454 transitions. [2023-08-27 02:42:58,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 207.71428571428572) internal successors, (1454), 7 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states 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:42:58,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 485.0) internal successors, (3880), 8 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states 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:42:58,216 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 485.0) internal successors, (3880), 8 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states 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:42:58,216 INFO L175 Difference]: Start difference. First operand has 103 places, 104 transitions, 691 flow. Second operand 7 states and 1454 transitions. [2023-08-27 02:42:58,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 216 transitions, 1460 flow [2023-08-27 02:42:58,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 216 transitions, 1435 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 02:42:58,271 INFO L231 Difference]: Finished difference. Result has 107 places, 110 transitions, 792 flow [2023-08-27 02:42:58,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=792, PETRI_PLACES=107, PETRI_TRANSITIONS=110} [2023-08-27 02:42:58,271 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places. [2023-08-27 02:42:58,271 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 792 flow [2023-08-27 02:42:58,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 185.57142857142858) internal successors, (1299), 7 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states 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:42:58,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:58,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:42:58,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 02:42:58,282 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:42:58,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:58,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1327212761, now seen corresponding path program 1 times [2023-08-27 02:42:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:58,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257217307] [2023-08-27 02:42:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:58,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:58,328 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:42:58,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:58,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257217307] [2023-08-27 02:42:58,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257217307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:42:58,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:42:58,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:42:58,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616726398] [2023-08-27 02:42:58,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:42:58,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:42:58,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:42:58,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:42:58,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:42:58,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 485 [2023-08-27 02:42:58,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 110 transitions, 792 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:42:58,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:42:58,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 485 [2023-08-27 02:42:58,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:42:58,468 INFO L124 PetriNetUnfolderBase]: 887/1734 cut-off events. [2023-08-27 02:42:58,468 INFO L125 PetriNetUnfolderBase]: For 1927/1938 co-relation queries the response was YES. [2023-08-27 02:42:58,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4810 conditions, 1734 events. 887/1734 cut-off events. For 1927/1938 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 9873 event pairs, 569 based on Foata normal form. 85/1666 useless extension candidates. Maximal degree in co-relation 4783. Up to 833 conditions per place. [2023-08-27 02:42:58,474 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 82 selfloop transitions, 2 changer transitions 7/99 dead transitions. [2023-08-27 02:42:58,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 99 transitions, 795 flow [2023-08-27 02:42:58,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:42:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:42:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2023-08-27 02:42:58,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147766323024054 [2023-08-27 02:42:58,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2023-08-27 02:42:58,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2023-08-27 02:42:58,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:42:58,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2023-08-27 02:42:58,478 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:42:58,479 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:42:58,479 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:42:58,479 INFO L175 Difference]: Start difference. First operand has 107 places, 110 transitions, 792 flow. Second operand 3 states and 749 transitions. [2023-08-27 02:42:58,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 99 transitions, 795 flow [2023-08-27 02:42:58,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 726 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-08-27 02:42:58,485 INFO L231 Difference]: Finished difference. Result has 104 places, 87 transitions, 514 flow [2023-08-27 02:42:58,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=104, PETRI_TRANSITIONS=87} [2023-08-27 02:42:58,487 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 45 predicate places. [2023-08-27 02:42:58,487 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 87 transitions, 514 flow [2023-08-27 02:42:58,488 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:42:58,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:58,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:42:58,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 02:42:58,488 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:42:58,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1117479504, now seen corresponding path program 1 times [2023-08-27 02:42:58,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:58,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427904326] [2023-08-27 02:42:58,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 02:42:58,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:58,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427904326] [2023-08-27 02:42:58,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427904326] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:42:58,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:42:58,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:42:58,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725316784] [2023-08-27 02:42:58,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:42:58,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:42:58,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:42:58,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:42:58,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:42:58,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:42:58,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 87 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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:42:58,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:42:58,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:42:58,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:42:58,632 INFO L124 PetriNetUnfolderBase]: 583/1173 cut-off events. [2023-08-27 02:42:58,633 INFO L125 PetriNetUnfolderBase]: For 1042/1042 co-relation queries the response was YES. [2023-08-27 02:42:58,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 1173 events. 583/1173 cut-off events. For 1042/1042 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6049 event pairs, 412 based on Foata normal form. 8/1052 useless extension candidates. Maximal degree in co-relation 3226. Up to 879 conditions per place. [2023-08-27 02:42:58,637 INFO L140 encePairwiseOnDemand]: 480/485 looper letters, 83 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2023-08-27 02:42:58,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 96 transitions, 718 flow [2023-08-27 02:42:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:42:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:42:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2023-08-27 02:42:58,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140893470790378 [2023-08-27 02:42:58,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2023-08-27 02:42:58,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2023-08-27 02:42:58,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:42:58,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2023-08-27 02:42:58,640 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:42:58,641 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:42:58,642 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:42:58,642 INFO L175 Difference]: Start difference. First operand has 104 places, 87 transitions, 514 flow. Second operand 3 states and 748 transitions. [2023-08-27 02:42:58,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 96 transitions, 718 flow [2023-08-27 02:42:58,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 96 transitions, 695 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-27 02:42:58,646 INFO L231 Difference]: Finished difference. Result has 103 places, 88 transitions, 518 flow [2023-08-27 02:42:58,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=103, PETRI_TRANSITIONS=88} [2023-08-27 02:42:58,646 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 44 predicate places. [2023-08-27 02:42:58,646 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 88 transitions, 518 flow [2023-08-27 02:42:58,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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:42:58,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:42:58,647 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:42:58,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 02:42:58,647 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:42:58,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:42:58,647 INFO L85 PathProgramCache]: Analyzing trace with hash 156498137, now seen corresponding path program 1 times [2023-08-27 02:42:58,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:42:58,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403035484] [2023-08-27 02:42:58,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:58,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:42:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:59,177 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:42:59,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:42:59,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403035484] [2023-08-27 02:42:59,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403035484] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:42:59,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272487636] [2023-08-27 02:42:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:42:59,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:42:59,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:42:59,180 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:42:59,181 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:42:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:42:59,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-27 02:42:59,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:42:59,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:42:59,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:42:59,358 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:42:59,358 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-27 02:42:59,367 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 02:42:59,368 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:42:59,437 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:42:59,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 41 treesize of output 34 [2023-08-27 02:42:59,653 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:42:59,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:42:59,704 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:42:59,792 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:42:59,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:42:59,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:42:59,945 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_408) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_409) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:43:03,327 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_406 Int) (v_ArrVal_405 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_405) .cse1 v_ArrVal_406)) |c_~#stored_elements~0.base| v_ArrVal_408) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_406) (< (+ (select .cse0 .cse2) 1) v_ArrVal_405) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_409) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse3 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|))))) is different from false [2023-08-27 02:43:03,350 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_406 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_402)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |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_405) .cse3 v_ArrVal_406)) |c_~#stored_elements~0.base| v_ArrVal_408) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_405) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (+ (select .cse0 .cse3) 1) v_ArrVal_406) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_409) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 02:43:09,324 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:43:09,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272487636] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:43:09,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:43:09,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2023-08-27 02:43:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080289449] [2023-08-27 02:43:09,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:43:09,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-27 02:43:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:09,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-27 02:43:09,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=645, Unknown=15, NotChecked=174, Total=1056 [2023-08-27 02:43:09,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 485 [2023-08-27 02:43:09,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 88 transitions, 518 flow. Second operand has 33 states, 33 states have (on average 180.36363636363637) internal successors, (5952), 33 states have internal predecessors, (5952), 0 states have call successors, (0), 0 states 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:43:09,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:09,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 485 [2023-08-27 02:43:09,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:12,285 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:43:12,302 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (+ (select .cse4 .cse5) 1)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_406 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_406)) |c_~#stored_elements~0.base| v_ArrVal_408) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_406) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_409) .cse3) 2147483647)))) (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_406 Int) (v_ArrVal_405 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_405) .cse5 v_ArrVal_406)) |c_~#stored_elements~0.base| v_ArrVal_408) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_406) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_409) .cse3) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_405) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|))))))) is different from false [2023-08-27 02:43:15,417 INFO L124 PetriNetUnfolderBase]: 637/1267 cut-off events. [2023-08-27 02:43:15,417 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2023-08-27 02:43:15,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 1267 events. 637/1267 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6578 event pairs, 440 based on Foata normal form. 2/1137 useless extension candidates. Maximal degree in co-relation 3567. Up to 1114 conditions per place. [2023-08-27 02:43:15,422 INFO L140 encePairwiseOnDemand]: 468/485 looper letters, 80 selfloop transitions, 56 changer transitions 1/143 dead transitions. [2023-08-27 02:43:15,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 143 transitions, 1098 flow [2023-08-27 02:43:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-27 02:43:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-27 02:43:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4232 transitions. [2023-08-27 02:43:15,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37938144329896906 [2023-08-27 02:43:15,430 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4232 transitions. [2023-08-27 02:43:15,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4232 transitions. [2023-08-27 02:43:15,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:15,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4232 transitions. [2023-08-27 02:43:15,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 184.0) internal successors, (4232), 23 states have internal predecessors, (4232), 0 states have call successors, (0), 0 states 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:43:15,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 485.0) internal successors, (11640), 24 states have internal predecessors, (11640), 0 states have call successors, (0), 0 states 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:43:15,445 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 485.0) internal successors, (11640), 24 states have internal predecessors, (11640), 0 states have call successors, (0), 0 states 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:43:15,445 INFO L175 Difference]: Start difference. First operand has 103 places, 88 transitions, 518 flow. Second operand 23 states and 4232 transitions. [2023-08-27 02:43:15,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 143 transitions, 1098 flow [2023-08-27 02:43:15,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 143 transitions, 1093 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 02:43:15,450 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 943 flow [2023-08-27 02:43:15,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=943, PETRI_PLACES=130, PETRI_TRANSITIONS=127} [2023-08-27 02:43:15,451 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 71 predicate places. [2023-08-27 02:43:15,451 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 943 flow [2023-08-27 02:43:15,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 180.36363636363637) internal successors, (5952), 33 states have internal predecessors, (5952), 0 states have call successors, (0), 0 states 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:43:15,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:15,452 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:15,459 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:43:15,657 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:43:15,659 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:43:15,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash 156498119, now seen corresponding path program 1 times [2023-08-27 02:43:15,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:15,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409218189] [2023-08-27 02:43:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:15,927 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:43:15,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:15,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409218189] [2023-08-27 02:43:15,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409218189] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:43:15,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654090714] [2023-08-27 02:43:15,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:15,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:43:15,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:43:15,928 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:43:15,930 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:43:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:16,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-27 02:43:16,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:43:16,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:16,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:16,047 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:43:16,047 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:43:16,057 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 02:43:16,057 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:43:16,127 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:43:16,202 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:43:16,308 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:43:16,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:16,352 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:43:16,438 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:43:16,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:43:16,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:43:16,600 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41| Int) (v_ArrVal_505 Int) (v_ArrVal_503 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_503)) |c_~#stored_elements~0.base| v_ArrVal_504) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_503) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) |c_~#queue~0.offset|) v_ArrVal_505) (+ 88 |c_~#queue~0.offset|)) 2147483650))))) is different from false [2023-08-27 02:43:17,526 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_504 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41| Int) (v_ArrVal_505 Int) (v_ArrVal_503 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_500) .cse2 v_ArrVal_503)) |c_~#stored_elements~0.base| v_ArrVal_504) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) |c_~#queue~0.offset|) v_ArrVal_505) (+ 88 |c_~#queue~0.offset|)))) (< v_ArrVal_500 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_503) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|))))) is different from false [2023-08-27 02:43:17,545 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_504 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41| Int) (v_ArrVal_505 Int) (v_ArrVal_503 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_500) .cse2 v_ArrVal_503)) |c_~#stored_elements~0.base| v_ArrVal_504) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) |c_~#queue~0.offset|) v_ArrVal_505) (+ 88 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_503) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) (< (+ v_ArrVal_500 2147483648) 0))))) is different from false [2023-08-27 02:43:17,566 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_498 Int) (v_ArrVal_504 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41| Int) (v_ArrVal_505 Int) (v_ArrVal_503 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_498)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_500) .cse2 v_ArrVal_503)) |c_~#stored_elements~0.base| v_ArrVal_504) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_503) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) |c_~#queue~0.offset|) v_ArrVal_505) (+ 88 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_500 2147483648) 0))))) is different from false [2023-08-27 02:43:17,782 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:43:17,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654090714] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:43:17,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:43:17,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-27 02:43:17,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726355161] [2023-08-27 02:43:17,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:43:17,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-27 02:43:17,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:17,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-27 02:43:17,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=478, Unknown=13, NotChecked=204, Total=870 [2023-08-27 02:43:17,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 485 [2023-08-27 02:43:17,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 943 flow. Second operand has 30 states, 30 states have (on average 179.5) internal successors, (5385), 30 states have internal predecessors, (5385), 0 states have call successors, (0), 0 states 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:43:17,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:17,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 485 [2023-08-27 02:43:17,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:52,630 INFO L124 PetriNetUnfolderBase]: 1779/3482 cut-off events. [2023-08-27 02:43:52,630 INFO L125 PetriNetUnfolderBase]: For 2803/2803 co-relation queries the response was YES. [2023-08-27 02:43:52,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9829 conditions, 3482 events. 1779/3482 cut-off events. For 2803/2803 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 22120 event pairs, 726 based on Foata normal form. 10/3139 useless extension candidates. Maximal degree in co-relation 9795. Up to 893 conditions per place. [2023-08-27 02:43:52,644 INFO L140 encePairwiseOnDemand]: 462/485 looper letters, 215 selfloop transitions, 127 changer transitions 4/352 dead transitions. [2023-08-27 02:43:52,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 352 transitions, 2598 flow [2023-08-27 02:43:52,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-27 02:43:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-27 02:43:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6713 transitions. [2023-08-27 02:43:52,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38447880870561285 [2023-08-27 02:43:52,655 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6713 transitions. [2023-08-27 02:43:52,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6713 transitions. [2023-08-27 02:43:52,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:52,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6713 transitions. [2023-08-27 02:43:52,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 186.47222222222223) internal successors, (6713), 36 states have internal predecessors, (6713), 0 states have call successors, (0), 0 states 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:43:52,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 485.0) internal successors, (17945), 37 states have internal predecessors, (17945), 0 states have call successors, (0), 0 states 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:43:52,679 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 485.0) internal successors, (17945), 37 states have internal predecessors, (17945), 0 states have call successors, (0), 0 states 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:43:52,679 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 943 flow. Second operand 36 states and 6713 transitions. [2023-08-27 02:43:52,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 352 transitions, 2598 flow [2023-08-27 02:43:52,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 352 transitions, 2464 flow, removed 52 selfloop flow, removed 8 redundant places. [2023-08-27 02:43:52,696 INFO L231 Difference]: Finished difference. Result has 167 places, 194 transitions, 1630 flow [2023-08-27 02:43:52,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=1630, PETRI_PLACES=167, PETRI_TRANSITIONS=194} [2023-08-27 02:43:52,696 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 108 predicate places. [2023-08-27 02:43:52,697 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 194 transitions, 1630 flow [2023-08-27 02:43:52,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 179.5) internal successors, (5385), 30 states have internal predecessors, (5385), 0 states have call successors, (0), 0 states 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:43:52,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:52,698 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:52,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-27 02:43:52,902 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:43:52,903 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:43:52,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:52,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1968124107, now seen corresponding path program 1 times [2023-08-27 02:43:52,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:52,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871678589] [2023-08-27 02:43:52,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:52,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:53,550 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:43:53,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:43:53,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871678589] [2023-08-27 02:43:53,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871678589] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:43:53,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565750056] [2023-08-27 02:43:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:53,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:43:53,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:43:53,551 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:43:53,552 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:43:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:43:53,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 78 conjunts are in the unsatisfiable core [2023-08-27 02:43:53,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:43:53,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:53,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:53,675 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:43:53,676 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:43:53,690 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:43:53,690 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:43:53,782 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:43:53,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-08-27 02:43:53,917 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-27 02:43:54,066 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:43:54,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:43:54,114 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:43:54,214 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:43:54,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:43:54,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:43:54,513 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_606 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_606)) |c_~#stored_elements~0.base| v_ArrVal_607) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_606) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_608) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|)))) is different from false [2023-08-27 02:43:54,805 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_606 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_604))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4)) (.cse1 (select (store (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_606)) |c_~#stored_elements~0.base| v_ArrVal_607) |c_~#queue~0.base|))) (or (= 20 .cse0) (< (+ .cse0 1) v_ArrVal_606) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_608) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|)))))) is different from false [2023-08-27 02:43:54,827 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_606 Int) (v_ArrVal_602 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_604))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_606)) |c_~#stored_elements~0.base| v_ArrVal_607) |c_~#queue~0.base|)) (.cse0 (select .cse2 .cse3))) (or (= .cse0 20) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_608) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) (< (+ .cse0 1) v_ArrVal_606) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_602)))))) is different from false [2023-08-27 02:43:54,851 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_606 Int) (v_ArrVal_602 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_604))) (let ((.cse4 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_606)) |c_~#stored_elements~0.base| v_ArrVal_607) |c_~#queue~0.base|)) (.cse0 (select .cse4 .cse5))) (or (= .cse0 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_602) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_608) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse3 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) (< (+ .cse0 1) v_ArrVal_606))))))) is different from false [2023-08-27 02:43:54,880 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_606 Int) (v_ArrVal_602 Int) (v_ArrVal_600 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_600)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_604))) (let ((.cse4 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_606)) |c_~#stored_elements~0.base| v_ArrVal_607) |c_~#queue~0.base|)) (.cse0 (select .cse4 .cse5))) (or (< (+ .cse0 1) v_ArrVal_606) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_608) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_602) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) (= .cse0 20))))))) is different from false [2023-08-27 02:43:54,906 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47| Int) (v_ArrVal_606 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49| Int) (v_ArrVal_602 Int) (v_ArrVal_600 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49|) |c_~#queue~0.offset|) v_ArrVal_600)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_602)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_604))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 .cse3 v_ArrVal_606)) |c_~#stored_elements~0.base| v_ArrVal_607) |c_~#queue~0.base|)) (.cse4 (select .cse6 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_602) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49|) (= .cse4 20) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_47|) |c_~#queue~0.offset|) v_ArrVal_608) .cse1) 2147483647) (< (+ .cse4 1) v_ArrVal_606)))))))) is different from false [2023-08-27 02:43:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-27 02:43:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565750056] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:43:54,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:43:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2023-08-27 02:43:54,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058507737] [2023-08-27 02:43:54,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:43:54,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-27 02:43:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:43:54,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-27 02:43:54,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=664, Unknown=19, NotChecked=378, Total=1332 [2023-08-27 02:43:54,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:43:54,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 194 transitions, 1630 flow. Second operand has 37 states, 37 states have (on average 176.2972972972973) internal successors, (6523), 37 states have internal predecessors, (6523), 0 states have call successors, (0), 0 states 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:43:54,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:43:54,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:43:54,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:43:59,296 INFO L124 PetriNetUnfolderBase]: 2155/4223 cut-off events. [2023-08-27 02:43:59,296 INFO L125 PetriNetUnfolderBase]: For 20066/20346 co-relation queries the response was YES. [2023-08-27 02:43:59,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18644 conditions, 4223 events. 2155/4223 cut-off events. For 20066/20346 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 28290 event pairs, 725 based on Foata normal form. 14/3872 useless extension candidates. Maximal degree in co-relation 18601. Up to 2846 conditions per place. [2023-08-27 02:43:59,318 INFO L140 encePairwiseOnDemand]: 471/485 looper letters, 212 selfloop transitions, 60 changer transitions 3/281 dead transitions. [2023-08-27 02:43:59,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 281 transitions, 3014 flow [2023-08-27 02:43:59,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-27 02:43:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-27 02:43:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2775 transitions. [2023-08-27 02:43:59,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38144329896907214 [2023-08-27 02:43:59,323 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2775 transitions. [2023-08-27 02:43:59,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2775 transitions. [2023-08-27 02:43:59,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:43:59,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2775 transitions. [2023-08-27 02:43:59,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 185.0) internal successors, (2775), 15 states have internal predecessors, (2775), 0 states have call successors, (0), 0 states 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:43:59,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 485.0) internal successors, (7760), 16 states have internal predecessors, (7760), 0 states have call successors, (0), 0 states 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:43:59,331 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 485.0) internal successors, (7760), 16 states have internal predecessors, (7760), 0 states have call successors, (0), 0 states 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:43:59,331 INFO L175 Difference]: Start difference. First operand has 167 places, 194 transitions, 1630 flow. Second operand 15 states and 2775 transitions. [2023-08-27 02:43:59,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 281 transitions, 3014 flow [2023-08-27 02:43:59,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 281 transitions, 2761 flow, removed 98 selfloop flow, removed 18 redundant places. [2023-08-27 02:43:59,364 INFO L231 Difference]: Finished difference. Result has 169 places, 209 transitions, 1687 flow [2023-08-27 02:43:59,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1687, PETRI_PLACES=169, PETRI_TRANSITIONS=209} [2023-08-27 02:43:59,365 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 110 predicate places. [2023-08-27 02:43:59,365 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 209 transitions, 1687 flow [2023-08-27 02:43:59,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 176.2972972972973) internal successors, (6523), 37 states have internal predecessors, (6523), 0 states have call successors, (0), 0 states 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:43:59,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:43:59,366 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:43:59,371 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:43:59,571 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:43:59,571 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:43:59,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:43:59,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1655876777, now seen corresponding path program 1 times [2023-08-27 02:43:59,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:43:59,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446035719] [2023-08-27 02:43:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:43:59,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:43:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:00,150 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:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446035719] [2023-08-27 02:44:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446035719] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:44:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260680674] [2023-08-27 02:44:00,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:00,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:44:00,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:44:00,152 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:44:00,154 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:44:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:00,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 73 conjunts are in the unsatisfiable core [2023-08-27 02:44:00,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:44:00,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:00,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:00,277 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:44:00,277 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:00,291 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:44:00,291 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:00,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 36 treesize of output 29 [2023-08-27 02:44:00,466 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:44:00,529 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-27 02:44:00,617 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:00,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:00,664 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:00,754 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:00,826 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:00,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:44:00,914 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_710) (+ 88 |c_~#queue~0.offset|)) 2147483650))))) is different from false [2023-08-27 02:44:01,048 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_707 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_706))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_707)) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_710) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_707)))))) is different from false [2023-08-27 02:44:01,074 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_707 Int) (v_ArrVal_705 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 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|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_705)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_706))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_707)) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_710) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) (< v_ArrVal_705 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_707)))))) is different from false [2023-08-27 02:44:01,094 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_707 Int) (v_ArrVal_705 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 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|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_705)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_706))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_707)) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_705 2147483648) 0) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_710) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_707)))))) is different from false [2023-08-27 02:44:01,114 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_707 Int) (v_ArrVal_705 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_702 Int) (v_ArrVal_710 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (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_702) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_705)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_706))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_707)) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_710) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_707) (< (+ v_ArrVal_705 2147483648) 0)))))) is different from false [2023-08-27 02:44:01,500 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:44:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260680674] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:44:01,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:44:01,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-27 02:44:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053239815] [2023-08-27 02:44:01,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:44:01,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-27 02:44:01,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:01,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-27 02:44:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=694, Unknown=17, NotChecked=300, Total=1190 [2023-08-27 02:44:01,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:44:01,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 209 transitions, 1687 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:01,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:01,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:44:01,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:11,341 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:11,384 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_707 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_707)) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_710) .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_707))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_707 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_706))) (let ((.cse6 (select .cse7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse5 (select (store (store .cse7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse4 v_ArrVal_707)) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_710) .cse2))) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) (< (+ (select .cse6 .cse4) 1) v_ArrVal_707)))))))) is different from false [2023-08-27 02:44:14,763 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_707 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_707)) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_710) .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_707)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_707 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_707)) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) (< 0 (+ 2147483650 (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_710) .cse2))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_707)))))) is different from false [2023-08-27 02:44:16,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:44:19,378 INFO L124 PetriNetUnfolderBase]: 3105/6052 cut-off events. [2023-08-27 02:44:19,378 INFO L125 PetriNetUnfolderBase]: For 28105/28500 co-relation queries the response was YES. [2023-08-27 02:44:19,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25990 conditions, 6052 events. 3105/6052 cut-off events. For 28105/28500 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 43515 event pairs, 1109 based on Foata normal form. 21/5517 useless extension candidates. Maximal degree in co-relation 25945. Up to 2948 conditions per place. [2023-08-27 02:44:19,411 INFO L140 encePairwiseOnDemand]: 461/485 looper letters, 290 selfloop transitions, 117 changer transitions 3/416 dead transitions. [2023-08-27 02:44:19,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 416 transitions, 4405 flow [2023-08-27 02:44:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-27 02:44:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-27 02:44:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5173 transitions. [2023-08-27 02:44:19,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38092783505154637 [2023-08-27 02:44:19,416 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5173 transitions. [2023-08-27 02:44:19,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5173 transitions. [2023-08-27 02:44:19,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:44:19,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5173 transitions. [2023-08-27 02:44:19,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 184.75) internal successors, (5173), 28 states have internal predecessors, (5173), 0 states have call successors, (0), 0 states 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,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 485.0) internal successors, (14065), 29 states have internal predecessors, (14065), 0 states have call successors, (0), 0 states 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,429 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 485.0) internal successors, (14065), 29 states have internal predecessors, (14065), 0 states have call successors, (0), 0 states 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,429 INFO L175 Difference]: Start difference. First operand has 169 places, 209 transitions, 1687 flow. Second operand 28 states and 5173 transitions. [2023-08-27 02:44:19,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 416 transitions, 4405 flow [2023-08-27 02:44:19,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 416 transitions, 4330 flow, removed 21 selfloop flow, removed 6 redundant places. [2023-08-27 02:44:19,469 INFO L231 Difference]: Finished difference. Result has 203 places, 263 transitions, 2637 flow [2023-08-27 02:44:19,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2637, PETRI_PLACES=203, PETRI_TRANSITIONS=263} [2023-08-27 02:44:19,470 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 144 predicate places. [2023-08-27 02:44:19,470 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 263 transitions, 2637 flow [2023-08-27 02:44:19,471 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:44:19,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:44:19,471 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:44:19,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-27 02:44:19,676 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:44:19,676 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:44:19,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:44:19,676 INFO L85 PathProgramCache]: Analyzing trace with hash 555652901, now seen corresponding path program 2 times [2023-08-27 02:44:19,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:44:19,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932386080] [2023-08-27 02:44:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:44:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:44:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:44:20,274 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:20,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:44:20,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932386080] [2023-08-27 02:44:20,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932386080] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:44:20,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775133893] [2023-08-27 02:44:20,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 02:44:20,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:44:20,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:44:20,276 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:44:20,278 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:44:20,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 02:44:20,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:44:20,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-27 02:44:20,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:44:20,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:20,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:20,440 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:44:20,440 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:20,457 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:44:20,458 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:20,545 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:20,625 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:20,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 44 treesize of output 37 [2023-08-27 02:44:20,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:44:20,794 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:20,840 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:20,927 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:20,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:44:20,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:44:21,063 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_814 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_812) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_814) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))) is different from false [2023-08-27 02:44:21,116 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_809 Int) (v_ArrVal_814 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_809)) |c_~#stored_elements~0.base| v_ArrVal_811) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_812) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_809) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_814) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:44:21,129 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_809 Int) (v_ArrVal_814 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_809)) |c_~#stored_elements~0.base| v_ArrVal_811) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_812) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_809) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_814) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 02:44:21,277 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_809 Int) (v_ArrVal_807 Int) (v_ArrVal_814 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |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_807) .cse2 v_ArrVal_809)) |c_~#stored_elements~0.base| v_ArrVal_811) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_812) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_814) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_809) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (< (+ (select .cse1 .cse3) 1) v_ArrVal_807))))) is different from false [2023-08-27 02:44:28,720 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,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775133893] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:44:28,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:44:28,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-08-27 02:44:28,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788138658] [2023-08-27 02:44:28,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:44:28,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-27 02:44:28,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:44:28,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-27 02:44:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=737, Unknown=19, NotChecked=252, Total=1260 [2023-08-27 02:44:28,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:44:28,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 263 transitions, 2637 flow. Second operand has 36 states, 36 states have (on average 176.33333333333334) internal successors, (6348), 36 states have internal predecessors, (6348), 0 states have call successors, (0), 0 states 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,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:44:28,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:44:28,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:44:42,224 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:52,409 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:54,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 [0, 1] [2023-08-27 02:44:56,434 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,441 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:06,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 [1] [2023-08-27 02:45:08,740 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:45:08,769 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ (select .cse4 .cse5) 1)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_809 Int) (v_ArrVal_814 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_809)) |c_~#stored_elements~0.base| v_ArrVal_811) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_812) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (< .cse2 v_ArrVal_809) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_814) .cse3) 2147483647)))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_809 Int) (v_ArrVal_807 Int) (v_ArrVal_814 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_807) .cse5 v_ArrVal_809)) |c_~#stored_elements~0.base| v_ArrVal_811) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_812) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_814) .cse3) 2147483647) (< .cse2 v_ArrVal_809) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_807) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))))))) is different from false [2023-08-27 02:45:10,211 INFO L124 PetriNetUnfolderBase]: 3435/6735 cut-off events. [2023-08-27 02:45:10,212 INFO L125 PetriNetUnfolderBase]: For 94575/94605 co-relation queries the response was YES. [2023-08-27 02:45:10,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39156 conditions, 6735 events. 3435/6735 cut-off events. For 94575/94605 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 49441 event pairs, 1303 based on Foata normal form. 20/6182 useless extension candidates. Maximal degree in co-relation 39098. Up to 4244 conditions per place. [2023-08-27 02:45:10,253 INFO L140 encePairwiseOnDemand]: 462/485 looper letters, 284 selfloop transitions, 137 changer transitions 3/430 dead transitions. [2023-08-27 02:45:10,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 430 transitions, 6300 flow [2023-08-27 02:45:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-27 02:45:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-27 02:45:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5323 transitions. [2023-08-27 02:45:10,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3784571631709918 [2023-08-27 02:45:10,258 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5323 transitions. [2023-08-27 02:45:10,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5323 transitions. [2023-08-27 02:45:10,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:45:10,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5323 transitions. [2023-08-27 02:45:10,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 183.55172413793105) internal successors, (5323), 29 states have internal predecessors, (5323), 0 states have call successors, (0), 0 states 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:10,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 485.0) internal successors, (14550), 30 states have internal predecessors, (14550), 0 states have call successors, (0), 0 states 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:10,271 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 485.0) internal successors, (14550), 30 states have internal predecessors, (14550), 0 states have call successors, (0), 0 states 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:10,271 INFO L175 Difference]: Start difference. First operand has 203 places, 263 transitions, 2637 flow. Second operand 29 states and 5323 transitions. [2023-08-27 02:45:10,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 430 transitions, 6300 flow [2023-08-27 02:45:10,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 430 transitions, 5864 flow, removed 155 selfloop flow, removed 12 redundant places. [2023-08-27 02:45:10,347 INFO L231 Difference]: Finished difference. Result has 229 places, 310 transitions, 3507 flow [2023-08-27 02:45:10,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2209, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3507, PETRI_PLACES=229, PETRI_TRANSITIONS=310} [2023-08-27 02:45:10,348 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 170 predicate places. [2023-08-27 02:45:10,348 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 310 transitions, 3507 flow [2023-08-27 02:45:10,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 176.33333333333334) internal successors, (6348), 36 states have internal predecessors, (6348), 0 states have call successors, (0), 0 states 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:10,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:45:10,349 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:45:10,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-27 02:45:10,553 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:45:10,553 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:45:10,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:45:10,554 INFO L85 PathProgramCache]: Analyzing trace with hash 556475951, now seen corresponding path program 3 times [2023-08-27 02:45:10,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:45:10,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100820068] [2023-08-27 02:45:10,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:45:10,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:45:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:45:11,134 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:11,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:45:11,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100820068] [2023-08-27 02:45:11,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100820068] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:45:11,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649083959] [2023-08-27 02:45:11,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 02:45:11,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:45:11,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:45:11,137 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:45:11,141 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:45:11,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 02:45:11,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:45:11,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-27 02:45:11,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:45:11,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:11,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:11,353 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:45:11,354 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:11,369 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:45:11,370 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:11,449 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:11,530 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:11,643 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:45:11,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:11,690 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:11,776 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:11,885 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:45:12,003 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:12,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:45:12,029 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-27 02:45:12,131 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_912 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_912)) |c_~#stored_elements~0.base| v_ArrVal_914))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_912) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) |c_~#queue~0.offset|) v_ArrVal_916)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-08-27 02:45:12,206 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_910) .cse2 v_ArrVal_912)) |c_~#stored_elements~0.base| v_ArrVal_914))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_912) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_910) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) |c_~#queue~0.offset|) v_ArrVal_916)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-27 02:45:12,296 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_908 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_912 Int) (v_ArrVal_910 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_908)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_910) .cse4 v_ArrVal_912)) |c_~#stored_elements~0.base| v_ArrVal_914))) (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_65|) |c_~#queue~0.offset|) v_ArrVal_916)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_910) (< (+ (select .cse2 .cse4) 1) v_ArrVal_912) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|)))))) is different from false [2023-08-27 02:45:12,315 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_908 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_912 Int) (v_ArrVal_910 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_908)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_910) .cse1 v_ArrVal_912)) |c_~#stored_elements~0.base| v_ArrVal_914))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_912) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) |c_~#queue~0.offset|) v_ArrVal_916)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_~#queue~0.base|) .cse5) 2147483647) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) (< (+ (select .cse0 .cse5) 1) v_ArrVal_910))))))) is different from false [2023-08-27 02:45:12,360 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:12,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649083959] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:45:12,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:45:12,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-08-27 02:45:12,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007584310] [2023-08-27 02:45:12,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:45:12,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-27 02:45:12,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:45:12,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-27 02:45:12,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=671, Unknown=18, NotChecked=310, Total=1260 [2023-08-27 02:45:12,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:45:12,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 310 transitions, 3507 flow. Second operand has 36 states, 36 states have (on average 176.33333333333334) internal successors, (6348), 36 states have internal predecessors, (6348), 0 states have call successors, (0), 0 states 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:12,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:45:12,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:45:12,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:45:16,913 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:45:24,141 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:26,148 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,749 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_912 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_912)) |c_~#stored_elements~0.base| v_ArrVal_914))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_912) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) |c_~#queue~0.offset|) v_ArrVal_916)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_~#queue~0.base|) .cse5) 2147483647)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65| Int) (v_ArrVal_916 Int) (v_ArrVal_917 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) |c_~#queue~0.offset|) v_ArrVal_916)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_~#queue~0.base|) .cse5) 2147483647) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|)))))) is different from false [2023-08-27 02:45:26,797 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_912 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_912)) |c_~#stored_elements~0.base| v_ArrVal_914))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_912) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) |c_~#queue~0.offset|) v_ArrVal_916)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_~#queue~0.base|) .cse5) 2147483647))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_912 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_912)) |c_~#stored_elements~0.base| v_ArrVal_914))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_912) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) |c_~#queue~0.offset|) v_ArrVal_916)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_~#queue~0.base|) .cse5) 2147483647))))))) is different from false [2023-08-27 02:45:30,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:45:31,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:45:33,632 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:35,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:45:35,580 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65| Int) (v_ArrVal_916 Int) (v_ArrVal_917 (Array Int 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_65|) |c_~#queue~0.offset|) v_ArrVal_916)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_~#queue~0.base|) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_916 Int) (v_ArrVal_917 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_914))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|) |c_~#queue~0.offset|) v_ArrVal_916)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_~#queue~0.base|) .cse1) 2147483647) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_65|))))))) is different from false [2023-08-27 02:45:35,810 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_916 Int) (v_ArrVal_917 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (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_916)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)) (forall ((v_ArrVal_917 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)))) is different from false [2023-08-27 02:45:37,312 INFO L124 PetriNetUnfolderBase]: 3949/7610 cut-off events. [2023-08-27 02:45:37,312 INFO L125 PetriNetUnfolderBase]: For 240043/241519 co-relation queries the response was YES. [2023-08-27 02:45:37,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57058 conditions, 7610 events. 3949/7610 cut-off events. For 240043/241519 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 56476 event pairs, 1559 based on Foata normal form. 34/6969 useless extension candidates. Maximal degree in co-relation 56993. Up to 4361 conditions per place. [2023-08-27 02:45:37,369 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 321 selfloop transitions, 147 changer transitions 3/477 dead transitions. [2023-08-27 02:45:37,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 477 transitions, 8214 flow [2023-08-27 02:45:37,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-27 02:45:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-27 02:45:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4427 transitions. [2023-08-27 02:45:37,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38032646048109964 [2023-08-27 02:45:37,374 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4427 transitions. [2023-08-27 02:45:37,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4427 transitions. [2023-08-27 02:45:37,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:45:37,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4427 transitions. [2023-08-27 02:45:37,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 184.45833333333334) internal successors, (4427), 24 states have internal predecessors, (4427), 0 states have call successors, (0), 0 states 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:37,384 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:45:37,384 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:45:37,384 INFO L175 Difference]: Start difference. First operand has 229 places, 310 transitions, 3507 flow. Second operand 24 states and 4427 transitions. [2023-08-27 02:45:37,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 477 transitions, 8214 flow [2023-08-27 02:45:37,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 477 transitions, 7254 flow, removed 425 selfloop flow, removed 15 redundant places. [2023-08-27 02:45:37,599 INFO L231 Difference]: Finished difference. Result has 246 places, 360 transitions, 4396 flow [2023-08-27 02:45:37,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2833, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4396, PETRI_PLACES=246, PETRI_TRANSITIONS=360} [2023-08-27 02:45:37,599 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 187 predicate places. [2023-08-27 02:45:37,599 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 360 transitions, 4396 flow [2023-08-27 02:45:37,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 176.33333333333334) internal successors, (6348), 36 states have internal predecessors, (6348), 0 states have call successors, (0), 0 states 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:37,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:45:37,600 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:45:37,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-27 02:45:37,800 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:45:37,801 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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:37,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:45:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash 556475933, now seen corresponding path program 2 times [2023-08-27 02:45:37,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:45:37,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431010515] [2023-08-27 02:45:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:45:37,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:45:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:45:38,122 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:38,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:45:38,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431010515] [2023-08-27 02:45:38,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431010515] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:45:38,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390141022] [2023-08-27 02:45:38,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 02:45:38,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:45:38,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:45:38,124 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:45:38,126 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:45:38,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 02:45:38,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:45:38,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-27 02:45:38,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:45:38,290 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:45:38,291 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:38,400 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:38,452 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:38,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:38,479 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:38,520 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-27 02:45:38,520 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:38,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 02:45:38,574 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:38,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:45:38,769 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:45:38,770 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 62 treesize of output 53 [2023-08-27 02:45:38,776 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:45:38,777 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 93 treesize of output 97 [2023-08-27 02:45:38,783 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 80 treesize of output 72 [2023-08-27 02:45:38,788 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 43 treesize of output 39 [2023-08-27 02:45:38,816 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:45:38,839 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 02:45:38,839 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 47 treesize of output 47 [2023-08-27 02:45:38,946 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:38,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390141022] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:45:38,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:45:38,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-08-27 02:45:38,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385377884] [2023-08-27 02:45:38,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:45:38,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-27 02:45:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:45:38,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-27 02:45:38,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=587, Unknown=18, NotChecked=0, Total=756 [2023-08-27 02:45:38,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 485 [2023-08-27 02:45:38,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 360 transitions, 4396 flow. Second operand has 28 states, 28 states have (on average 177.71428571428572) internal successors, (4976), 28 states have internal predecessors, (4976), 0 states have call successors, (0), 0 states 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:38,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:45:38,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 485 [2023-08-27 02:45:38,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:45:40,460 INFO L124 PetriNetUnfolderBase]: 4036/7822 cut-off events. [2023-08-27 02:45:40,460 INFO L125 PetriNetUnfolderBase]: For 388743/390676 co-relation queries the response was YES. [2023-08-27 02:45:40,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65791 conditions, 7822 events. 4036/7822 cut-off events. For 388743/390676 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 58564 event pairs, 2033 based on Foata normal form. 50/7172 useless extension candidates. Maximal degree in co-relation 65717. Up to 6481 conditions per place. [2023-08-27 02:45:40,519 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 332 selfloop transitions, 53 changer transitions 3/394 dead transitions. [2023-08-27 02:45:40,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 394 transitions, 5580 flow [2023-08-27 02:45:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:45:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:45:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1144 transitions. [2023-08-27 02:45:40,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.393127147766323 [2023-08-27 02:45:40,520 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1144 transitions. [2023-08-27 02:45:40,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1144 transitions. [2023-08-27 02:45:40,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:45:40,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1144 transitions. [2023-08-27 02:45:40,522 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:40,523 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:40,523 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:40,523 INFO L175 Difference]: Start difference. First operand has 246 places, 360 transitions, 4396 flow. Second operand 6 states and 1144 transitions. [2023-08-27 02:45:40,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 394 transitions, 5580 flow [2023-08-27 02:45:40,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 394 transitions, 4831 flow, removed 318 selfloop flow, removed 15 redundant places. [2023-08-27 02:45:40,692 INFO L231 Difference]: Finished difference. Result has 232 places, 355 transitions, 3732 flow [2023-08-27 02:45:40,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=3566, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3732, PETRI_PLACES=232, PETRI_TRANSITIONS=355} [2023-08-27 02:45:40,692 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 173 predicate places. [2023-08-27 02:45:40,692 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 355 transitions, 3732 flow [2023-08-27 02:45:40,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 177.71428571428572) internal successors, (4976), 28 states have internal predecessors, (4976), 0 states have call successors, (0), 0 states 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:40,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:45:40,693 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:45:40,697 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:45:40,893 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:45:40,893 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:45:40,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:45:40,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2097698344, now seen corresponding path program 1 times [2023-08-27 02:45:40,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:45:40,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630164253] [2023-08-27 02:45:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:45:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:45:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:45:41,249 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:45:41,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:45:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630164253] [2023-08-27 02:45:41,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630164253] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:45:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429194823] [2023-08-27 02:45:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:45:41,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:45:41,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:45:41,250 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:45:41,252 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:45:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:45:41,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-27 02:45:41,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:45:41,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:41,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:41,408 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:45:41,409 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:41,416 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 02:45:41,416 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:45:41,487 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:41,532 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:45:41,622 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:45:41,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:41,661 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 35 treesize of output 37 [2023-08-27 02:45:41,762 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2023-08-27 02:45:41,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 45 treesize of output 40 [2023-08-27 02:45:42,073 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:45:42,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:45:42,137 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1105 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1103) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< 0 (+ 2147483650 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1105) .cse1)))))) is different from false [2023-08-27 02:45:42,539 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:45:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429194823] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:45:42,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:45:42,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2023-08-27 02:45:42,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208122171] [2023-08-27 02:45:42,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:45:42,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-27 02:45:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:45:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-27 02:45:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=495, Unknown=9, NotChecked=48, Total=702 [2023-08-27 02:45:42,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 02:45:42,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 355 transitions, 3732 flow. Second operand has 27 states, 27 states have (on average 186.0) internal successors, (5022), 27 states have internal predecessors, (5022), 0 states have call successors, (0), 0 states 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:42,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:45:42,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 02:45:42,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:45:49,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:45:50,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:45:54,646 INFO L124 PetriNetUnfolderBase]: 5970/11549 cut-off events. [2023-08-27 02:45:54,646 INFO L125 PetriNetUnfolderBase]: For 552832/554401 co-relation queries the response was YES. [2023-08-27 02:45:54,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94637 conditions, 11549 events. 5970/11549 cut-off events. For 552832/554401 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 90353 event pairs, 2405 based on Foata normal form. 139/10696 useless extension candidates. Maximal degree in co-relation 94565. Up to 4176 conditions per place. [2023-08-27 02:45:54,728 INFO L140 encePairwiseOnDemand]: 468/485 looper letters, 467 selfloop transitions, 163 changer transitions 4/640 dead transitions. [2023-08-27 02:45:54,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 640 transitions, 8816 flow [2023-08-27 02:45:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-27 02:45:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-27 02:45:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 5015 transitions. [2023-08-27 02:45:54,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39770023790642345 [2023-08-27 02:45:54,732 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 5015 transitions. [2023-08-27 02:45:54,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 5015 transitions. [2023-08-27 02:45:54,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:45:54,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 5015 transitions. [2023-08-27 02:45:54,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 192.8846153846154) internal successors, (5015), 26 states have internal predecessors, (5015), 0 states have call successors, (0), 0 states 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:54,742 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:45:54,743 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:45:54,743 INFO L175 Difference]: Start difference. First operand has 232 places, 355 transitions, 3732 flow. Second operand 26 states and 5015 transitions. [2023-08-27 02:45:54,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 640 transitions, 8816 flow [2023-08-27 02:45:55,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 640 transitions, 8706 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-08-27 02:45:55,040 INFO L231 Difference]: Finished difference. Result has 256 places, 411 transitions, 5077 flow [2023-08-27 02:45:55,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=3619, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5077, PETRI_PLACES=256, PETRI_TRANSITIONS=411} [2023-08-27 02:45:55,041 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 197 predicate places. [2023-08-27 02:45:55,041 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 411 transitions, 5077 flow [2023-08-27 02:45:55,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 186.0) internal successors, (5022), 27 states have internal predecessors, (5022), 0 states have call successors, (0), 0 states 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:55,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:45:55,042 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:45:55,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-27 02:45:55,242 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:45:55,242 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:45:55,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:45:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash -147603907, now seen corresponding path program 1 times [2023-08-27 02:45:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:45:55,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900025904] [2023-08-27 02:45:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:45:55,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:45:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:45:55,819 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:45:55,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:45:55,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900025904] [2023-08-27 02:45:55,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900025904] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:45:55,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724719300] [2023-08-27 02:45:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:45:55,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:45:55,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:45:55,821 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:45:55,857 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:45:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:45:55,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 75 conjunts are in the unsatisfiable core [2023-08-27 02:45:55,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:45:55,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:55,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:55,978 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:45:55,978 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:55,991 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:45:55,991 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:56,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-27 02:45:56,111 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:45:56,205 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:45:56,246 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:56,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:45:56,288 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:56,361 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:45:56,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-08-27 02:45:56,482 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:45:56,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:45:56,557 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1213 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1212) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1213)) .cse1)) 2147483647)) is different from false [2023-08-27 02:45:56,561 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1213 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1211) |c_~#stored_elements~0.base| v_ArrVal_1212) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1213)) .cse1)) 2147483647)) is different from false [2023-08-27 02:45:58,695 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1210 Int) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1213 Int) (v_ArrVal_1207 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1210) (< (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1207) .cse1 v_ArrVal_1210)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1211) |c_~#stored_elements~0.base| v_ArrVal_1212) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1213)) .cse3)) 2147483647)))) is different from false [2023-08-27 02:46:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 02:46:04,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724719300] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:46:04,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:46:04,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-27 02:46:04,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755843553] [2023-08-27 02:46:04,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:46:04,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-27 02:46:04,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:46:04,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-27 02:46:04,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=593, Unknown=18, NotChecked=168, Total=992 [2023-08-27 02:46:04,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 485 [2023-08-27 02:46:04,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 411 transitions, 5077 flow. Second operand has 32 states, 32 states have (on average 182.78125) internal successors, (5849), 32 states have internal predecessors, (5849), 0 states have call successors, (0), 0 states 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:46:04,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:46:04,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 485 [2023-08-27 02:46:04,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:46:23,786 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1213 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1211) |c_~#stored_elements~0.base| v_ArrVal_1212) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1213)) .cse1) 2147483647)) (forall ((v_ArrVal_1213 Int)) (< (select (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1213)) .cse1) 2147483647)))) is different from false [2023-08-27 02:46:32,774 INFO L124 PetriNetUnfolderBase]: 6611/12843 cut-off events. [2023-08-27 02:46:32,775 INFO L125 PetriNetUnfolderBase]: For 628981/631152 co-relation queries the response was YES. [2023-08-27 02:46:32,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109324 conditions, 12843 events. 6611/12843 cut-off events. For 628981/631152 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 102739 event pairs, 2597 based on Foata normal form. 152/11891 useless extension candidates. Maximal degree in co-relation 109248. Up to 8429 conditions per place. [2023-08-27 02:46:32,875 INFO L140 encePairwiseOnDemand]: 462/485 looper letters, 470 selfloop transitions, 168 changer transitions 3/647 dead transitions. [2023-08-27 02:46:32,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 647 transitions, 11520 flow [2023-08-27 02:46:32,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-27 02:46:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-27 02:46:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5344 transitions. [2023-08-27 02:46:32,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.393519882179676 [2023-08-27 02:46:32,879 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5344 transitions. [2023-08-27 02:46:32,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5344 transitions. [2023-08-27 02:46:32,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:46:32,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5344 transitions. [2023-08-27 02:46:32,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 190.85714285714286) internal successors, (5344), 28 states have internal predecessors, (5344), 0 states have call successors, (0), 0 states 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:46:32,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 485.0) internal successors, (14065), 29 states have internal predecessors, (14065), 0 states have call successors, (0), 0 states 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:46:32,891 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 485.0) internal successors, (14065), 29 states have internal predecessors, (14065), 0 states have call successors, (0), 0 states 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:46:32,891 INFO L175 Difference]: Start difference. First operand has 256 places, 411 transitions, 5077 flow. Second operand 28 states and 5344 transitions. [2023-08-27 02:46:32,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 647 transitions, 11520 flow [2023-08-27 02:46:33,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 647 transitions, 11394 flow, removed 41 selfloop flow, removed 14 redundant places. [2023-08-27 02:46:33,406 INFO L231 Difference]: Finished difference. Result has 284 places, 471 transitions, 6782 flow [2023-08-27 02:46:33,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=4706, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=6782, PETRI_PLACES=284, PETRI_TRANSITIONS=471} [2023-08-27 02:46:33,407 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 225 predicate places. [2023-08-27 02:46:33,407 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 471 transitions, 6782 flow [2023-08-27 02:46:33,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 182.78125) internal successors, (5849), 32 states have internal predecessors, (5849), 0 states have call successors, (0), 0 states 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:46:33,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:46:33,407 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:46:33,413 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:46:33,608 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:46:33,609 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:46:33,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:46:33,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1250548867, now seen corresponding path program 1 times [2023-08-27 02:46:33,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:46:33,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71842401] [2023-08-27 02:46:33,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:46:33,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:46:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:46:33,994 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:46:33,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:46:33,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71842401] [2023-08-27 02:46:33,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71842401] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:46:33,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666387324] [2023-08-27 02:46:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:46:33,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:46:33,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:46:33,995 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:46:33,996 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:46:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:46:34,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-27 02:46:34,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:46:34,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:46:34,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:46:34,155 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:46:34,155 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:46:34,170 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:46:34,170 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:46:34,250 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:46:34,298 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:46:34,394 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:46:34,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:46:34,440 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:46:34,486 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:46:34,568 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:46:34,669 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:46:34,776 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:46:34,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:46:34,887 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1322 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1320) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1321) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) (< 0 (+ (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_1322) .cse1) 2147483650))))) is different from false [2023-08-27 02:46:35,008 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1322 Int) (v_ArrVal_1316 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_94| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1316) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_94| 1))) |c_~#stored_elements~0.base| v_ArrVal_1320) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1321) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_94|) (< (+ 2147483649 |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_94|) 0) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) (< 0 (+ 2147483650 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_1322) .cse3))))))) is different from false [2023-08-27 02:46:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 02:46:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666387324] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:46:35,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:46:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-27 02:46:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839229550] [2023-08-27 02:46:35,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:46:35,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-27 02:46:35,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:46:35,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-27 02:46:35,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=581, Unknown=7, NotChecked=106, Total=870 [2023-08-27 02:46:35,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 485 [2023-08-27 02:46:35,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 471 transitions, 6782 flow. Second operand has 30 states, 30 states have (on average 182.0) internal successors, (5460), 30 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states 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:46:35,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:46:35,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 485 [2023-08-27 02:46:35,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:46:41,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:46:43,081 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:46:45,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:46:47,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:46:49,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:46:53,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 02:46:55,758 INFO L124 PetriNetUnfolderBase]: 7143/14028 cut-off events. [2023-08-27 02:46:55,758 INFO L125 PetriNetUnfolderBase]: For 837941/838276 co-relation queries the response was YES. [2023-08-27 02:46:55,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131724 conditions, 14028 events. 7143/14028 cut-off events. For 837941/838276 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 113730 event pairs, 2520 based on Foata normal form. 226/13094 useless extension candidates. Maximal degree in co-relation 131635. Up to 6029 conditions per place. [2023-08-27 02:46:55,980 INFO L140 encePairwiseOnDemand]: 461/485 looper letters, 371 selfloop transitions, 314 changer transitions 3/694 dead transitions. [2023-08-27 02:46:55,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 694 transitions, 13681 flow [2023-08-27 02:46:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-27 02:46:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-27 02:46:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5509 transitions. [2023-08-27 02:46:55,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39168147884820476 [2023-08-27 02:46:55,984 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5509 transitions. [2023-08-27 02:46:55,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5509 transitions. [2023-08-27 02:46:55,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:46:55,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5509 transitions. [2023-08-27 02:46:55,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 189.9655172413793) internal successors, (5509), 29 states have internal predecessors, (5509), 0 states have call successors, (0), 0 states 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:46:55,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 485.0) internal successors, (14550), 30 states have internal predecessors, (14550), 0 states have call successors, (0), 0 states 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:46:55,995 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 485.0) internal successors, (14550), 30 states have internal predecessors, (14550), 0 states have call successors, (0), 0 states 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:46:55,995 INFO L175 Difference]: Start difference. First operand has 284 places, 471 transitions, 6782 flow. Second operand 29 states and 5509 transitions. [2023-08-27 02:46:55,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 694 transitions, 13681 flow [2023-08-27 02:46:56,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 694 transitions, 12983 flow, removed 294 selfloop flow, removed 17 redundant places. [2023-08-27 02:46:56,400 INFO L231 Difference]: Finished difference. Result has 302 places, 537 transitions, 8770 flow [2023-08-27 02:46:56,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=5513, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=8770, PETRI_PLACES=302, PETRI_TRANSITIONS=537} [2023-08-27 02:46:56,401 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 243 predicate places. [2023-08-27 02:46:56,401 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 537 transitions, 8770 flow [2023-08-27 02:46:56,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 182.0) internal successors, (5460), 30 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states 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:46:56,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:46:56,401 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:46:56,409 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:46:56,602 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,SelfDestructingSolverStorable20 [2023-08-27 02:46:56,602 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:46:56,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:46:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash 923823039, now seen corresponding path program 1 times [2023-08-27 02:46:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:46:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099565394] [2023-08-27 02:46:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:46:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:46:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:46:56,633 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:46:56,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:46:56,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099565394] [2023-08-27 02:46:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099565394] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:46:56,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:46:56,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:46:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126459742] [2023-08-27 02:46:56,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:46:56,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:46:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:46:56,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:46:56,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:46:56,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:46:56,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 537 transitions, 8770 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:46:56,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:46:56,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:46:56,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:46:59,584 INFO L124 PetriNetUnfolderBase]: 6911/13447 cut-off events. [2023-08-27 02:46:59,584 INFO L125 PetriNetUnfolderBase]: For 993576/998441 co-relation queries the response was YES. [2023-08-27 02:46:59,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136883 conditions, 13447 events. 6911/13447 cut-off events. For 993576/998441 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 108076 event pairs, 4022 based on Foata normal form. 79/12413 useless extension candidates. Maximal degree in co-relation 136787. Up to 8599 conditions per place. [2023-08-27 02:46:59,708 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 444 selfloop transitions, 51 changer transitions 0/526 dead transitions. [2023-08-27 02:46:59,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 526 transitions, 9663 flow [2023-08-27 02:46:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:46:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:46:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2023-08-27 02:46:59,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072164948453608 [2023-08-27 02:46:59,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2023-08-27 02:46:59,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2023-08-27 02:46:59,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:46:59,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2023-08-27 02:46:59,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states 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:46:59,711 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:46:59,711 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:46:59,711 INFO L175 Difference]: Start difference. First operand has 302 places, 537 transitions, 8770 flow. Second operand 3 states and 738 transitions. [2023-08-27 02:46:59,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 526 transitions, 9663 flow [2023-08-27 02:47:00,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 526 transitions, 8795 flow, removed 390 selfloop flow, removed 12 redundant places. [2023-08-27 02:47:00,424 INFO L231 Difference]: Finished difference. Result has 291 places, 514 transitions, 7592 flow [2023-08-27 02:47:00,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7490, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7592, PETRI_PLACES=291, PETRI_TRANSITIONS=514} [2023-08-27 02:47:00,424 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 232 predicate places. [2023-08-27 02:47:00,424 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 514 transitions, 7592 flow [2023-08-27 02:47:00,424 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:47:00,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:47:00,424 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:47:00,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-27 02:47:00,425 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:47:00,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:47:00,425 INFO L85 PathProgramCache]: Analyzing trace with hash 923823037, now seen corresponding path program 1 times [2023-08-27 02:47:00,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:47:00,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983083851] [2023-08-27 02:47:00,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:47:00,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:47:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:47:00,451 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:47:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:47:00,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983083851] [2023-08-27 02:47:00,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983083851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:47:00,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:47:00,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 02:47:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779801445] [2023-08-27 02:47:00,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:47:00,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:47:00,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:47:00,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:47:00,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:47:00,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:47:00,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 514 transitions, 7592 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:47:00,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:47:00,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:47:00,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:47:03,131 INFO L124 PetriNetUnfolderBase]: 6723/13131 cut-off events. [2023-08-27 02:47:03,131 INFO L125 PetriNetUnfolderBase]: For 948406/951106 co-relation queries the response was YES. [2023-08-27 02:47:03,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127915 conditions, 13131 events. 6723/13131 cut-off events. For 948406/951106 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 105186 event pairs, 3919 based on Foata normal form. 184/12288 useless extension candidates. Maximal degree in co-relation 127821. Up to 12254 conditions per place. [2023-08-27 02:47:03,254 INFO L140 encePairwiseOnDemand]: 483/485 looper letters, 462 selfloop transitions, 1 changer transitions 3/497 dead transitions. [2023-08-27 02:47:03,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 497 transitions, 8325 flow [2023-08-27 02:47:03,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:47:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:47:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2023-08-27 02:47:03,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079037800687285 [2023-08-27 02:47:03,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 739 transitions. [2023-08-27 02:47:03,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 739 transitions. [2023-08-27 02:47:03,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:47:03,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 739 transitions. [2023-08-27 02:47:03,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states 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:03,257 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:47:03,258 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:47:03,258 INFO L175 Difference]: Start difference. First operand has 291 places, 514 transitions, 7592 flow. Second operand 3 states and 739 transitions. [2023-08-27 02:47:03,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 497 transitions, 8325 flow [2023-08-27 02:47:03,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 497 transitions, 8221 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-08-27 02:47:03,734 INFO L231 Difference]: Finished difference. Result has 288 places, 489 transitions, 7078 flow [2023-08-27 02:47:03,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=7076, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7078, PETRI_PLACES=288, PETRI_TRANSITIONS=489} [2023-08-27 02:47:03,734 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 229 predicate places. [2023-08-27 02:47:03,734 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 489 transitions, 7078 flow [2023-08-27 02:47:03,734 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:47:03,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:47:03,734 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:47:03,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-27 02:47:03,735 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:47:03,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:47:03,735 INFO L85 PathProgramCache]: Analyzing trace with hash -166271195, now seen corresponding path program 1 times [2023-08-27 02:47:03,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:47:03,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106183864] [2023-08-27 02:47:03,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:47:03,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:47:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:47:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 02:47:03,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:47:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106183864] [2023-08-27 02:47:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106183864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 02:47:03,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 02:47:03,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 02:47:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926161655] [2023-08-27 02:47:03,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 02:47:03,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 02:47:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:47:03,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 02:47:03,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 02:47:03,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 485 [2023-08-27 02:47:03,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 489 transitions, 7078 flow. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:03,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:47:03,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 485 [2023-08-27 02:47:03,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:47:06,083 INFO L124 PetriNetUnfolderBase]: 5311/10811 cut-off events. [2023-08-27 02:47:06,083 INFO L125 PetriNetUnfolderBase]: For 651521/651521 co-relation queries the response was YES. [2023-08-27 02:47:06,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87098 conditions, 10811 events. 5311/10811 cut-off events. For 651521/651521 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 80746 event pairs, 473 based on Foata normal form. 600/10455 useless extension candidates. Maximal degree in co-relation 87005. Up to 9473 conditions per place. [2023-08-27 02:47:06,159 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 434 selfloop transitions, 4 changer transitions 0/467 dead transitions. [2023-08-27 02:47:06,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 467 transitions, 7911 flow [2023-08-27 02:47:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 02:47:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 02:47:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2023-08-27 02:47:06,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010309278350515 [2023-08-27 02:47:06,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 729 transitions. [2023-08-27 02:47:06,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 729 transitions. [2023-08-27 02:47:06,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:47:06,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 729 transitions. [2023-08-27 02:47:06,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 states 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:06,163 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:47:06,163 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:47:06,163 INFO L175 Difference]: Start difference. First operand has 288 places, 489 transitions, 7078 flow. Second operand 3 states and 729 transitions. [2023-08-27 02:47:06,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 467 transitions, 7911 flow [2023-08-27 02:47:06,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 467 transitions, 7898 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-27 02:47:06,424 INFO L231 Difference]: Finished difference. Result has 289 places, 454 transitions, 6793 flow [2023-08-27 02:47:06,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=6785, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=6793, PETRI_PLACES=289, PETRI_TRANSITIONS=454} [2023-08-27 02:47:06,424 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 230 predicate places. [2023-08-27 02:47:06,424 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 454 transitions, 6793 flow [2023-08-27 02:47:06,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:06,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:47:06,425 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 02:47:06,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-27 02:47:06,425 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:47:06,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:47:06,425 INFO L85 PathProgramCache]: Analyzing trace with hash 535708732, now seen corresponding path program 4 times [2023-08-27 02:47:06,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:47:06,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083265023] [2023-08-27 02:47:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:47:06,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:47:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:47:07,517 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:47:07,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:47:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083265023] [2023-08-27 02:47:07,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083265023] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:47:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863132604] [2023-08-27 02:47:07,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 02:47:07,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:47:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:47:07,519 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:47:07,521 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:47:07,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 02:47:07,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 02:47:07,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 99 conjunts are in the unsatisfiable core [2023-08-27 02:47:07,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:47:07,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:47:07,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:47:07,683 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:47:07,684 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:47:07,696 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:47:07,696 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:47:07,785 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:07,870 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:07,995 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:08,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:47:08,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:47:08,146 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:09,010 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 45 treesize of output 45 [2023-08-27 02:47:09,100 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:47:09,480 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:47:09,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:47:09,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-08-27 02:47:12,008 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:47:23,963 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:47:23,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:47:24,042 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1578 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:47:24,054 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1577 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1577) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 02:47:24,200 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse3))) (or (= .cse0 20) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1574 Int) (v_ArrVal_1577 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1574) .cse3 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1577) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1574))))))) is different from false [2023-08-27 02:47:24,240 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1574 Int) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1577 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1573))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1574) .cse3 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|)) (.cse1 (select .cse2 .cse3))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse1 1) v_ArrVal_1577) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1574) (= .cse1 20)))))) is different from false [2023-08-27 02:47:24,351 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1572 Int) (v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1574 Int) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1577 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_1572))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1573))) (let ((.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse5 .cse6)) (.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse3 v_ArrVal_1574) .cse6 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ .cse1 1) v_ArrVal_1577) (= .cse1 20) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1574) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) (+ 88 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-08-27 02:47:24,378 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1572 Int) (v_ArrVal_1578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1574 Int) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1577 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1572))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1573))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse7 .cse2)) (.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1574) .cse2 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1577) (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1574) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) .cse4) 2147483647) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|)))))))) is different from false [2023-08-27 02:47:24,407 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1572 Int) (v_ArrVal_1578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1574 Int) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1577 Int) (v_ArrVal_1570 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1570))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1572))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1573))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse7 .cse4)) (.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1574) .cse4 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) .cse1) 2147483647) (= .cse2 20) (< (+ .cse2 1) v_ArrVal_1577) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1574))))))))) is different from false [2023-08-27 02:47:24,443 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1572 Int) (v_ArrVal_1578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1574 Int) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1577 Int) (v_ArrVal_1569 Int) (v_ArrVal_1570 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1569)) |c_~#stored_elements~0.base| v_ArrVal_1570))) (let ((.cse1 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1572))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1573))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse7 .cse2)) (.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1574) .cse2 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1577) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1574) (= .cse0 20) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1569) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) .cse4) 2147483647))))))))) is different from false [2023-08-27 02:47:24,483 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1572 Int) (v_ArrVal_1578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1574 Int) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1577 Int) (v_ArrVal_1569 Int) (v_ArrVal_1570 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1569)) |c_~#stored_elements~0.base| v_ArrVal_1570))) (let ((.cse1 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1572))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1573))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse8 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse9 .cse2)) (.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1574) .cse2 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1577) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1574) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1569) (= .cse0 20) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) .cse4) 2147483647)))))))))) is different from false [2023-08-27 02:47:24,567 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1572 Int) (v_ArrVal_1578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1574 Int) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1567 Int) (v_ArrVal_1577 Int) (v_ArrVal_1569 Int) (v_ArrVal_1570 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1567) .cse7 v_ArrVal_1569)) |c_~#stored_elements~0.base| v_ArrVal_1570))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1572))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1573))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_1574) .cse3 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|)) (.cse4 (select .cse8 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1574) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1567) (< (+ .cse4 1) v_ArrVal_1577) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1569) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) .cse1) 2147483647) (= .cse4 20)))))))))) is different from false [2023-08-27 02:47:24,616 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1572 Int) (v_ArrVal_1578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1574 Int) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1567 Int) (v_ArrVal_1577 Int) (v_ArrVal_1569 Int) (v_ArrVal_1570 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1567) .cse8 v_ArrVal_1569)) |c_~#stored_elements~0.base| v_ArrVal_1570))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1572))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1573))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_1574) .cse3 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|)) (.cse4 (select .cse9 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1574) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ .cse4 1) v_ArrVal_1577) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1567) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse5 .cse8) 1) v_ArrVal_1569) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) .cse1) 2147483647) (= .cse4 20)))))))))) is different from false [2023-08-27 02:47:24,668 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1570 (Array Int Int)) (v_ArrVal_1580 Int) (v_ArrVal_1572 Int) (v_ArrVal_1574 Int) (v_ArrVal_1564 Int) (v_ArrVal_1567 Int) (v_ArrVal_1577 Int) (v_ArrVal_1569 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_1564)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1567) .cse4 v_ArrVal_1569)) |c_~#stored_elements~0.base| v_ArrVal_1570))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|)) v_ArrVal_1572))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1573))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse10 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (select .cse10 .cse1)) (.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_1574) .cse1 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1567) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1569) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) .cse6) 2147483647) (< (+ 1 (select .cse7 .cse6)) v_ArrVal_1574) (< (+ .cse8 1) v_ArrVal_1577) (= .cse8 20) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|)))))))))) is different from false [2023-08-27 02:47:33,046 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:47:33,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863132604] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:47:33,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:47:33,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 54 [2023-08-27 02:47:33,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549318560] [2023-08-27 02:47:33,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:47:33,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-08-27 02:47:33,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:47:33,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-08-27 02:47:33,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1424, Unknown=29, NotChecked=1140, Total=3080 [2023-08-27 02:47:33,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:47:33,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 454 transitions, 6793 flow. Second operand has 56 states, 56 states have (on average 176.28571428571428) internal successors, (9872), 56 states have internal predecessors, (9872), 0 states have call successors, (0), 0 states 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:33,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:47:33,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:47:33,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:47:35,746 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:47:39,051 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:47:47,543 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:47:54,046 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:47:58,045 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:48:00,058 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:48:06,342 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:48:20,026 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:48:30,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 02:48:37,439 WARN L234 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 198 DAG size of output: 169 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:48:39,592 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:41,661 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:48:56,492 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,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:49:17,803 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:34,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:49:39,256 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:43,658 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:49:45,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:50:01,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 [0, 1] [2023-08-27 02:50:18,872 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:20,905 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,450 WARN L234 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 114 DAG size of output: 111 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:50:39,490 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:41,538 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,800 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:55,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:50:57,743 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:05,048 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1577 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1577) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_1580 Int) (v_ArrVal_1578 (Array Int Int)) (v_ArrVal_1577 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1577)) |c_~#stored_elements~0.base| v_ArrVal_1578) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_1577) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_1580) .cse2) 2147483647)))))) is different from false [2023-08-27 02:51:07,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:51:09,682 INFO L124 PetriNetUnfolderBase]: 5890/12126 cut-off events. [2023-08-27 02:51:09,682 INFO L125 PetriNetUnfolderBase]: For 647371/647682 co-relation queries the response was YES. [2023-08-27 02:51:09,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98179 conditions, 12126 events. 5890/12126 cut-off events. For 647371/647682 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 94310 event pairs, 2941 based on Foata normal form. 34/11056 useless extension candidates. Maximal degree in co-relation 98086. Up to 7677 conditions per place. [2023-08-27 02:51:09,815 INFO L140 encePairwiseOnDemand]: 467/485 looper letters, 402 selfloop transitions, 305 changer transitions 3/716 dead transitions. [2023-08-27 02:51:09,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 716 transitions, 15040 flow [2023-08-27 02:51:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-08-27 02:51:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-08-27 02:51:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 8179 transitions. [2023-08-27 02:51:09,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3747537227949599 [2023-08-27 02:51:09,823 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 8179 transitions. [2023-08-27 02:51:09,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 8179 transitions. [2023-08-27 02:51:09,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:51:09,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 8179 transitions. [2023-08-27 02:51:09,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 181.75555555555556) internal successors, (8179), 45 states have internal predecessors, (8179), 0 states have call successors, (0), 0 states 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:51:09,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 485.0) internal successors, (22310), 46 states have internal predecessors, (22310), 0 states have call successors, (0), 0 states 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:51:09,843 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 485.0) internal successors, (22310), 46 states have internal predecessors, (22310), 0 states have call successors, (0), 0 states 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:51:09,843 INFO L175 Difference]: Start difference. First operand has 289 places, 454 transitions, 6793 flow. Second operand 45 states and 8179 transitions. [2023-08-27 02:51:09,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 716 transitions, 15040 flow [2023-08-27 02:51:10,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 716 transitions, 15032 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 02:51:10,291 INFO L231 Difference]: Finished difference. Result has 358 places, 561 transitions, 10409 flow [2023-08-27 02:51:10,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=6789, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=10409, PETRI_PLACES=358, PETRI_TRANSITIONS=561} [2023-08-27 02:51:10,291 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 299 predicate places. [2023-08-27 02:51:10,291 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 561 transitions, 10409 flow [2023-08-27 02:51:10,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 176.28571428571428) internal successors, (9872), 56 states have internal predecessors, (9872), 0 states have call successors, (0), 0 states 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:51:10,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:51:10,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:51:10,301 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:51:10,496 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,SelfDestructingSolverStorable24 [2023-08-27 02:51:10,497 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:51:10,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:51:10,497 INFO L85 PathProgramCache]: Analyzing trace with hash 98993393, now seen corresponding path program 1 times [2023-08-27 02:51:10,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:51:10,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691005387] [2023-08-27 02:51:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:51:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:51:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:51:10,530 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:51:10,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:51:10,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691005387] [2023-08-27 02:51:10,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691005387] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:51:10,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961656285] [2023-08-27 02:51:10,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:51:10,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:51:10,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:51:10,531 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:51:10,533 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:51:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:51:10,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 02:51:10,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:51:10,715 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:51:10,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:51:10,733 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:51:10,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961656285] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:51:10,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:51:10,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-27 02:51:10,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001522121] [2023-08-27 02:51:10,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:51:10,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 02:51:10,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:51:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 02:51:10,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 02:51:10,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 02:51:10,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 561 transitions, 10409 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:51:10,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:51:10,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 02:51:10,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:51:12,524 INFO L124 PetriNetUnfolderBase]: 3351/7047 cut-off events. [2023-08-27 02:51:12,524 INFO L125 PetriNetUnfolderBase]: For 657815/657854 co-relation queries the response was YES. [2023-08-27 02:51:12,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77541 conditions, 7047 events. 3351/7047 cut-off events. For 657815/657854 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 47477 event pairs, 1998 based on Foata normal form. 128/6647 useless extension candidates. Maximal degree in co-relation 77422. Up to 4290 conditions per place. [2023-08-27 02:51:12,610 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 523 selfloop transitions, 43 changer transitions 0/609 dead transitions. [2023-08-27 02:51:12,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 609 transitions, 13150 flow [2023-08-27 02:51:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 02:51:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 02:51:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1460 transitions. [2023-08-27 02:51:12,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017182130584192 [2023-08-27 02:51:12,611 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1460 transitions. [2023-08-27 02:51:12,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1460 transitions. [2023-08-27 02:51:12,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 02:51:12,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1460 transitions. [2023-08-27 02:51:12,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 243.33333333333334) internal successors, (1460), 6 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states 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:51:12,614 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:51:12,615 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:51:12,615 INFO L175 Difference]: Start difference. First operand has 358 places, 561 transitions, 10409 flow. Second operand 6 states and 1460 transitions. [2023-08-27 02:51:12,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 609 transitions, 13150 flow [2023-08-27 02:51:13,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 609 transitions, 11552 flow, removed 587 selfloop flow, removed 18 redundant places. [2023-08-27 02:51:13,119 INFO L231 Difference]: Finished difference. Result has 349 places, 549 transitions, 8878 flow [2023-08-27 02:51:13,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=8481, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8878, PETRI_PLACES=349, PETRI_TRANSITIONS=549} [2023-08-27 02:51:13,119 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 290 predicate places. [2023-08-27 02:51:13,120 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 549 transitions, 8878 flow [2023-08-27 02:51:13,120 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:51:13,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 02:51:13,120 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:51:13,124 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:51:13,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-27 02:51:13,320 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 02:51:13,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 02:51:13,321 INFO L85 PathProgramCache]: Analyzing trace with hash 52085171, now seen corresponding path program 1 times [2023-08-27 02:51:13,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 02:51:13,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723680051] [2023-08-27 02:51:13,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:51:13,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 02:51:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:51:14,362 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:51:14,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 02:51:14,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723680051] [2023-08-27 02:51:14,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723680051] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 02:51:14,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585166454] [2023-08-27 02:51:14,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 02:51:14,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 02:51:14,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 02:51:14,363 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 02:51:14,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-27 02:51:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 02:51:14,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 96 conjunts are in the unsatisfiable core [2023-08-27 02:51:14,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 02:51:14,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:51:14,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:51:14,539 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 02:51:14,539 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:51:14,554 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 02:51:14,554 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:51:14,644 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:51:14,740 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:51:14,882 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:51:14,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:51:14,942 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:51:15,042 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:51:15,252 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:51:15,635 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:51:15,852 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:51:16,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 02:51:16,557 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:51:17,760 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:51:28,401 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:51:28,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 02:51:28,816 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1788 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1785)))))) is different from false [2023-08-27 02:51:28,844 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1781 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1788 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|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1781)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1785) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1781) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-27 02:51:28,866 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1781 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1788 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1781)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse2 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1781) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1785) (< (select .cse4 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) (+ 88 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-08-27 02:51:28,887 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1781 Int) (v_ArrVal_1780 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1788 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_1780)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1781)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1781) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1785))))))) is different from false [2023-08-27 02:51:28,910 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1781 Int) (v_ArrVal_1780 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1788 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_1780)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_1781)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1785) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1781) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|)))))))) is different from false [2023-08-27 02:51:28,932 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1788 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1778))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_1780)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_1781)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) .cse1) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1781) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1785))))))))) is different from false [2023-08-27 02:51:28,977 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1777 Int) (v_ArrVal_1788 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1777)) |c_~#stored_elements~0.base| v_ArrVal_1778))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_1780)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1781)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1781) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1785) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) .cse1) 2147483647) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1777))))))))) is different from false [2023-08-27 02:51:29,012 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1777 Int) (v_ArrVal_1788 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1777)) |c_~#stored_elements~0.base| v_ArrVal_1778))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_1780)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1781)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1781) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1777) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1785) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) .cse1) 2147483647) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|)))))))))) is different from false [2023-08-27 02:51:29,087 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1774 Int) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1777 Int) (v_ArrVal_1788 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1774) .cse3 v_ArrVal_1777)) |c_~#stored_elements~0.base| v_ArrVal_1778))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_1780)) (.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse7 .cse5 v_ArrVal_1781)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store .cse6 .cse1 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1777) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) .cse5) 2147483647) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1785) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1781) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1774)))))))))) is different from false [2023-08-27 02:51:29,135 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1774 Int) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1777 Int) (v_ArrVal_1788 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse6 v_ArrVal_1774) .cse3 v_ArrVal_1777)) |c_~#stored_elements~0.base| v_ArrVal_1778))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_1780)) (.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse8 .cse5 v_ArrVal_1781)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1777) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) .cse5) 2147483647) (< (+ (select .cse2 .cse6) 1) v_ArrVal_1774) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1785) (< (+ (select .cse8 .cse5) 1) v_ArrVal_1781)))))))))) is different from false [2023-08-27 02:51:29,182 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int) (v_ArrVal_1772 Int) (v_ArrVal_1774 Int) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1777 Int) (v_ArrVal_1788 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_1772)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1774) .cse7 v_ArrVal_1777)) |c_~#stored_elements~0.base| v_ArrVal_1778))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_1780)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1781)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store .cse5 .cse6 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1781) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1774) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) .cse1) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1785) (< (+ (select .cse2 .cse7) 1) v_ArrVal_1777) (< (select .cse4 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (select .cse8 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|)))))))))) is different from false [2023-08-27 02:51:35,527 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:51:35,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585166454] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 02:51:35,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 02:51:35,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 53 [2023-08-27 02:51:35,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942978661] [2023-08-27 02:51:35,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 02:51:35,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-08-27 02:51:35,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 02:51:35,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-08-27 02:51:35,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=1411, Unknown=32, NotChecked=1034, Total=2970 [2023-08-27 02:51:35,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 02:51:35,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 549 transitions, 8878 flow. Second operand has 55 states, 55 states have (on average 176.36363636363637) internal successors, (9700), 55 states have internal predecessors, (9700), 0 states have call successors, (0), 0 states 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:51:35,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 02:51:35,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 02:51:35,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 02:51:49,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:51:54,954 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:51:58,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 02:52:00,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] [2023-08-27 02:52:06,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 02:52:08,673 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:52:25,923 WARN L234 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 135 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:52:27,925 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:52:29,952 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:52:36,457 WARN L234 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 121 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:52:38,468 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:52:40,865 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:52:57,158 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:59,328 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:01,335 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:53:03,342 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:53:15,805 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:17,812 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:53:19,819 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:53:21,827 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:53:23,834 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:53:25,844 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:53:27,851 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:53:29,858 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:53:31,875 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:42,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 02:53:56,667 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:58,682 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:00,691 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:54:02,706 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:04,717 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:54:06,726 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:54:08,735 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:54:10,745 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:54:12,991 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:54:15,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:54:17,108 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:54:19,117 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:54:21,132 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:54:23,184 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:34,069 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:51,441 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:22,309 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:24,336 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:45,224 WARN L234 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 165 DAG size of output: 163 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 02:55:53,712 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:55,721 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:55,991 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1777 Int) (v_ArrVal_1788 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1777)) |c_~#stored_elements~0.base| v_ArrVal_1778))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_1780))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1781)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1781) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1777) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1785) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) .cse1) 2147483647) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|)))))))))) (forall ((v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| Int) (v_ArrVal_1788 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1783))) (let ((.cse11 (select .cse12 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse10 (select (store (store .cse12 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse3 v_ArrVal_1785)) |c_~#stored_elements~0.base| v_ArrVal_1786) |c_~#queue~0.base|))) (or (< (select .cse10 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106|) (< (select (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_106| 4) |c_~#queue~0.offset|) v_ArrVal_1788) .cse1) 2147483647) (< (+ (select .cse11 .cse3) 1) v_ArrVal_1785)))))))) is different from false [2023-08-27 02:56:49,788 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:56:51,802 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:56:53,811 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:56:55,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:56:58,658 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:56:59,400 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 02:56:59,434 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:57:00,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 02:57:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-27 02:57:00,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 29 remaining) [2023-08-27 02:57:00,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-27 02:57:00,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-27 02:57:00,511 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). [2023-08-27 02:57:00,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (27 of 29 remaining) [2023-08-27 02:57:00,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 29 remaining) [2023-08-27 02:57:00,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 29 remaining) [2023-08-27 02:57:00,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2023-08-27 02:57:00,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2023-08-27 02:57:00,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2023-08-27 02:57:00,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2023-08-27 02:57:00,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2023-08-27 02:57:00,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2023-08-27 02:57:00,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2023-08-27 02:57:00,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONASSERT (12 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2023-08-27 02:57:00,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2023-08-27 02:57:00,515 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONASSERT (0 of 29 remaining) [2023-08-27 02:57:00,515 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 02:57:00,518 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 02:57:00,518 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 02:57:00,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 02:57:00 BasicIcfg [2023-08-27 02:57:00,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 02:57:00,519 INFO L158 Benchmark]: Toolchain (without parser) took 858750.63ms. Allocated memory was 348.1MB in the beginning and 3.9GB in the end (delta: 3.5GB). Free memory was 322.2MB in the beginning and 2.0GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-27 02:57:00,520 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 348.1MB. Free memory was 325.9MB in the beginning and 325.8MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 02:57:00,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.49ms. Allocated memory is still 348.1MB. Free memory was 322.2MB in the beginning and 292.0MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-27 02:57:00,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.47ms. Allocated memory is still 348.1MB. Free memory was 292.0MB in the beginning and 289.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 02:57:00,520 INFO L158 Benchmark]: Boogie Preprocessor took 48.79ms. Allocated memory is still 348.1MB. Free memory was 289.5MB in the beginning and 287.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 02:57:00,520 INFO L158 Benchmark]: RCFGBuilder took 383.03ms. Allocated memory is still 348.1MB. Free memory was 287.4MB in the beginning and 264.7MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 02:57:00,520 INFO L158 Benchmark]: TraceAbstraction took 857835.72ms. Allocated memory was 348.1MB in the beginning and 3.9GB in the end (delta: 3.5GB). Free memory was 263.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-08-27 02:57:00,521 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 348.1MB. Free memory was 325.9MB in the beginning and 325.8MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 426.49ms. Allocated memory is still 348.1MB. Free memory was 322.2MB in the beginning and 292.0MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.47ms. Allocated memory is still 348.1MB. Free memory was 292.0MB in the beginning and 289.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.79ms. Allocated memory is still 348.1MB. Free memory was 289.5MB in the beginning and 287.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 383.03ms. Allocated memory is still 348.1MB. Free memory was 287.4MB in the beginning and 264.7MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 857835.72ms. Allocated memory was 348.1MB in the beginning and 3.9GB in the end (delta: 3.5GB). Free memory was 263.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.7GB. 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: 6.4s, 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 - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 175/485 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 18495 conditions, 1348 events (489/1347 cut-off events. For 116483/116522 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9453 event pairs, 42 based on Foata normal form. 27/1445 useless extension candidates. Maximal degree in co-relation 18376. Up to 453 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 384 locations, 29 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 857.7s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 754.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 1037 mSolverCounterUnknown, 5935 SdHoareTripleChecker+Valid, 237.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5935 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 234.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 16603 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 1100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16545 IncrementalHoareTripleChecker+Invalid, 35285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1100 mSolverCounterUnsat, 2 mSDtfsCounter, 16545 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1037 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 962 GetRequests, 212 SyntacticMatches, 75 SemanticMatches, 675 ConstructedPredicates, 67 IntricatePredicates, 17 DeprecatedPredicates, 10601 ImplicationChecksByTransitivity, 561.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10409occurred in iteration=25, InterpolantAutomatonStates: 362, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 91.4s InterpolantComputationTime, 642 NumberOfCodeBlocks, 642 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 829 ConstructedInterpolants, 308 QuantifiedInterpolants, 46849 SizeOfPredicates, 237 NumberOfNonLiveVariables, 3381 ConjunctsInSsa, 910 ConjunctsInUnsatCore, 53 InterpolantComputations, 14 PerfectInterpolantSequences, 17/221 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown