/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 PROGRAM_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 09:22:56,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 09:22:56,167 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 09:22:56,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 09:22:56,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 09:22:56,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 09:22:56,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 09:22:56,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 09:22:56,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 09:22:56,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 09:22:56,204 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 09:22:56,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 09:22:56,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 09:22:56,205 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 09:22:56,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 09:22:56,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 09:22:56,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 09:22:56,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 09:22:56,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 09:22:56,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 09:22:56,206 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 09:22:56,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 09:22:56,207 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 09:22:56,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 09:22:56,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 09:22:56,207 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 09:22:56,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 09:22:56,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:22:56,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 09:22:56,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 09:22:56,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 09:22:56,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 09:22:56,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 09:22:56,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 09:22:56,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 09:22:56,209 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 -> PROGRAM_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 09:22:56,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 09:22:56,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 09:22:56,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 09:22:56,437 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 09:22:56,439 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 09:22:56,440 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 09:22:57,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 09:22:57,578 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 09:22:57,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-08-27 09:22:57,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0837ad2e8/3c176a6008e240138ac9b1611d521193/FLAGd8af32b61 [2023-08-27 09:22:57,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0837ad2e8/3c176a6008e240138ac9b1611d521193 [2023-08-27 09:22:57,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 09:22:57,612 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 09:22:57,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 09:22:57,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 09:22:57,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 09:22:57,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:22:57" (1/1) ... [2023-08-27 09:22:57,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275af24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:57, skipping insertion in model container [2023-08-27 09:22:57,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:22:57" (1/1) ... [2023-08-27 09:22:57,649 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 09:22:58,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:22:58,026 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 09:22:58,050 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-27 09:22:58,052 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-27 09:22:58,056 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-27 09:22:58,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:22:58,111 INFO L206 MainTranslator]: Completed translation [2023-08-27 09:22:58,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58 WrapperNode [2023-08-27 09:22:58,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 09:22:58,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 09:22:58,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 09:22:58,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 09:22:58,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (1/1) ... [2023-08-27 09:22:58,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (1/1) ... [2023-08-27 09:22:58,171 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 221 [2023-08-27 09:22:58,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 09:22:58,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 09:22:58,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 09:22:58,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 09:22:58,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (1/1) ... [2023-08-27 09:22:58,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (1/1) ... [2023-08-27 09:22:58,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (1/1) ... [2023-08-27 09:22:58,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (1/1) ... [2023-08-27 09:22:58,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (1/1) ... [2023-08-27 09:22:58,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (1/1) ... [2023-08-27 09:22:58,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (1/1) ... [2023-08-27 09:22:58,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (1/1) ... [2023-08-27 09:22:58,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 09:22:58,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 09:22:58,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 09:22:58,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 09:22:58,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (1/1) ... [2023-08-27 09:22:58,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:22:58,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:22:58,245 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 09:22:58,252 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 09:22:58,268 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-27 09:22:58,269 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-27 09:22:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-27 09:22:58,269 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-27 09:22:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 09:22:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 09:22:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 09:22:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 09:22:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-27 09:22:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 09:22:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 09:22:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 09:22:58,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 09:22:58,271 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 09:22:58,388 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 09:22:58,389 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 09:22:58,589 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 09:22:58,595 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 09:22:58,595 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-27 09:22:58,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:22:58 BoogieIcfgContainer [2023-08-27 09:22:58,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 09:22:58,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 09:22:58,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 09:22:58,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 09:22:58,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:22:57" (1/3) ... [2023-08-27 09:22:58,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35325e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:22:58, skipping insertion in model container [2023-08-27 09:22:58,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:22:58" (2/3) ... [2023-08-27 09:22:58,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35325e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:22:58, skipping insertion in model container [2023-08-27 09:22:58,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:22:58" (3/3) ... [2023-08-27 09:22:58,601 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-08-27 09:22:58,612 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 09:22:58,612 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-27 09:22:58,612 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 09:22:58,676 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-27 09:22:58,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 248 transitions, 512 flow [2023-08-27 09:22:58,785 INFO L124 PetriNetUnfolderBase]: 15/246 cut-off events. [2023-08-27 09:22:58,786 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 09:22:58,795 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 09:22:58,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 248 transitions, 512 flow [2023-08-27 09:22:58,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 237 transitions, 483 flow [2023-08-27 09:22:58,804 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 09:22:58,813 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-27 09:22:58,817 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 237 transitions, 483 flow [2023-08-27 09:22:58,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 237 transitions, 483 flow [2023-08-27 09:22:58,881 INFO L124 PetriNetUnfolderBase]: 15/237 cut-off events. [2023-08-27 09:22:58,881 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 09:22:58,885 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 09:22:58,890 INFO L119 LiptonReduction]: Number of co-enabled transitions 14312 [2023-08-27 09:23:05,256 INFO L134 LiptonReduction]: Checked pairs total: 33711 [2023-08-27 09:23:05,257 INFO L136 LiptonReduction]: Total number of compositions: 237 [2023-08-27 09:23:05,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 09:23:05,273 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;@1e993e1b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 09:23:05,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-08-27 09:23:05,274 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 09:23:05,274 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-27 09:23:05,274 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:23:05,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:05,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-27 09:23:05,275 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 09:23:05,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:05,278 INFO L85 PathProgramCache]: Analyzing trace with hash 991, now seen corresponding path program 1 times [2023-08-27 09:23:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:05,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317258463] [2023-08-27 09:23:05,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:05,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:05,358 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 09:23:05,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:05,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317258463] [2023-08-27 09:23:05,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317258463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:23:05,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:23:05,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-27 09:23:05,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632872495] [2023-08-27 09:23:05,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:23:05,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-27 09:23:05,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-27 09:23:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-27 09:23:05,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 485 [2023-08-27 09:23:05,390 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 09:23:05,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:05,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 485 [2023-08-27 09:23:05,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:05,572 INFO L124 PetriNetUnfolderBase]: 1466/2404 cut-off events. [2023-08-27 09:23:05,572 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-08-27 09:23:05,574 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 09:23:05,583 INFO L140 encePairwiseOnDemand]: 484/485 looper letters, 50 selfloop transitions, 0 changer transitions 0/58 dead transitions. [2023-08-27 09:23:05,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 225 flow [2023-08-27 09:23:05,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-27 09:23:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-27 09:23:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 521 transitions. [2023-08-27 09:23:05,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371134020618556 [2023-08-27 09:23:05,599 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 521 transitions. [2023-08-27 09:23:05,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 521 transitions. [2023-08-27 09:23:05,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:05,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 521 transitions. [2023-08-27 09:23:05,606 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 09:23:05,609 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 09:23:05,610 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 09:23:05,611 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 127 flow. Second operand 2 states and 521 transitions. [2023-08-27 09:23:05,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 225 flow [2023-08-27 09:23:05,613 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 09:23:05,614 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 120 flow [2023-08-27 09:23:05,615 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 09:23:05,617 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-08-27 09:23:05,617 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 120 flow [2023-08-27 09:23:05,618 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 09:23:05,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:05,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:05,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 09:23:05,618 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 09:23:05,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1865824386, now seen corresponding path program 1 times [2023-08-27 09:23:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:05,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302938314] [2023-08-27 09:23:05,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:06,445 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 09:23:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302938314] [2023-08-27 09:23:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302938314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:23:06,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:23:06,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:23:06,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874717432] [2023-08-27 09:23:06,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:23:06,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:23:06,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:06,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:23:06,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:23:06,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 09:23:06,449 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 09:23:06,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:06,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 09:23:06,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:06,767 INFO L124 PetriNetUnfolderBase]: 1510/2487 cut-off events. [2023-08-27 09:23:06,767 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-27 09:23:06,769 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 09:23:06,777 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 54 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-08-27 09:23:06,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 270 flow [2023-08-27 09:23:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:23:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:23:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1193 transitions. [2023-08-27 09:23:06,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099656357388316 [2023-08-27 09:23:06,781 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1193 transitions. [2023-08-27 09:23:06,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1193 transitions. [2023-08-27 09:23:06,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:06,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1193 transitions. [2023-08-27 09:23:06,811 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 09:23:06,817 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 09:23:06,818 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 09:23:06,818 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 120 flow. Second operand 6 states and 1193 transitions. [2023-08-27 09:23:06,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 270 flow [2023-08-27 09:23:06,819 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 09:23:06,821 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 180 flow [2023-08-27 09:23:06,821 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 09:23:06,821 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2023-08-27 09:23:06,822 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 180 flow [2023-08-27 09:23:06,822 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 09:23:06,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:06,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:06,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 09:23:06,825 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 09:23:06,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2006802628, now seen corresponding path program 1 times [2023-08-27 09:23:06,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:06,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389626381] [2023-08-27 09:23:06,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:07,448 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 09:23:07,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:07,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389626381] [2023-08-27 09:23:07,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389626381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:23:07,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:23:07,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:23:07,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007157276] [2023-08-27 09:23:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:23:07,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:23:07,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:07,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:23:07,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 09:23:07,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 09:23:07,452 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 09:23:07,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:07,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 09:23:07,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:08,014 INFO L124 PetriNetUnfolderBase]: 1996/3312 cut-off events. [2023-08-27 09:23:08,014 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2023-08-27 09:23:08,017 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 09:23:08,027 INFO L140 encePairwiseOnDemand]: 476/485 looper letters, 121 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2023-08-27 09:23:08,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 145 transitions, 633 flow [2023-08-27 09:23:08,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:23:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:23:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1240 transitions. [2023-08-27 09:23:08,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4261168384879725 [2023-08-27 09:23:08,030 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1240 transitions. [2023-08-27 09:23:08,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1240 transitions. [2023-08-27 09:23:08,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:08,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1240 transitions. [2023-08-27 09:23:08,033 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 09:23:08,036 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 09:23:08,037 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 09:23:08,038 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 180 flow. Second operand 6 states and 1240 transitions. [2023-08-27 09:23:08,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 145 transitions, 633 flow [2023-08-27 09:23:08,043 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 09:23:08,045 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 274 flow [2023-08-27 09:23:08,045 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 09:23:08,046 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2023-08-27 09:23:08,046 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 274 flow [2023-08-27 09:23:08,047 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 09:23:08,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:08,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:08,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 09:23:08,047 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 09:23:08,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2005979578, now seen corresponding path program 2 times [2023-08-27 09:23:08,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:08,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021033758] [2023-08-27 09:23:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:08,480 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 09:23:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021033758] [2023-08-27 09:23:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021033758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:23:08,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:23:08,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:23:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623113935] [2023-08-27 09:23:08,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:23:08,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:23:08,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:23:08,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 09:23:08,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 09:23:08,484 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 09:23:08,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:08,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 09:23:08,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:08,968 INFO L124 PetriNetUnfolderBase]: 2162/3618 cut-off events. [2023-08-27 09:23:08,968 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2023-08-27 09:23:08,973 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 09:23:08,983 INFO L140 encePairwiseOnDemand]: 475/485 looper letters, 147 selfloop transitions, 24 changer transitions 0/178 dead transitions. [2023-08-27 09:23:08,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 178 transitions, 856 flow [2023-08-27 09:23:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:23:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:23:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1450 transitions. [2023-08-27 09:23:08,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270986745213549 [2023-08-27 09:23:08,986 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1450 transitions. [2023-08-27 09:23:08,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1450 transitions. [2023-08-27 09:23:08,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:08,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1450 transitions. [2023-08-27 09:23:08,989 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 09:23:08,992 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 09:23:08,994 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 09:23:08,994 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 274 flow. Second operand 7 states and 1450 transitions. [2023-08-27 09:23:08,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 178 transitions, 856 flow [2023-08-27 09:23:09,001 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 09:23:09,003 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 377 flow [2023-08-27 09:23:09,003 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 09:23:09,003 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 23 predicate places. [2023-08-27 09:23:09,003 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 377 flow [2023-08-27 09:23:09,004 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 09:23:09,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:09,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:09,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 09:23:09,004 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 09:23:09,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2005678240, now seen corresponding path program 1 times [2023-08-27 09:23:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:09,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708496208] [2023-08-27 09:23:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:09,555 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 09:23:09,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:09,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708496208] [2023-08-27 09:23:09,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708496208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:23:09,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:23:09,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:23:09,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908416817] [2023-08-27 09:23:09,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:23:09,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:23:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:09,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:23:09,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 09:23:09,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 09:23:09,558 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 09:23:09,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:09,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 09:23:09,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:10,066 INFO L124 PetriNetUnfolderBase]: 2163/3625 cut-off events. [2023-08-27 09:23:10,067 INFO L125 PetriNetUnfolderBase]: For 1188/1188 co-relation queries the response was YES. [2023-08-27 09:23:10,072 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 09:23:10,082 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 128 selfloop transitions, 20 changer transitions 0/155 dead transitions. [2023-08-27 09:23:10,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 155 transitions, 828 flow [2023-08-27 09:23:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:23:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:23:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1238 transitions. [2023-08-27 09:23:10,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254295532646048 [2023-08-27 09:23:10,085 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1238 transitions. [2023-08-27 09:23:10,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1238 transitions. [2023-08-27 09:23:10,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:10,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1238 transitions. [2023-08-27 09:23:10,088 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 09:23:10,091 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 09:23:10,091 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 09:23:10,091 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 377 flow. Second operand 6 states and 1238 transitions. [2023-08-27 09:23:10,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 155 transitions, 828 flow [2023-08-27 09:23:10,097 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 09:23:10,099 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 430 flow [2023-08-27 09:23:10,099 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 09:23:10,099 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 29 predicate places. [2023-08-27 09:23:10,099 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 430 flow [2023-08-27 09:23:10,100 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 09:23:10,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:10,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:10,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 09:23:10,100 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 09:23:10,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash 752218327, now seen corresponding path program 1 times [2023-08-27 09:23:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467303806] [2023-08-27 09:23:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:10,130 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 09:23:10,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:10,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467303806] [2023-08-27 09:23:10,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467303806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:23:10,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:23:10,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:23:10,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777685600] [2023-08-27 09:23:10,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:23:10,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:23:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:10,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:23:10,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:23:10,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 485 [2023-08-27 09:23:10,133 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 09:23:10,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:10,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 485 [2023-08-27 09:23:10,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:10,572 INFO L124 PetriNetUnfolderBase]: 3532/5858 cut-off events. [2023-08-27 09:23:10,573 INFO L125 PetriNetUnfolderBase]: For 4832/4959 co-relation queries the response was YES. [2023-08-27 09:23:10,580 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 09:23:10,594 INFO L140 encePairwiseOnDemand]: 478/485 looper letters, 156 selfloop transitions, 4 changer transitions 0/170 dead transitions. [2023-08-27 09:23:10,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 170 transitions, 1141 flow [2023-08-27 09:23:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:23:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:23:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1009 transitions. [2023-08-27 09:23:10,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201030927835052 [2023-08-27 09:23:10,597 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1009 transitions. [2023-08-27 09:23:10,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1009 transitions. [2023-08-27 09:23:10,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:10,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1009 transitions. [2023-08-27 09:23:10,599 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 09:23:10,600 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 09:23:10,601 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 09:23:10,601 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 430 flow. Second operand 4 states and 1009 transitions. [2023-08-27 09:23:10,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 170 transitions, 1141 flow [2023-08-27 09:23:10,604 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 09:23:10,606 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 429 flow [2023-08-27 09:23:10,606 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 09:23:10,606 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2023-08-27 09:23:10,606 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 429 flow [2023-08-27 09:23:10,607 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 09:23:10,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:10,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:10,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 09:23:10,607 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 09:23:10,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:10,607 INFO L85 PathProgramCache]: Analyzing trace with hash 693783489, now seen corresponding path program 1 times [2023-08-27 09:23:10,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:10,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881820493] [2023-08-27 09:23:10,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:10,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:10,927 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 09:23:10,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:10,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881820493] [2023-08-27 09:23:10,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881820493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:23:10,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:23:10,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:23:10,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867879042] [2023-08-27 09:23:10,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:23:10,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:23:10,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:10,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:23:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 09:23:10,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 485 [2023-08-27 09:23:10,930 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 09:23:10,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:10,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 485 [2023-08-27 09:23:10,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:11,539 INFO L124 PetriNetUnfolderBase]: 4038/6730 cut-off events. [2023-08-27 09:23:11,539 INFO L125 PetriNetUnfolderBase]: For 4591/4601 co-relation queries the response was YES. [2023-08-27 09:23:11,552 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 09:23:11,569 INFO L140 encePairwiseOnDemand]: 471/485 looper letters, 104 selfloop transitions, 19 changer transitions 0/130 dead transitions. [2023-08-27 09:23:11,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 130 transitions, 799 flow [2023-08-27 09:23:11,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:23:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:23:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1416 transitions. [2023-08-27 09:23:11,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4170839469808542 [2023-08-27 09:23:11,572 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1416 transitions. [2023-08-27 09:23:11,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1416 transitions. [2023-08-27 09:23:11,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:11,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1416 transitions. [2023-08-27 09:23:11,575 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 09:23:11,577 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 09:23:11,578 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 09:23:11,578 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 429 flow. Second operand 7 states and 1416 transitions. [2023-08-27 09:23:11,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 130 transitions, 799 flow [2023-08-27 09:23:11,583 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 09:23:11,585 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 534 flow [2023-08-27 09:23:11,585 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 09:23:11,585 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places. [2023-08-27 09:23:11,585 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 534 flow [2023-08-27 09:23:11,586 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 09:23:11,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:11,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:11,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 09:23:11,586 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 09:23:11,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1288991555, now seen corresponding path program 1 times [2023-08-27 09:23:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883698958] [2023-08-27 09:23:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:11,807 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 09:23:11,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:11,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883698958] [2023-08-27 09:23:11,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883698958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:23:11,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:23:11,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 09:23:11,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852542704] [2023-08-27 09:23:11,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:23:11,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 09:23:11,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:11,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 09:23:11,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-27 09:23:11,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 09:23:11,811 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 09:23:11,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:11,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 09:23:11,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:12,433 INFO L124 PetriNetUnfolderBase]: 5236/8617 cut-off events. [2023-08-27 09:23:12,433 INFO L125 PetriNetUnfolderBase]: For 4997/5027 co-relation queries the response was YES. [2023-08-27 09:23:12,447 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 09:23:12,467 INFO L140 encePairwiseOnDemand]: 470/485 looper letters, 180 selfloop transitions, 32 changer transitions 0/219 dead transitions. [2023-08-27 09:23:12,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 219 transitions, 1352 flow [2023-08-27 09:23:12,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:23:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:23:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1470 transitions. [2023-08-27 09:23:12,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329896907216495 [2023-08-27 09:23:12,471 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1470 transitions. [2023-08-27 09:23:12,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1470 transitions. [2023-08-27 09:23:12,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:12,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1470 transitions. [2023-08-27 09:23:12,473 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 09:23:12,476 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 09:23:12,477 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 09:23:12,477 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 534 flow. Second operand 7 states and 1470 transitions. [2023-08-27 09:23:12,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 219 transitions, 1352 flow [2023-08-27 09:23:12,508 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 09:23:12,510 INFO L231 Difference]: Finished difference. Result has 103 places, 104 transitions, 691 flow [2023-08-27 09:23:12,510 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 09:23:12,510 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 44 predicate places. [2023-08-27 09:23:12,511 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 691 flow [2023-08-27 09:23:12,511 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 09:23:12,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:12,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:12,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 09:23:12,511 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 09:23:12,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash 38670346, now seen corresponding path program 1 times [2023-08-27 09:23:12,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:12,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696594098] [2023-08-27 09:23:12,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:12,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:12,855 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 09:23:12,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:12,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696594098] [2023-08-27 09:23:12,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696594098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:23:12,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:23:12,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 09:23:12,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732349502] [2023-08-27 09:23:12,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:23:12,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 09:23:12,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:12,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 09:23:12,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 09:23:12,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 485 [2023-08-27 09:23:12,858 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 09:23:12,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:12,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 485 [2023-08-27 09:23:12,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:13,772 INFO L124 PetriNetUnfolderBase]: 5520/9165 cut-off events. [2023-08-27 09:23:13,772 INFO L125 PetriNetUnfolderBase]: For 12179/12201 co-relation queries the response was YES. [2023-08-27 09:23:13,787 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 09:23:13,808 INFO L140 encePairwiseOnDemand]: 473/485 looper letters, 182 selfloop transitions, 27 changer transitions 0/216 dead transitions. [2023-08-27 09:23:13,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 216 transitions, 1460 flow [2023-08-27 09:23:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:23:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:23:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1454 transitions. [2023-08-27 09:23:13,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4282768777614138 [2023-08-27 09:23:13,811 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1454 transitions. [2023-08-27 09:23:13,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1454 transitions. [2023-08-27 09:23:13,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:13,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1454 transitions. [2023-08-27 09:23:13,814 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 09:23:13,817 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 09:23:13,817 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 09:23:13,817 INFO L175 Difference]: Start difference. First operand has 103 places, 104 transitions, 691 flow. Second operand 7 states and 1454 transitions. [2023-08-27 09:23:13,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 216 transitions, 1460 flow [2023-08-27 09:23:13,865 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 09:23:13,867 INFO L231 Difference]: Finished difference. Result has 107 places, 110 transitions, 792 flow [2023-08-27 09:23:13,867 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 09:23:13,868 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places. [2023-08-27 09:23:13,868 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 792 flow [2023-08-27 09:23:13,868 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 09:23:13,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:13,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:13,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 09:23:13,869 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 09:23:13,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:13,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1327212761, now seen corresponding path program 1 times [2023-08-27 09:23:13,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818714433] [2023-08-27 09:23:13,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:13,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:23:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:13,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818714433] [2023-08-27 09:23:13,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818714433] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:23:13,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:23:13,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:23:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783471521] [2023-08-27 09:23:13,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:23:13,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:23:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:23:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:23:13,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 485 [2023-08-27 09:23:13,900 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 09:23:13,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:13,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 485 [2023-08-27 09:23:13,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:14,038 INFO L124 PetriNetUnfolderBase]: 887/1734 cut-off events. [2023-08-27 09:23:14,038 INFO L125 PetriNetUnfolderBase]: For 1927/1938 co-relation queries the response was YES. [2023-08-27 09:23:14,042 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 09:23:14,045 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 82 selfloop transitions, 2 changer transitions 7/99 dead transitions. [2023-08-27 09:23:14,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 99 transitions, 795 flow [2023-08-27 09:23:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:23:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:23:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2023-08-27 09:23:14,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147766323024054 [2023-08-27 09:23:14,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2023-08-27 09:23:14,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2023-08-27 09:23:14,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:14,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2023-08-27 09:23:14,049 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 09:23:14,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:23:14,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:23:14,051 INFO L175 Difference]: Start difference. First operand has 107 places, 110 transitions, 792 flow. Second operand 3 states and 749 transitions. [2023-08-27 09:23:14,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 99 transitions, 795 flow [2023-08-27 09:23:14,055 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 09:23:14,056 INFO L231 Difference]: Finished difference. Result has 104 places, 87 transitions, 514 flow [2023-08-27 09:23:14,057 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 09:23:14,057 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 45 predicate places. [2023-08-27 09:23:14,057 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 87 transitions, 514 flow [2023-08-27 09:23:14,058 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 09:23:14,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:14,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:14,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 09:23:14,058 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 09:23:14,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:14,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1117479504, now seen corresponding path program 1 times [2023-08-27 09:23:14,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:14,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594189714] [2023-08-27 09:23:14,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:14,084 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 09:23:14,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:14,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594189714] [2023-08-27 09:23:14,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594189714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:23:14,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:23:14,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:23:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727683244] [2023-08-27 09:23:14,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:23:14,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:23:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:14,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:23:14,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:23:14,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 09:23:14,086 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 09:23:14,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:14,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 09:23:14,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:14,199 INFO L124 PetriNetUnfolderBase]: 583/1173 cut-off events. [2023-08-27 09:23:14,199 INFO L125 PetriNetUnfolderBase]: For 1042/1042 co-relation queries the response was YES. [2023-08-27 09:23:14,202 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 09:23:14,204 INFO L140 encePairwiseOnDemand]: 480/485 looper letters, 83 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2023-08-27 09:23:14,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 96 transitions, 718 flow [2023-08-27 09:23:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:23:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:23:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2023-08-27 09:23:14,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140893470790378 [2023-08-27 09:23:14,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2023-08-27 09:23:14,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2023-08-27 09:23:14,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:14,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2023-08-27 09:23:14,207 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 09:23:14,209 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 09:23:14,209 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 09:23:14,209 INFO L175 Difference]: Start difference. First operand has 104 places, 87 transitions, 514 flow. Second operand 3 states and 748 transitions. [2023-08-27 09:23:14,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 96 transitions, 718 flow [2023-08-27 09:23:14,213 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 09:23:14,213 INFO L231 Difference]: Finished difference. Result has 103 places, 88 transitions, 518 flow [2023-08-27 09:23:14,214 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 09:23:14,214 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 44 predicate places. [2023-08-27 09:23:14,214 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 88 transitions, 518 flow [2023-08-27 09:23:14,214 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 09:23:14,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:14,215 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:14,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 09:23:14,215 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 09:23:14,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:14,215 INFO L85 PathProgramCache]: Analyzing trace with hash 156498137, now seen corresponding path program 1 times [2023-08-27 09:23:14,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:14,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408208988] [2023-08-27 09:23:14,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:14,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:14,757 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 09:23:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:14,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408208988] [2023-08-27 09:23:14,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408208988] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:23:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187406059] [2023-08-27 09:23:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:14,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:23:14,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:23:14,761 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 09:23:14,763 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 09:23:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:14,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-27 09:23:14,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:23:14,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:14,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:14,936 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:23:14,937 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-08-27 09:23:14,947 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 09:23:14,947 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 09:23:15,024 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 09:23:15,115 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 09:23:15,229 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 09:23:15,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:15,284 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 09:23:15,391 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 09:23:15,465 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 09:23:15,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:23:15,536 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 09:23:18,845 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 09:23:18,869 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 09:23:23,025 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 09:23:23,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187406059] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:23:23,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:23:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2023-08-27 09:23:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864398827] [2023-08-27 09:23:23,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:23:23,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-27 09:23:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:23,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-27 09:23:23,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=645, Unknown=15, NotChecked=174, Total=1056 [2023-08-27 09:23:23,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 485 [2023-08-27 09:23:23,032 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 09:23:23,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:23,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 485 [2023-08-27 09:23:23,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:26,067 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 09:23:28,074 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 09:23:28,443 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 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_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_406 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .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 .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_409) .cse4) 2147483647)))) (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35| Int) (v_ArrVal_406 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_406)) |c_~#stored_elements~0.base| v_ArrVal_408) |c_~#queue~0.base|))) (or (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_35|)) v_ArrVal_409) .cse4) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_406)))))) is different from false [2023-08-27 09:23:28,813 INFO L124 PetriNetUnfolderBase]: 638/1269 cut-off events. [2023-08-27 09:23:28,813 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2023-08-27 09:23:28,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 1269 events. 638/1269 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6585 event pairs, 440 based on Foata normal form. 2/1139 useless extension candidates. Maximal degree in co-relation 3575. Up to 1115 conditions per place. [2023-08-27 09:23:28,819 INFO L140 encePairwiseOnDemand]: 470/485 looper letters, 84 selfloop transitions, 52 changer transitions 1/143 dead transitions. [2023-08-27 09:23:28,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 143 transitions, 1094 flow [2023-08-27 09:23:28,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-27 09:23:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-27 09:23:28,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3873 transitions. [2023-08-27 09:23:28,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38026509572901324 [2023-08-27 09:23:28,826 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3873 transitions. [2023-08-27 09:23:28,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3873 transitions. [2023-08-27 09:23:28,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:28,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3873 transitions. [2023-08-27 09:23:28,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 184.42857142857142) internal successors, (3873), 21 states have internal predecessors, (3873), 0 states have call successors, (0), 0 states 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 09:23:28,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 485.0) internal successors, (10670), 22 states have internal predecessors, (10670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:23:28,842 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 485.0) internal successors, (10670), 22 states have internal predecessors, (10670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:23:28,842 INFO L175 Difference]: Start difference. First operand has 103 places, 88 transitions, 518 flow. Second operand 21 states and 3873 transitions. [2023-08-27 09:23:28,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 143 transitions, 1094 flow [2023-08-27 09:23:28,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 143 transitions, 1089 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:23:28,847 INFO L231 Difference]: Finished difference. Result has 128 places, 123 transitions, 900 flow [2023-08-27 09:23:28,847 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=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=900, PETRI_PLACES=128, PETRI_TRANSITIONS=123} [2023-08-27 09:23:28,849 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 69 predicate places. [2023-08-27 09:23:28,849 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 123 transitions, 900 flow [2023-08-27 09:23:28,850 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 09:23:28,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:28,850 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:28,858 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 09:23:29,055 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 09:23:29,056 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 09:23:29,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:29,056 INFO L85 PathProgramCache]: Analyzing trace with hash 156498119, now seen corresponding path program 1 times [2023-08-27 09:23:29,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:29,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711821985] [2023-08-27 09:23:29,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:29,299 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 09:23:29,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711821985] [2023-08-27 09:23:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711821985] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:23:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22209111] [2023-08-27 09:23:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:29,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:23:29,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:23:29,301 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 09:23:29,303 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 09:23:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:29,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-27 09:23:29,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:23:29,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:29,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:29,425 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:23:29,425 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 09:23:29,436 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 09:23:29,437 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 09:23:29,510 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 09:23:29,588 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 09:23:29,691 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 09:23:29,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:29,731 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 09:23:29,817 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 09:23:29,888 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 09:23:29,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:23:29,948 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)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_504) |c_~#queue~0.base|))) (or (< 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)) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|)))) is different from false [2023-08-27 09:23:30,814 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 09:23:31,151 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 09:23:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22209111] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:23:31,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:23:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-27 09:23:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720383704] [2023-08-27 09:23:31,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:23:31,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-27 09:23:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:31,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-27 09:23:31,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=559, Unknown=30, NotChecked=106, Total=870 [2023-08-27 09:23:31,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 485 [2023-08-27 09:23:31,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 123 transitions, 900 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 09:23:31,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:31,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 485 [2023-08-27 09:23:31,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:34,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:23:37,584 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 09:23:41,769 INFO L124 PetriNetUnfolderBase]: 1786/3480 cut-off events. [2023-08-27 09:23:41,769 INFO L125 PetriNetUnfolderBase]: For 2509/2509 co-relation queries the response was YES. [2023-08-27 09:23:41,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9847 conditions, 3480 events. 1786/3480 cut-off events. For 2509/2509 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 21961 event pairs, 726 based on Foata normal form. 9/3121 useless extension candidates. Maximal degree in co-relation 9813. Up to 894 conditions per place. [2023-08-27 09:23:41,784 INFO L140 encePairwiseOnDemand]: 462/485 looper letters, 225 selfloop transitions, 120 changer transitions 4/355 dead transitions. [2023-08-27 09:23:41,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 355 transitions, 2627 flow [2023-08-27 09:23:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-27 09:23:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-27 09:23:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6352 transitions. [2023-08-27 09:23:41,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.385203153426319 [2023-08-27 09:23:41,809 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 6352 transitions. [2023-08-27 09:23:41,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 6352 transitions. [2023-08-27 09:23:41,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:41,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 6352 transitions. [2023-08-27 09:23:41,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 186.8235294117647) internal successors, (6352), 34 states have internal predecessors, (6352), 0 states have call successors, (0), 0 states 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 09:23:41,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 485.0) internal successors, (16975), 35 states have internal predecessors, (16975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:23:41,835 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 485.0) internal successors, (16975), 35 states have internal predecessors, (16975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:23:41,835 INFO L175 Difference]: Start difference. First operand has 128 places, 123 transitions, 900 flow. Second operand 34 states and 6352 transitions. [2023-08-27 09:23:41,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 355 transitions, 2627 flow [2023-08-27 09:23:41,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 355 transitions, 2499 flow, removed 49 selfloop flow, removed 8 redundant places. [2023-08-27 09:23:41,851 INFO L231 Difference]: Finished difference. Result has 165 places, 185 transitions, 1564 flow [2023-08-27 09:23:41,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1564, PETRI_PLACES=165, PETRI_TRANSITIONS=185} [2023-08-27 09:23:41,852 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 106 predicate places. [2023-08-27 09:23:41,852 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 185 transitions, 1564 flow [2023-08-27 09:23:41,853 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 09:23:41,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:41,853 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:41,861 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 09:23:42,058 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 09:23:42,058 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 09:23:42,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1968124107, now seen corresponding path program 1 times [2023-08-27 09:23:42,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:42,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367199198] [2023-08-27 09:23:42,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:42,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:42,708 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 09:23:42,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:42,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367199198] [2023-08-27 09:23:42,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367199198] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:23:42,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869566994] [2023-08-27 09:23:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:42,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:23:42,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:23:42,709 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 09:23:42,711 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 09:23:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:42,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 78 conjunts are in the unsatisfiable core [2023-08-27 09:23:42,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:23:42,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:42,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:42,887 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:23:42,888 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 09:23:42,903 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:23:42,903 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 09:23:42,993 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 09:23:43,095 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 09:23:43,142 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-27 09:23:43,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2023-08-27 09:23:43,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:43,316 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 09:23:43,414 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 09:23:43,729 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 09:23:43,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:23:43,972 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 ((.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 .cse1 .cse2 v_ArrVal_606)) |c_~#stored_elements~0.base| v_ArrVal_607) |c_~#queue~0.base|))) (or (< (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|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_606))))) is different from false [2023-08-27 09:23:44,124 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 09:23:44,149 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 09:23:44,178 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 09:23:44,435 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 09:23:44,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869566994] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:23:44,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:23:44,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2023-08-27 09:23:44,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83842625] [2023-08-27 09:23:44,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:23:44,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-27 09:23:44,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:44,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-27 09:23:44,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=769, Unknown=28, NotChecked=260, Total=1332 [2023-08-27 09:23:44,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 09:23:44,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 185 transitions, 1564 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 09:23:44,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:44,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 09:23:44,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:52,020 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 09:23:54,081 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 09:23:55,469 INFO L124 PetriNetUnfolderBase]: 2184/4338 cut-off events. [2023-08-27 09:23:55,469 INFO L125 PetriNetUnfolderBase]: For 10675/10679 co-relation queries the response was YES. [2023-08-27 09:23:55,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16570 conditions, 4338 events. 2184/4338 cut-off events. For 10675/10679 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 29230 event pairs, 619 based on Foata normal form. 14/3993 useless extension candidates. Maximal degree in co-relation 16526. Up to 2845 conditions per place. [2023-08-27 09:23:55,492 INFO L140 encePairwiseOnDemand]: 466/485 looper letters, 203 selfloop transitions, 69 changer transitions 3/281 dead transitions. [2023-08-27 09:23:55,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 281 transitions, 2818 flow [2023-08-27 09:23:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 09:23:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 09:23:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3136 transitions. [2023-08-27 09:23:55,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38035172832019404 [2023-08-27 09:23:55,495 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3136 transitions. [2023-08-27 09:23:55,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3136 transitions. [2023-08-27 09:23:55,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:55,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3136 transitions. [2023-08-27 09:23:55,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 184.47058823529412) internal successors, (3136), 17 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states 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 09:23:55,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 485.0) internal successors, (8730), 18 states have internal predecessors, (8730), 0 states have call successors, (0), 0 states 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 09:23:55,504 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 485.0) internal successors, (8730), 18 states have internal predecessors, (8730), 0 states have call successors, (0), 0 states 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 09:23:55,504 INFO L175 Difference]: Start difference. First operand has 165 places, 185 transitions, 1564 flow. Second operand 17 states and 3136 transitions. [2023-08-27 09:23:55,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 281 transitions, 2818 flow [2023-08-27 09:23:55,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 281 transitions, 2586 flow, removed 89 selfloop flow, removed 17 redundant places. [2023-08-27 09:23:55,536 INFO L231 Difference]: Finished difference. Result has 170 places, 205 transitions, 1719 flow [2023-08-27 09:23:55,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1719, PETRI_PLACES=170, PETRI_TRANSITIONS=205} [2023-08-27 09:23:55,536 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 111 predicate places. [2023-08-27 09:23:55,536 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 205 transitions, 1719 flow [2023-08-27 09:23:55,537 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 09:23:55,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:55,537 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:55,544 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 09:23:55,742 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 09:23:55,743 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 09:23:55,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:55,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1968124125, now seen corresponding path program 1 times [2023-08-27 09:23:55,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:55,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514781414] [2023-08-27 09:23:55,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:55,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:56,064 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 09:23:56,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:56,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514781414] [2023-08-27 09:23:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514781414] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:23:56,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252868173] [2023-08-27 09:23:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:56,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:23:56,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:23:56,069 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 09:23:56,071 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 09:23:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:56,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-27 09:23:56,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:23:56,187 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 09:23:56,187 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-08-27 09:23:56,289 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 09:23:56,321 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 09:23:56,368 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 09:23:56,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:56,388 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 09:23:56,441 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-27 09:23:56,441 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 09:23:56,468 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 09:23:56,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:23:56,535 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_695 Int) (v_ArrVal_694 (Array Int Int))) (or (< (+ v_ArrVal_695 2147483648) 0) (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_694) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_695) (+ 88 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2023-08-27 09:23:56,632 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:23:56,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2023-08-27 09:23:56,642 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:23:56,642 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 665 treesize of output 661 [2023-08-27 09:23:56,652 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 490 treesize of output 458 [2023-08-27 09:23:56,665 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 460 treesize of output 444 [2023-08-27 09:23:56,980 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 09:23:56,982 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 09:23:56,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-08-27 09:23:57,019 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:23:57,019 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 318 treesize of output 298 [2023-08-27 09:23:57,128 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 09:23:57,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252868173] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:23:57,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:23:57,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-27 09:23:57,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757544649] [2023-08-27 09:23:57,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:23:57,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-27 09:23:57,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:23:57,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-27 09:23:57,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=604, Unknown=9, NotChecked=52, Total=812 [2023-08-27 09:23:57,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 485 [2023-08-27 09:23:57,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 205 transitions, 1719 flow. Second operand has 29 states, 29 states have (on average 177.6551724137931) internal successors, (5152), 29 states have internal predecessors, (5152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:23:57,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:23:57,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 485 [2023-08-27 09:23:57,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:23:57,870 INFO L124 PetriNetUnfolderBase]: 2298/4493 cut-off events. [2023-08-27 09:23:57,870 INFO L125 PetriNetUnfolderBase]: For 14534/14784 co-relation queries the response was YES. [2023-08-27 09:23:57,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18328 conditions, 4493 events. 2298/4493 cut-off events. For 14534/14784 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 30236 event pairs, 1089 based on Foata normal form. 23/4101 useless extension candidates. Maximal degree in co-relation 18282. Up to 3588 conditions per place. [2023-08-27 09:23:57,895 INFO L140 encePairwiseOnDemand]: 477/485 looper letters, 200 selfloop transitions, 31 changer transitions 3/240 dead transitions. [2023-08-27 09:23:57,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 240 transitions, 2326 flow [2023-08-27 09:23:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:23:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:23:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1144 transitions. [2023-08-27 09:23:57,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.393127147766323 [2023-08-27 09:23:57,897 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1144 transitions. [2023-08-27 09:23:57,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1144 transitions. [2023-08-27 09:23:57,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:23:57,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1144 transitions. [2023-08-27 09:23:57,899 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 09:23:57,900 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 09:23:57,900 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 09:23:57,900 INFO L175 Difference]: Start difference. First operand has 170 places, 205 transitions, 1719 flow. Second operand 6 states and 1144 transitions. [2023-08-27 09:23:57,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 240 transitions, 2326 flow [2023-08-27 09:23:57,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 240 transitions, 2210 flow, removed 30 selfloop flow, removed 9 redundant places. [2023-08-27 09:23:57,927 INFO L231 Difference]: Finished difference. Result has 165 places, 204 transitions, 1668 flow [2023-08-27 09:23:57,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1570, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1668, PETRI_PLACES=165, PETRI_TRANSITIONS=204} [2023-08-27 09:23:57,927 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 106 predicate places. [2023-08-27 09:23:57,927 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 204 transitions, 1668 flow [2023-08-27 09:23:57,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 177.6551724137931) internal successors, (5152), 29 states have internal predecessors, (5152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:23:57,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:23:57,929 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:23:57,933 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 09:23:58,133 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 09:23:58,133 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 09:23:58,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:23:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 555652901, now seen corresponding path program 2 times [2023-08-27 09:23:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:23:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938229595] [2023-08-27 09:23:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:23:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:23:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:23:58,696 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 09:23:58,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:23:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938229595] [2023-08-27 09:23:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938229595] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:23:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104126151] [2023-08-27 09:23:58,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 09:23:58,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:23:58,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:23:58,698 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 09:23:58,698 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 09:23:58,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 09:23:58,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 09:23:58,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-27 09:23:58,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:23:58,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:58,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:58,845 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:23:58,845 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 09:23:58,858 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:23:58,862 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 09:23:58,940 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-08-27 09:23:59,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2023-08-27 09:23:59,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2023-08-27 09:23:59,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:23:59,144 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-08-27 09:23:59,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-08-27 09:23:59,258 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2023-08-27 09:23:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 09:23:59,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:23:59,422 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_798 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_796) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_797) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_798) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 09:23:59,494 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_798 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_795)) |c_~#stored_elements~0.base| v_ArrVal_796) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_797) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_798) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_795) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|))))) is different from false [2023-08-27 09:24:13,621 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 09:24:13,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104126151] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:24:13,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:24:13,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-08-27 09:24:13,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625906828] [2023-08-27 09:24:13,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:24:13,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-27 09:24:13,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:24:13,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-27 09:24:13,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=834, Unknown=26, NotChecked=130, Total=1260 [2023-08-27 09:24:13,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 09:24:13,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 204 transitions, 1668 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 09:24:13,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:24:13,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 09:24:13,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:24:24,718 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 09:24:26,759 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 09:24:28,768 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 09:24:30,790 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 ((.cse2 (+ (select .cse4 .cse5) 1)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_795 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_798 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_795)) |c_~#stored_elements~0.base| v_ArrVal_796) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_797) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_798) .cse1) 2147483647) (< .cse2 v_ArrVal_795) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|)))) (forall ((v_ArrVal_795 Int) (v_ArrVal_793 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_798 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_793) .cse5 v_ArrVal_795)) |c_~#stored_elements~0.base| v_ArrVal_796) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_797) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_793) (< .cse2 v_ArrVal_795) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_798) .cse1) 2147483647) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|))))))) is different from false [2023-08-27 09:24:32,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 09:24:35,166 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 09:24:37,172 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 09:24:39,180 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 09:24:39,393 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_798 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_796) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_797) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_798) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_798 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_798) .cse2) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_797 (Array Int Int)) (v_ArrVal_798 Int)) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_797) |c_~#queue~0.base|))) (or (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_798) .cse2) 2147483647) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|)))))) is different from false [2023-08-27 09:24:41,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:24:43,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:24:47,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:24:50,145 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 09:24:54,723 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 09:24:56,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 09:25:05,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:25:07,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:25:10,938 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 09:25:11,162 INFO L124 PetriNetUnfolderBase]: 3506/6801 cut-off events. [2023-08-27 09:25:11,162 INFO L125 PetriNetUnfolderBase]: For 21597/21956 co-relation queries the response was YES. [2023-08-27 09:25:11,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26702 conditions, 6801 events. 3506/6801 cut-off events. For 21597/21956 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 50306 event pairs, 1129 based on Foata normal form. 19/6184 useless extension candidates. Maximal degree in co-relation 26658. Up to 3331 conditions per place. [2023-08-27 09:25:11,198 INFO L140 encePairwiseOnDemand]: 462/485 looper letters, 313 selfloop transitions, 128 changer transitions 3/450 dead transitions. [2023-08-27 09:25:11,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 450 transitions, 4446 flow [2023-08-27 09:25:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-27 09:25:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-27 09:25:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5554 transitions. [2023-08-27 09:25:11,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38171821305841924 [2023-08-27 09:25:11,205 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5554 transitions. [2023-08-27 09:25:11,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5554 transitions. [2023-08-27 09:25:11,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:25:11,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5554 transitions. [2023-08-27 09:25:11,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 185.13333333333333) internal successors, (5554), 30 states have internal predecessors, (5554), 0 states have call successors, (0), 0 states 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 09:25:11,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 485.0) internal successors, (15035), 31 states have internal predecessors, (15035), 0 states have call successors, (0), 0 states 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 09:25:11,223 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 485.0) internal successors, (15035), 31 states have internal predecessors, (15035), 0 states have call successors, (0), 0 states 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 09:25:11,223 INFO L175 Difference]: Start difference. First operand has 165 places, 204 transitions, 1668 flow. Second operand 30 states and 5554 transitions. [2023-08-27 09:25:11,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 450 transitions, 4446 flow [2023-08-27 09:25:11,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 450 transitions, 4403 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 09:25:11,262 INFO L231 Difference]: Finished difference. Result has 202 places, 270 transitions, 2718 flow [2023-08-27 09:25:11,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2718, PETRI_PLACES=202, PETRI_TRANSITIONS=270} [2023-08-27 09:25:11,263 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 143 predicate places. [2023-08-27 09:25:11,263 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 270 transitions, 2718 flow [2023-08-27 09:25:11,264 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 09:25:11,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:25:11,264 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:25:11,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-27 09:25:11,469 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 09:25:11,469 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 09:25:11,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:25:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash 556475951, now seen corresponding path program 3 times [2023-08-27 09:25:11,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:25:11,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536554339] [2023-08-27 09:25:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:25:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:25:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:25:12,084 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 09:25:12,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:25:12,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536554339] [2023-08-27 09:25:12,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536554339] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:25:12,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191252583] [2023-08-27 09:25:12,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 09:25:12,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:25:12,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:25:12,085 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 09:25:12,087 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 09:25:12,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 09:25:12,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 09:25:12,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-27 09:25:12,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:25:12,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2023-08-27 09:25:12,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:25:12,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:25:12,261 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:25:12,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-27 09:25:12,275 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:25:12,276 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 09:25:12,373 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-27 09:25:12,373 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-08-27 09:25:12,442 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-08-27 09:25:12,516 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-08-27 09:25:12,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:25:12,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-27 09:25:12,593 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-27 09:25:12,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-08-27 09:25:12,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-27 09:25:12,639 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 09:25:12,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:25:12,654 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_898) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-08-27 09:25:12,689 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_898 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| 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_62|) |c_~#queue~0.offset|) v_ArrVal_896)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_898) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|)))) is different from false [2023-08-27 09:25:12,697 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_898 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_895))) (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_62|) |c_~#queue~0.offset|) v_ArrVal_896)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_898) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|))))) is different from false [2023-08-27 09:25:12,708 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_893 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_893)) |c_~#stored_elements~0.base| v_ArrVal_895))) (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_62|) |c_~#queue~0.offset|) v_ArrVal_896)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_898) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_893))))) is different from false [2023-08-27 09:25:12,719 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_893 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_893)) |c_~#stored_elements~0.base| v_ArrVal_895))) (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_62|) |c_~#queue~0.offset|) v_ArrVal_896)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_898) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_893)))))) is different from false [2023-08-27 09:25:12,744 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_893 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_892 Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_892) .cse1 v_ArrVal_893)) |c_~#stored_elements~0.base| v_ArrVal_895))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_892) (< (+ (select .cse0 .cse1) 1) v_ArrVal_893) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_896)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_898) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse3 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|)))))) is different from false [2023-08-27 09:25:12,820 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_893 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_892 Int) (v_ArrVal_890 Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_890)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_892) .cse4 v_ArrVal_893)) |c_~#stored_elements~0.base| v_ArrVal_895))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_892) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_896)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_898) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse4) 1) v_ArrVal_893)))))) is different from false [2023-08-27 09:25:12,841 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_896 Int) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_893 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_892 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (v_ArrVal_890 Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_890)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_892) .cse4 v_ArrVal_893)) |c_~#stored_elements~0.base| v_ArrVal_895))) (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_62|) |c_~#queue~0.offset|) v_ArrVal_896)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_898) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_892) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_893) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|))))))) is different from false [2023-08-27 09:25:12,888 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 09:25:12,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191252583] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:25:12,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:25:12,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2023-08-27 09:25:12,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545815011] [2023-08-27 09:25:12,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:25:12,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-27 09:25:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:25:12,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-27 09:25:12,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=476, Unknown=11, NotChecked=440, Total=1122 [2023-08-27 09:25:12,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 09:25:12,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 270 transitions, 2718 flow. Second operand has 34 states, 34 states have (on average 176.41176470588235) internal successors, (5998), 34 states have internal predecessors, (5998), 0 states have call successors, (0), 0 states 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 09:25:12,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:25:12,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 09:25:12,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:25:25,643 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 09:25:25,908 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_898 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_898) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)) (forall ((v_ArrVal_896 Int) (v_ArrVal_898 (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_896)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_898) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 2147483647)))) is different from false [2023-08-27 09:25:26,663 INFO L124 PetriNetUnfolderBase]: 3643/7063 cut-off events. [2023-08-27 09:25:26,663 INFO L125 PetriNetUnfolderBase]: For 69035/69833 co-relation queries the response was YES. [2023-08-27 09:25:26,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37933 conditions, 7063 events. 3643/7063 cut-off events. For 69035/69833 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 52019 event pairs, 1471 based on Foata normal form. 34/6627 useless extension candidates. Maximal degree in co-relation 37878. Up to 4708 conditions per place. [2023-08-27 09:25:26,703 INFO L140 encePairwiseOnDemand]: 463/485 looper letters, 247 selfloop transitions, 123 changer transitions 3/379 dead transitions. [2023-08-27 09:25:26,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 379 transitions, 5014 flow [2023-08-27 09:25:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-27 09:25:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-27 09:25:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3510 transitions. [2023-08-27 09:25:26,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38090070537167664 [2023-08-27 09:25:26,706 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3510 transitions. [2023-08-27 09:25:26,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3510 transitions. [2023-08-27 09:25:26,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:25:26,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3510 transitions. [2023-08-27 09:25:26,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 184.73684210526315) internal successors, (3510), 19 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states 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 09:25:26,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 485.0) internal successors, (9700), 20 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 09:25:26,714 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 485.0) internal successors, (9700), 20 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 09:25:26,714 INFO L175 Difference]: Start difference. First operand has 202 places, 270 transitions, 2718 flow. Second operand 19 states and 3510 transitions. [2023-08-27 09:25:26,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 379 transitions, 5014 flow [2023-08-27 09:25:26,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 379 transitions, 4616 flow, removed 171 selfloop flow, removed 10 redundant places. [2023-08-27 09:25:26,772 INFO L231 Difference]: Finished difference. Result has 217 places, 316 transitions, 3446 flow [2023-08-27 09:25:26,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2398, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3446, PETRI_PLACES=217, PETRI_TRANSITIONS=316} [2023-08-27 09:25:26,773 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 158 predicate places. [2023-08-27 09:25:26,773 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 316 transitions, 3446 flow [2023-08-27 09:25:26,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 176.41176470588235) internal successors, (5998), 34 states have internal predecessors, (5998), 0 states have call successors, (0), 0 states 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 09:25:26,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:25:26,774 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:25:26,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-27 09:25:26,978 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 09:25:26,978 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:25:26,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:25:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2097698344, now seen corresponding path program 1 times [2023-08-27 09:25:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:25:26,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636852975] [2023-08-27 09:25:26,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:25:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:25:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:25:27,365 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 09:25:27,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:25:27,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636852975] [2023-08-27 09:25:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636852975] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:25:27,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079091576] [2023-08-27 09:25:27,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:25:27,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:25:27,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:25:27,366 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 09:25:27,368 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 09:25:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:25:27,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-27 09:25:27,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:25:27,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-27 09:25:27,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:25:27,573 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 18 treesize of output 20 [2023-08-27 09:25:27,616 INFO L322 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-08-27 09:25:27,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 1 case distinctions, treesize of input 27 treesize of output 30 [2023-08-27 09:25:28,085 INFO L322 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-08-27 09:25:28,086 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2023-08-27 09:25:28,105 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 09:25:28,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:25:28,209 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:25:28,209 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-08-27 09:25:28,215 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:25:28,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2023-08-27 09:25:28,219 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-08-27 09:25:28,227 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 09:25:28,238 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 09:25:28,239 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2023-08-27 09:25:28,312 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 09:25:28,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079091576] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:25:28,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:25:28,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 20 [2023-08-27 09:25:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178065391] [2023-08-27 09:25:28,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:25:28,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 09:25:28,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:25:28,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 09:25:28,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=382, Unknown=5, NotChecked=0, Total=462 [2023-08-27 09:25:28,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 485 [2023-08-27 09:25:28,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 316 transitions, 3446 flow. Second operand has 22 states, 22 states have (on average 188.45454545454547) internal successors, (4146), 22 states have internal predecessors, (4146), 0 states have call successors, (0), 0 states 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 09:25:28,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:25:28,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 485 [2023-08-27 09:25:28,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:25:30,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:25:32,512 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 09:25:34,220 INFO L124 PetriNetUnfolderBase]: 4821/9403 cut-off events. [2023-08-27 09:25:34,220 INFO L125 PetriNetUnfolderBase]: For 155930/156005 co-relation queries the response was YES. [2023-08-27 09:25:34,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56527 conditions, 9403 events. 4821/9403 cut-off events. For 155930/156005 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 74074 event pairs, 2066 based on Foata normal form. 38/8825 useless extension candidates. Maximal degree in co-relation 56465. Up to 3517 conditions per place. [2023-08-27 09:25:34,282 INFO L140 encePairwiseOnDemand]: 474/485 looper letters, 361 selfloop transitions, 98 changer transitions 4/469 dead transitions. [2023-08-27 09:25:34,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 469 transitions, 6049 flow [2023-08-27 09:25:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 09:25:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 09:25:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1633 transitions. [2023-08-27 09:25:34,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4208762886597938 [2023-08-27 09:25:34,284 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1633 transitions. [2023-08-27 09:25:34,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1633 transitions. [2023-08-27 09:25:34,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:25:34,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1633 transitions. [2023-08-27 09:25:34,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 204.125) internal successors, (1633), 8 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states 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 09:25:34,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 485.0) internal successors, (4365), 9 states have internal predecessors, (4365), 0 states have call successors, (0), 0 states 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 09:25:34,288 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 485.0) internal successors, (4365), 9 states have internal predecessors, (4365), 0 states have call successors, (0), 0 states 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 09:25:34,288 INFO L175 Difference]: Start difference. First operand has 217 places, 316 transitions, 3446 flow. Second operand 8 states and 1633 transitions. [2023-08-27 09:25:34,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 469 transitions, 6049 flow [2023-08-27 09:25:34,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 469 transitions, 5475 flow, removed 263 selfloop flow, removed 8 redundant places. [2023-08-27 09:25:34,391 INFO L231 Difference]: Finished difference. Result has 220 places, 331 transitions, 3775 flow [2023-08-27 09:25:34,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=3085, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3775, PETRI_PLACES=220, PETRI_TRANSITIONS=331} [2023-08-27 09:25:34,391 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 161 predicate places. [2023-08-27 09:25:34,391 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 331 transitions, 3775 flow [2023-08-27 09:25:34,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 188.45454545454547) internal successors, (4146), 22 states have internal predecessors, (4146), 0 states have call successors, (0), 0 states 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 09:25:34,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:25:34,392 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:25:34,397 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 09:25:34,596 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 09:25:34,596 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 09:25:34,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:25:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash -599708034, now seen corresponding path program 1 times [2023-08-27 09:25:34,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:25:34,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278973651] [2023-08-27 09:25:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:25:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:25:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:25:34,963 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 09:25:34,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:25:34,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278973651] [2023-08-27 09:25:34,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278973651] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:25:34,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345783055] [2023-08-27 09:25:34,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:25:34,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:25:34,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:25:34,964 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 09:25:34,965 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 09:25:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:25:35,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-27 09:25:35,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:25:35,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:25:35,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:25:35,105 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:25:35,106 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 09:25:35,117 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:25:35,118 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 09:25:35,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-08-27 09:25:35,239 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 09:25:35,341 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 09:25:35,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:25:35,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2023-08-27 09:25:35,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 66 treesize of output 59 [2023-08-27 09:25:35,496 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 57 treesize of output 59 [2023-08-27 09:25:35,536 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2023-08-27 09:25:35,591 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 09:25:35,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:25:35,604 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483649))) is different from false [2023-08-27 09:25:35,766 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1088 Int) (v_ArrVal_1087 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1087))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (<= 0 (+ 2147483649 (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1088)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_~#queue~0.base|) .cse2))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|))))) is different from false [2023-08-27 09:25:35,780 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1088 Int) (v_ArrVal_1087 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1083) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1087))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (<= 0 (+ (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1088)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_~#queue~0.base|) .cse1) 2147483649)))))) is different from false [2023-08-27 09:25:35,798 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73| Int) (v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1088 Int) (v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1081 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1081)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1083) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1087))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) (<= 0 (+ 2147483649 (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_73|) |c_~#queue~0.offset|) v_ArrVal_1088)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1090) |c_~#queue~0.base|) .cse1))))))) is different from false [2023-08-27 09:25:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-27 09:25:35,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345783055] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:25:35,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:25:35,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2023-08-27 09:25:35,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158156878] [2023-08-27 09:25:35,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:25:35,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-27 09:25:35,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:25:35,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-27 09:25:35,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=465, Unknown=11, NotChecked=196, Total=812 [2023-08-27 09:25:35,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 485 [2023-08-27 09:25:35,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 331 transitions, 3775 flow. Second operand has 29 states, 29 states have (on average 181.93103448275863) internal successors, (5276), 29 states have internal predecessors, (5276), 0 states have call successors, (0), 0 states 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 09:25:35,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:25:35,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 485 [2023-08-27 09:25:35,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:25:43,943 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 09:25:45,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:51,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:25:57,541 INFO L124 PetriNetUnfolderBase]: 6228/12250 cut-off events. [2023-08-27 09:25:57,541 INFO L125 PetriNetUnfolderBase]: For 233227/233426 co-relation queries the response was YES. [2023-08-27 09:25:57,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77256 conditions, 12250 events. 6228/12250 cut-off events. For 233227/233426 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 98767 event pairs, 2323 based on Foata normal form. 263/11754 useless extension candidates. Maximal degree in co-relation 77190. Up to 3656 conditions per place. [2023-08-27 09:25:57,632 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 349 selfloop transitions, 219 changer transitions 3/577 dead transitions. [2023-08-27 09:25:57,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 577 transitions, 8689 flow [2023-08-27 09:25:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-27 09:25:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-27 09:25:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4965 transitions. [2023-08-27 09:25:57,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3937351308485329 [2023-08-27 09:25:57,636 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4965 transitions. [2023-08-27 09:25:57,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4965 transitions. [2023-08-27 09:25:57,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:25:57,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4965 transitions. [2023-08-27 09:25:57,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 190.96153846153845) internal successors, (4965), 26 states have internal predecessors, (4965), 0 states have call successors, (0), 0 states 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 09:25:57,646 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 09:25:57,647 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 09:25:57,647 INFO L175 Difference]: Start difference. First operand has 220 places, 331 transitions, 3775 flow. Second operand 26 states and 4965 transitions. [2023-08-27 09:25:57,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 577 transitions, 8689 flow [2023-08-27 09:25:57,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 577 transitions, 8523 flow, removed 33 selfloop flow, removed 6 redundant places. [2023-08-27 09:25:57,847 INFO L231 Difference]: Finished difference. Result has 247 places, 400 transitions, 5822 flow [2023-08-27 09:25:57,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=3346, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5822, PETRI_PLACES=247, PETRI_TRANSITIONS=400} [2023-08-27 09:25:57,848 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 188 predicate places. [2023-08-27 09:25:57,848 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 400 transitions, 5822 flow [2023-08-27 09:25:57,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 181.93103448275863) internal successors, (5276), 29 states have internal predecessors, (5276), 0 states have call successors, (0), 0 states 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 09:25:57,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:25:57,849 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:25:57,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-27 09:25:58,049 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 09:25:58,049 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:25:58,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:25:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash -793926023, now seen corresponding path program 1 times [2023-08-27 09:25:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:25:58,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754136246] [2023-08-27 09:25:58,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:25:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:25:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:25:58,077 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 09:25:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:25:58,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754136246] [2023-08-27 09:25:58,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754136246] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:25:58,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:25:58,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:25:58,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074910290] [2023-08-27 09:25:58,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:25:58,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:25:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:25:58,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:25:58,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:25:58,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 09:25:58,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 400 transitions, 5822 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 09:25:58,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:25:58,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 09:25:58,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:26:00,023 INFO L124 PetriNetUnfolderBase]: 6054/11826 cut-off events. [2023-08-27 09:26:00,023 INFO L125 PetriNetUnfolderBase]: For 407608/409311 co-relation queries the response was YES. [2023-08-27 09:26:00,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90560 conditions, 11826 events. 6054/11826 cut-off events. For 407608/409311 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 94800 event pairs, 3574 based on Foata normal form. 113/11289 useless extension candidates. Maximal degree in co-relation 90487. Up to 11020 conditions per place. [2023-08-27 09:26:00,125 INFO L140 encePairwiseOnDemand]: 483/485 looper letters, 361 selfloop transitions, 1 changer transitions 3/399 dead transitions. [2023-08-27 09:26:00,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 399 transitions, 6580 flow [2023-08-27 09:26:00,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:26:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:26:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2023-08-27 09:26:00,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079037800687285 [2023-08-27 09:26:00,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 739 transitions. [2023-08-27 09:26:00,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 739 transitions. [2023-08-27 09:26:00,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:26:00,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 739 transitions. [2023-08-27 09:26:00,127 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 09:26:00,128 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 09:26:00,128 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 09:26:00,128 INFO L175 Difference]: Start difference. First operand has 247 places, 400 transitions, 5822 flow. Second operand 3 states and 739 transitions. [2023-08-27 09:26:00,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 399 transitions, 6580 flow [2023-08-27 09:26:00,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 399 transitions, 5777 flow, removed 336 selfloop flow, removed 14 redundant places. [2023-08-27 09:26:00,419 INFO L231 Difference]: Finished difference. Result has 234 places, 391 transitions, 4887 flow [2023-08-27 09:26:00,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=4885, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4887, PETRI_PLACES=234, PETRI_TRANSITIONS=391} [2023-08-27 09:26:00,420 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 175 predicate places. [2023-08-27 09:26:00,420 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 391 transitions, 4887 flow [2023-08-27 09:26:00,420 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 09:26:00,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:26:00,420 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:26:00,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-27 09:26:00,420 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:26:00,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:26:00,420 INFO L85 PathProgramCache]: Analyzing trace with hash -761041775, now seen corresponding path program 1 times [2023-08-27 09:26:00,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:26:00,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690136974] [2023-08-27 09:26:00,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:26:00,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:26:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:26:00,458 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 09:26:00,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:26:00,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690136974] [2023-08-27 09:26:00,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690136974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:26:00,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:26:00,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:26:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191177494] [2023-08-27 09:26:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:26:00,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:26:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:26:00,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:26:00,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:26:00,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 09:26:00,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 391 transitions, 4887 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 09:26:00,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:26:00,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 09:26:00,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:26:02,186 INFO L124 PetriNetUnfolderBase]: 5905/11629 cut-off events. [2023-08-27 09:26:02,186 INFO L125 PetriNetUnfolderBase]: For 383250/385744 co-relation queries the response was YES. [2023-08-27 09:26:02,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84892 conditions, 11629 events. 5905/11629 cut-off events. For 383250/385744 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 93725 event pairs, 3605 based on Foata normal form. 143/11091 useless extension candidates. Maximal degree in co-relation 84823. Up to 7941 conditions per place. [2023-08-27 09:26:02,276 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 317 selfloop transitions, 38 changer transitions 0/389 dead transitions. [2023-08-27 09:26:02,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 389 transitions, 5642 flow [2023-08-27 09:26:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:26:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:26:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2023-08-27 09:26:02,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058419243986254 [2023-08-27 09:26:02,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2023-08-27 09:26:02,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2023-08-27 09:26:02,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:26:02,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2023-08-27 09:26:02,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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 09:26:02,279 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 09:26:02,279 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 09:26:02,279 INFO L175 Difference]: Start difference. First operand has 234 places, 391 transitions, 4887 flow. Second operand 3 states and 736 transitions. [2023-08-27 09:26:02,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 389 transitions, 5642 flow [2023-08-27 09:26:02,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 389 transitions, 5641 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:26:02,424 INFO L231 Difference]: Finished difference. Result has 233 places, 381 transitions, 4814 flow [2023-08-27 09:26:02,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=4738, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4814, PETRI_PLACES=233, PETRI_TRANSITIONS=381} [2023-08-27 09:26:02,424 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 174 predicate places. [2023-08-27 09:26:02,424 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 381 transitions, 4814 flow [2023-08-27 09:26:02,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 09:26:02,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:26:02,425 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 09:26:02,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-27 09:26:02,425 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:26:02,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:26:02,425 INFO L85 PathProgramCache]: Analyzing trace with hash -286124217, now seen corresponding path program 1 times [2023-08-27 09:26:02,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:26:02,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958980430] [2023-08-27 09:26:02,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:26:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:26:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:26:02,457 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 09:26:02,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:26:02,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958980430] [2023-08-27 09:26:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958980430] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:26:02,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265599600] [2023-08-27 09:26:02,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:26:02,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:26:02,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:26:02,458 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 09:26:02,460 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 09:26:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:26:02,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 09:26:02,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:26:02,600 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 09:26:02,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:26:02,619 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 09:26:02,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265599600] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:26:02,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:26:02,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-27 09:26:02,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948159569] [2023-08-27 09:26:02,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:26:02,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 09:26:02,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:26:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 09:26:02,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 09:26:02,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 485 [2023-08-27 09:26:02,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 381 transitions, 4814 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 09:26:02,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:26:02,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 485 [2023-08-27 09:26:02,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:26:04,185 INFO L124 PetriNetUnfolderBase]: 4907/9599 cut-off events. [2023-08-27 09:26:04,185 INFO L125 PetriNetUnfolderBase]: For 378489/381270 co-relation queries the response was YES. [2023-08-27 09:26:04,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82118 conditions, 9599 events. 4907/9599 cut-off events. For 378489/381270 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 69678 event pairs, 2516 based on Foata normal form. 165/9250 useless extension candidates. Maximal degree in co-relation 82049. Up to 5067 conditions per place. [2023-08-27 09:26:04,270 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 377 selfloop transitions, 28 changer transitions 0/439 dead transitions. [2023-08-27 09:26:04,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 439 transitions, 6950 flow [2023-08-27 09:26:04,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:26:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:26:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1461 transitions. [2023-08-27 09:26:04,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020618556701031 [2023-08-27 09:26:04,272 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1461 transitions. [2023-08-27 09:26:04,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1461 transitions. [2023-08-27 09:26:04,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:26:04,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1461 transitions. [2023-08-27 09:26:04,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states 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 09:26:04,275 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 09:26:04,275 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 09:26:04,275 INFO L175 Difference]: Start difference. First operand has 233 places, 381 transitions, 4814 flow. Second operand 6 states and 1461 transitions. [2023-08-27 09:26:04,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 439 transitions, 6950 flow [2023-08-27 09:26:04,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 439 transitions, 6881 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-27 09:26:04,420 INFO L231 Difference]: Finished difference. Result has 241 places, 383 transitions, 4993 flow [2023-08-27 09:26:04,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=4629, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4993, PETRI_PLACES=241, PETRI_TRANSITIONS=383} [2023-08-27 09:26:04,420 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 182 predicate places. [2023-08-27 09:26:04,420 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 383 transitions, 4993 flow [2023-08-27 09:26:04,421 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 09:26:04,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:26:04,421 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 09:26:04,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-27 09:26:04,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:26:04,621 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:26:04,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:26:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash 535708732, now seen corresponding path program 4 times [2023-08-27 09:26:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:26:04,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958835828] [2023-08-27 09:26:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:26:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:26:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:26:05,804 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 09:26:05,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:26:05,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958835828] [2023-08-27 09:26:05,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958835828] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:26:05,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034635963] [2023-08-27 09:26:05,805 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 09:26:05,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:26:05,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:26:05,806 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 09:26:05,806 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 09:26:05,949 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 09:26:05,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 09:26:05,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 99 conjunts are in the unsatisfiable core [2023-08-27 09:26:05,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:26:05,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:26:05,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:26:05,978 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:26:05,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 09:26:05,992 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:26:05,992 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 09:26:06,083 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 09:26:06,171 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 09:26:06,292 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 09:26:06,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:26:06,350 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 09:26:06,478 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 09:26:06,666 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 09:26:06,758 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 09:26:07,145 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 09:26:07,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:26:07,399 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 09:26:09,716 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 09:26:18,109 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 09:26:18,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:26:18,188 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1385 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 09:26:18,461 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (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 (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1381) .cse4 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|))) (or (= 20 .cse0) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (+ .cse0 1) v_ArrVal_1382) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1381) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-27 09:26:18,484 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (let ((.cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse4 .cse5)) (.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse0 v_ArrVal_1381) .cse5 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|))) (or (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 1) v_ArrVal_1381) (= 20 .cse1) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (+ .cse1 1) v_ArrVal_1382) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-08-27 09:26:18,510 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1377 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1377))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| .cse1) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (let ((.cse4 (select .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse6 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse2 v_ArrVal_1381) .cse5 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|)) (.cse3 (select .cse4 .cse5))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1381) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (= 20 .cse3) (< (+ .cse3 1) v_ArrVal_1382))))))) is different from false [2023-08-27 09:26:18,543 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1377 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) |c_~#queue~0.offset|) v_ArrVal_1377))) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| .cse1) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_1381) .cse4 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|)) (.cse0 (select .cse6 .cse4))) (or (< (+ .cse0 1) v_ArrVal_1382) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1381) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse2) 2147483647) (= .cse0 20)))))))) is different from false [2023-08-27 09:26:18,570 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1377 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) |c_~#queue~0.offset|) v_ArrVal_1377))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select .cse7 .cse1)) (.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_1381) .cse1 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) (< (+ .cse3 1) v_ArrVal_1382) (= 20 .cse3) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1381))))))))) is different from false [2023-08-27 09:26:18,603 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1377 Int) (v_ArrVal_1384 (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_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) |c_~#queue~0.offset|) v_ArrVal_1377))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_1381) .cse1 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|)) (.cse5 (select .cse6 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse2) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1381) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1375) (< (+ .cse5 1) v_ArrVal_1382) (= .cse5 20))))))))) is different from false [2023-08-27 09:26:18,633 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1377 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse3 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) |c_~#queue~0.offset|) v_ArrVal_1377))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse6) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_1381) .cse1 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|)) (.cse7 (select .cse8 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse2) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1375) (< (+ (select .cse6 .cse2) 1) v_ArrVal_1381) (< (+ .cse7 1) v_ArrVal_1382) (= .cse7 20)))))))))) is different from false [2023-08-27 09:26:18,718 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1373 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1377 Int) (v_ArrVal_1384 (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 (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1373) .cse6 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) |c_~#queue~0.offset|) v_ArrVal_1377))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_1381) .cse2 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|)) (.cse7 (select .cse8 .cse2))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1373) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1381) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1375) (= .cse7 20) (< (+ .cse7 1) v_ArrVal_1382)))))))))) is different from false [2023-08-27 09:26:18,761 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1373 Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1375 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1377 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse8 v_ArrVal_1373) .cse6 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) |c_~#queue~0.offset|) v_ArrVal_1377))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_1381) .cse2 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|)) (.cse7 (select .cse9 .cse2))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1381) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1375) (= .cse7 20) (< (+ .cse7 1) v_ArrVal_1382) (< (+ (select .cse5 .cse8) 1) v_ArrVal_1373)))))))))) is different from false [2023-08-27 09:26:18,807 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1381 Int) (v_ArrVal_1371 Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1373 Int) (v_ArrVal_1375 Int) (v_ArrVal_1377 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_1371)) (.cse1 (+ 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 .cse0 .cse1 v_ArrVal_1373) .cse4 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) |c_~#queue~0.offset|) v_ArrVal_1377))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_1381) .cse6 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|)) (.cse8 (select .cse9 .cse6))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1373) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1381) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1375) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse3) 2147483647) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) (< (+ .cse8 1) v_ArrVal_1382) (= .cse8 20)))))))))) is different from false [2023-08-27 09:26:18,848 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86| Int) (v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1381 Int) (v_ArrVal_1371 Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1373 Int) (v_ArrVal_1375 Int) (v_ArrVal_1377 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_86|)) v_ArrVal_1371)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1373) .cse2 v_ArrVal_1375)) |c_~#stored_elements~0.base| v_ArrVal_1376))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) |c_~#queue~0.offset|) v_ArrVal_1377))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1379))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (select .cse9 .cse2)) (.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1381) .cse2 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1382) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_86|) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_1373) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse4) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1375) (= .cse0 20) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_84|) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1381) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|))))))))))) is different from false [2023-08-27 09:26:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-08-27 09:26:18,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034635963] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:26:18,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:26:18,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 54 [2023-08-27 09:26:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139821056] [2023-08-27 09:26:18,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:26:18,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-08-27 09:26:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:26:18,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-08-27 09:26:18,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=1459, Unknown=23, NotChecked=1140, Total=3080 [2023-08-27 09:26:18,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 09:26:18,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 383 transitions, 4993 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 09:26:18,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:26:18,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 09:26:18,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:26:24,030 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 09:26:26,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:26:31,850 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 09:26:46,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:26:48,823 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] [2023-08-27 09:26:58,861 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 09:27:03,440 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 09:27:05,456 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 09:27:07,516 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 09:27:07,552 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 ((.cse6 (select .cse4 .cse5))) (let ((.cse0 (+ .cse6 1)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (or (forall ((v_ArrVal_1381 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1381) .cse5 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1382) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse2) 2147483647) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1381)))) (= .cse6 20)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1382) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse2) 2147483647) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|)))))))) is different from false [2023-08-27 09:27:09,587 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 09:27:09,867 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |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_82| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1382) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse3) 2147483647) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_1382 Int) (v_ArrVal_1385 Int) (v_ArrVal_1384 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1382)) |c_~#stored_elements~0.base| v_ArrVal_1384) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1382) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_1385) .cse3) 2147483647) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|)))))) is different from false [2023-08-27 09:27:12,615 INFO L124 PetriNetUnfolderBase]: 5060/9877 cut-off events. [2023-08-27 09:27:12,616 INFO L125 PetriNetUnfolderBase]: For 399177/401446 co-relation queries the response was YES. [2023-08-27 09:27:12,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86827 conditions, 9877 events. 5060/9877 cut-off events. For 399177/401446 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 71691 event pairs, 2555 based on Foata normal form. 55/9448 useless extension candidates. Maximal degree in co-relation 86754. Up to 7328 conditions per place. [2023-08-27 09:27:12,736 INFO L140 encePairwiseOnDemand]: 468/485 looper letters, 359 selfloop transitions, 188 changer transitions 3/556 dead transitions. [2023-08-27 09:27:12,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 556 transitions, 11013 flow [2023-08-27 09:27:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-27 09:27:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-27 09:27:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 6011 transitions. [2023-08-27 09:27:12,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37557013433302094 [2023-08-27 09:27:12,741 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 6011 transitions. [2023-08-27 09:27:12,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 6011 transitions. [2023-08-27 09:27:12,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:27:12,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 6011 transitions. [2023-08-27 09:27:12,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 182.15151515151516) internal successors, (6011), 33 states have internal predecessors, (6011), 0 states have call successors, (0), 0 states 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 09:27:12,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 485.0) internal successors, (16490), 34 states have internal predecessors, (16490), 0 states have call successors, (0), 0 states 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 09:27:12,757 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 485.0) internal successors, (16490), 34 states have internal predecessors, (16490), 0 states have call successors, (0), 0 states 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 09:27:12,757 INFO L175 Difference]: Start difference. First operand has 241 places, 383 transitions, 4993 flow. Second operand 33 states and 6011 transitions. [2023-08-27 09:27:12,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 556 transitions, 11013 flow [2023-08-27 09:27:12,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 556 transitions, 10965 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-08-27 09:27:12,963 INFO L231 Difference]: Finished difference. Result has 287 places, 434 transitions, 6664 flow [2023-08-27 09:27:12,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=4951, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=6664, PETRI_PLACES=287, PETRI_TRANSITIONS=434} [2023-08-27 09:27:12,964 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 228 predicate places. [2023-08-27 09:27:12,964 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 434 transitions, 6664 flow [2023-08-27 09:27:12,965 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 09:27:12,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:27:12,965 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:27:12,969 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 09:27:13,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-27 09:27:13,165 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2023-08-27 09:27:13,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:27:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash -994903201, now seen corresponding path program 1 times [2023-08-27 09:27:13,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:27:13,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868191025] [2023-08-27 09:27:13,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:27:13,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:27:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:27:14,165 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 09:27:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:27:14,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868191025] [2023-08-27 09:27:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868191025] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:27:14,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840478274] [2023-08-27 09:27:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:27:14,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:27:14,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:27:14,166 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 09:27:14,168 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 09:27:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:27:14,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 95 conjunts are in the unsatisfiable core [2023-08-27 09:27:14,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:27:14,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:27:14,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:27:14,323 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-27 09:27:14,323 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 09:27:14,337 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-27 09:27:14,337 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 09:27:14,423 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 09:27:14,503 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 09:27:14,612 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 09:27:14,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:27:14,667 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 09:27:14,749 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 09:27:14,939 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 09:27:15,190 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2023-08-27 09:27:15,276 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 09:27:17,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:27:17,849 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 09:27:18,343 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 09:27:27,703 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 09:27:27,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:27:27,857 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1510 Int) (v_ArrVal_1509 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| 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_1507)) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1507) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 09:27:27,967 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1510 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1) 1) v_ArrVal_1507))))) is different from false [2023-08-27 09:27:27,995 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1510 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1504 Int) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1504)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1504) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1507))))) is different from false [2023-08-27 09:27:41,031 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1510 Int) (v_ArrVal_1500 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1502 Int) (v_ArrVal_1504 Int) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse6 (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_1500)) |c_~#stored_elements~0.base| v_ArrVal_1501))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1502)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse5 (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1504)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse5 |c_~#queue~0.base| (store (select .cse5 |c_~#queue~0.base|) .cse1 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1504) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1500) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) .cse3) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1507))))))) is different from false [2023-08-27 09:27:41,057 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1510 Int) (v_ArrVal_1500 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1502 Int) (v_ArrVal_1504 Int) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1500)) |c_~#stored_elements~0.base| v_ArrVal_1501))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1502)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1504)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse7 |c_~#queue~0.base| (store (select .cse7 |c_~#queue~0.base|) .cse1 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1504) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) .cse3) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1500) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1507)))))))) is different from false [2023-08-27 09:27:41,117 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1497 Int) (v_ArrVal_1510 Int) (v_ArrVal_1500 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1502 Int) (v_ArrVal_1504 Int) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1497) .cse6 v_ArrVal_1500)) |c_~#stored_elements~0.base| v_ArrVal_1501))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1502)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1504)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse7 |c_~#queue~0.base| (store (select .cse7 |c_~#queue~0.base|) .cse3 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1504) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1497) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1500) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) .cse1) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1507)))))))) is different from false [2023-08-27 09:27:44,078 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1501 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int) (v_ArrVal_1495 Int) (v_ArrVal_1497 Int) (v_ArrVal_1510 Int) (v_ArrVal_1500 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1502 Int) (v_ArrVal_1504 Int) (v_ArrVal_1506 (Array Int Int))) (let ((.cse5 (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_1495)) (.cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse7 v_ArrVal_1497) .cse6 v_ArrVal_1500)) |c_~#stored_elements~0.base| v_ArrVal_1501))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1502)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_1504)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse8 |c_~#queue~0.base| (store (select .cse8 |c_~#queue~0.base|) .cse3 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) .cse1) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1507) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1500) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ (select .cse5 .cse7) 1) v_ArrVal_1497) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1504)))))))) is different from false [2023-08-27 09:28:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 6 not checked. [2023-08-27 09:28:01,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840478274] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 09:28:01,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 09:28:01,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2023-08-27 09:28:01,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089800000] [2023-08-27 09:28:01,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 09:28:01,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-27 09:28:01,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:28:01,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-27 09:28:01,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=1595, Unknown=82, NotChecked=672, Total=2862 [2023-08-27 09:28:01,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 485 [2023-08-27 09:28:01,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 434 transitions, 6664 flow. Second operand has 54 states, 54 states have (on average 176.38888888888889) internal successors, (9525), 54 states have internal predecessors, (9525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:28:01,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:28:01,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 485 [2023-08-27 09:28:01,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:28:10,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:28:19,547 WARN L234 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 91 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:28:21,871 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 09:28:29,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] [2023-08-27 09:28:57,728 WARN L234 SmtUtils]: Spent 11.36s on a formula simplification. DAG size of input: 140 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:28:59,731 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 09:29:16,197 WARN L234 SmtUtils]: Spent 10.41s on a formula simplification. DAG size of input: 91 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:29:22,432 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 09:29:24,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-27 09:29:26,525 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 09:29:28,630 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 09:29:44,123 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 09:29:59,611 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 09:30:01,634 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 09:30:03,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:30:05,719 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 09:30:16,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:30:18,879 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 09:30:20,884 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 09:30:22,889 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 09:30:24,894 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 09:30:26,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:30:28,904 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 09:30:30,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:30:32,915 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 09:30:34,920 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 09:30:36,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, 1] [2023-08-27 09:30:39,033 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 09:31:01,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:31:03,300 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 09:31:05,305 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 09:31:07,311 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 09:31:09,315 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 09:31:11,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:31:13,330 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 09:31:15,334 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 09:31:17,340 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 09:31:19,346 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 09:31:21,352 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 09:31:23,356 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 09:31:25,366 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 09:31:27,371 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 09:31:29,378 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 09:31:31,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:31:33,393 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 09:31:35,403 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 09:31:37,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:31:39,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 09:31:41,446 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 09:31:55,885 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 09:31:58,238 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 09:32:00,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:23,792 WARN L234 SmtUtils]: Spent 13.17s on a formula simplification. DAG size of input: 257 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:32:25,797 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 09:32:27,806 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 09:32:29,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:41,967 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 09:32:44,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:46,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:47,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 09:32:49,670 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 09:32:51,678 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 09:32:53,692 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 09:33:01,914 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ (select .cse11 .cse5) 1)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1507 Int) (v_ArrVal_1510 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse0 (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse5 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< .cse3 v_ArrVal_1507)))) (forall ((v_ArrVal_1507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1510 Int) (v_ArrVal_1500 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1502 Int) (v_ArrVal_1504 Int) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse5 v_ArrVal_1500)) |c_~#stored_elements~0.base| v_ArrVal_1501))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1502))) (let ((.cse6 (select (store (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_1504)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse9 |c_~#queue~0.base| (store (select .cse9 |c_~#queue~0.base|) .cse2 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1504) (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) .cse1) 2147483647) (< .cse3 v_ArrVal_1500) (< (+ (select .cse7 .cse2) 1) v_ArrVal_1507)))))))))) is different from false [2023-08-27 09:33:03,927 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 09:33:25,672 WARN L234 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 226 DAG size of output: 162 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:33:36,122 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 09:33:38,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 09:33:59,808 WARN L234 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 195 DAG size of output: 128 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 09:34:00,535 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1507 Int) (v_ArrVal_1510 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse0 (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse5 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) .cse1) 2147483647) (< .cse2 v_ArrVal_1507) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)))) (forall ((v_ArrVal_1507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1510 Int) (v_ArrVal_1500 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1502 Int) (v_ArrVal_1504 Int) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse5 v_ArrVal_1500)) |c_~#stored_elements~0.base| v_ArrVal_1501))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) v_ArrVal_1502))) (let ((.cse6 (select (store (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_1504)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse9 |c_~#queue~0.base| (store (select .cse9 |c_~#queue~0.base|) .cse3 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1504) (< .cse2 v_ArrVal_1500) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) .cse1) 2147483647) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1507))))))))) is different from false [2023-08-27 09:34:03,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:34:05,314 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 09:34:07,322 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 09:34:09,327 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 09:34:11,334 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 09:34:13,341 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 09:34:15,757 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 09:34:17,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:34:19,774 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 09:34:21,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:34:23,789 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 09:34:25,860 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 09:34:38,910 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 09:34:41,056 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 09:34:43,066 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 09:34:45,075 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 09:34:47,082 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 09:34:49,091 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 09:34:52,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 [1] [2023-08-27 09:34:55,114 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 09:34:57,132 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 09:34:59,139 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 09:35:01,147 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 09:35:03,153 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 09:35:05,160 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 09:35:07,172 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 09:35:09,183 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 09:35:11,190 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 09:35:13,197 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 09:35:15,204 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 09:35:17,212 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 09:35:19,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:35:19,976 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse7 .cse8)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ (select .cse7 .cse6) 1))) (and (forall ((v_ArrVal_1507 Int) (v_ArrVal_1510 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1504 Int) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse0 (select (store (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1504)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse6 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ .cse2 1) v_ArrVal_1504) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) .cse3) 2147483647) (< .cse4 v_ArrVal_1507)))) (< .cse2 2147483647) (forall ((v_ArrVal_1507 Int) (v_ArrVal_1510 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1504 Int) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse9 (select (store (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1504)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse6 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1504) (< (select (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) .cse3) 2147483647) (< .cse4 v_ArrVal_1507))))))) is different from false [2023-08-27 09:35:22,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:35:24,839 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 09:35:26,846 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 09:35:29,386 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 09:35:50,700 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 09:36:06,440 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 09:36:08,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:36:10,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:36:12,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:36:13,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:36:15,850 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 09:36:17,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 [1] [2023-08-27 09:36:19,884 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 09:36:24,880 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 09:36:27,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:36:28,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 09:36:28,218 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1507 Int) (v_ArrVal_1510 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1504 Int) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1504)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1504) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1507))))) (forall ((v_ArrVal_1510 Int)) (< (select (store .cse1 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1510) .cse2) 2147483647)))) is different from false [2023-08-27 09:36:28,346 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (< (select .cse0 .cse1) 2147483647) (forall ((v_ArrVal_1507 Int) (v_ArrVal_1510 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1504 Int) (v_ArrVal_1506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1504)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1506))) (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3 v_ArrVal_1507))) |c_~#stored_elements~0.base| v_ArrVal_1509) |c_~#queue~0.base|))) (or (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1504) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_91|)) v_ArrVal_1510) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1507))))))) is different from false [2023-08-27 09:36:32,836 INFO L124 PetriNetUnfolderBase]: 5752/11297 cut-off events. [2023-08-27 09:36:32,837 INFO L125 PetriNetUnfolderBase]: For 687002/690027 co-relation queries the response was YES. [2023-08-27 09:36:32,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117630 conditions, 11297 events. 5752/11297 cut-off events. For 687002/690027 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 83940 event pairs, 2652 based on Foata normal form. 73/10869 useless extension candidates. Maximal degree in co-relation 117541. Up to 7515 conditions per place. [2023-08-27 09:36:32,960 INFO L140 encePairwiseOnDemand]: 467/485 looper letters, 415 selfloop transitions, 338 changer transitions 3/762 dead transitions. [2023-08-27 09:36:32,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 762 transitions, 18333 flow [2023-08-27 09:36:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-08-27 09:36:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2023-08-27 09:36:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 9609 transitions. [2023-08-27 09:36:32,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3738183232834079 [2023-08-27 09:36:32,966 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 9609 transitions. [2023-08-27 09:36:32,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 9609 transitions. [2023-08-27 09:36:32,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:36:32,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 9609 transitions. [2023-08-27 09:36:32,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 181.30188679245282) internal successors, (9609), 53 states have internal predecessors, (9609), 0 states have call successors, (0), 0 states 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 09:36:32,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 485.0) internal successors, (26190), 54 states have internal predecessors, (26190), 0 states have call successors, (0), 0 states 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 09:36:32,986 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 485.0) internal successors, (26190), 54 states have internal predecessors, (26190), 0 states have call successors, (0), 0 states 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 09:36:32,986 INFO L175 Difference]: Start difference. First operand has 287 places, 434 transitions, 6664 flow. Second operand 53 states and 9609 transitions. [2023-08-27 09:36:32,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 762 transitions, 18333 flow [2023-08-27 09:36:33,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 762 transitions, 16882 flow, removed 621 selfloop flow, removed 14 redundant places. [2023-08-27 09:36:33,271 INFO L231 Difference]: Finished difference. Result has 350 places, 593 transitions, 10874 flow [2023-08-27 09:36:33,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=5867, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=10874, PETRI_PLACES=350, PETRI_TRANSITIONS=593} [2023-08-27 09:36:33,271 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 291 predicate places. [2023-08-27 09:36:33,271 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 593 transitions, 10874 flow [2023-08-27 09:36:33,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 176.38888888888889) internal successors, (9525), 54 states have internal predecessors, (9525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:36:33,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:36:33,273 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:36:33,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-27 09:36:33,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-27 09:36:33,473 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 09:36:33,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:36:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash -138407255, now seen corresponding path program 2 times [2023-08-27 09:36:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:36:33,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806514004] [2023-08-27 09:36:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:36:33,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:36:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:36:34,806 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 09:36:34,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:36:34,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806514004] [2023-08-27 09:36:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806514004] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 09:36:34,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722269913] [2023-08-27 09:36:34,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 09:36:34,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 09:36:34,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:36:34,808 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 09:36:34,808 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 09:36:34,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 09:36:34,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 09:36:34,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 110 conjunts are in the unsatisfiable core [2023-08-27 09:36:34,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 09:36:34,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:36:34,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 09:36:34,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2023-08-27 09:36:35,031 INFO L322 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2023-08-27 09:36:35,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2023-08-27 09:36:35,150 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 09:36:35,279 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 09:36:35,590 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 09:36:35,649 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 09:36:35,758 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 09:36:35,978 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 09:36:36,429 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2023-08-27 09:36:37,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-08-27 09:36:37,395 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 09:36:37,943 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 09:36:45,168 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 09:36:45,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 09:36:45,255 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1635) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1636) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|)))) is different from false [2023-08-27 09:36:45,263 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1634) |c_~#stored_elements~0.base| v_ArrVal_1635) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1636) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-08-27 09:36:48,078 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1630 Int) (v_ArrVal_1633 Int) (v_ArrVal_1636 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_1630) .cse2 v_ArrVal_1633)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1634) |c_~#stored_elements~0.base| v_ArrVal_1635) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1636) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1633) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1630))))) is different from false [2023-08-27 09:37:09,122 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= .cse0 20) (forall ((v_ArrVal_1628 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1630 Int) (v_ArrVal_1633 Int) (v_ArrVal_1625 Int) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1625)) |c_~#stored_elements~0.base| v_ArrVal_1627))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1628)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1630) .cse2 v_ArrVal_1633)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1634) |c_~#stored_elements~0.base| v_ArrVal_1635) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1630) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1633) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1636) .cse5) 2147483647) (< (+ .cse0 1) v_ArrVal_1625)))))))))) is different from false [2023-08-27 09:37:09,168 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= .cse0 20) (forall ((v_ArrVal_1628 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1630 Int) (v_ArrVal_1633 Int) (v_ArrVal_1624 Int) (v_ArrVal_1625 Int) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1624) .cse8 v_ArrVal_1625)) |c_~#stored_elements~0.base| v_ArrVal_1627))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1628)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1630) .cse2 v_ArrVal_1633)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1634) |c_~#stored_elements~0.base| v_ArrVal_1635) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1633) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1636) .cse4) 2147483647) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1630) (< (+ .cse0 1) v_ArrVal_1625) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1624)))))))))) is different from false [2023-08-27 09:37:15,063 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1628 Int) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_1630 Int) (v_ArrVal_1622 Int) (v_ArrVal_1633 Int) (v_ArrVal_1624 Int) (v_ArrVal_1625 Int) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1636 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1622)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1624) .cse9 v_ArrVal_1625)) |c_~#stored_elements~0.base| v_ArrVal_1627))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_1628)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select .cse3 .cse9)) (.cse6 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1630) .cse2 v_ArrVal_1633)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1634) |c_~#stored_elements~0.base| v_ArrVal_1635) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1630) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1633) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1624) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_1636) .cse1) 2147483647) (< (+ .cse7 1) v_ArrVal_1625) (= 20 .cse7) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_100|)))))))) is different from false Received shutdown request... [2023-08-27 09:37:19,518 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 09:37:19,518 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 09:37:20,439 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 29 remaining) [2023-08-27 09:37:20,447 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 09:37:20,640 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,SelfDestructingSolverStorable24 [2023-08-27 09:37:20,640 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (27 of 29 remaining) [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 29 remaining) [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 29 remaining) [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2023-08-27 09:37:20,642 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONASSERT (12 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2023-08-27 09:37:20,643 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONASSERT (0 of 29 remaining) [2023-08-27 09:37:20,644 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] [2023-08-27 09:37:20,647 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 09:37:20,647 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 09:37:20,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:37:20 BasicIcfg [2023-08-27 09:37:20,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 09:37:20,665 INFO L158 Benchmark]: Toolchain (without parser) took 863036.95ms. Allocated memory was 352.3MB in the beginning and 2.7GB in the end (delta: 2.3GB). Free memory was 326.0MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-27 09:37:20,665 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 352.3MB. Free memory was 330.5MB in the beginning and 330.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 09:37:20,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.69ms. Allocated memory is still 352.3MB. Free memory was 326.0MB in the beginning and 296.3MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-27 09:37:20,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.15ms. Allocated memory is still 352.3MB. Free memory was 296.3MB in the beginning and 293.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 09:37:20,667 INFO L158 Benchmark]: Boogie Preprocessor took 43.28ms. Allocated memory is still 352.3MB. Free memory was 293.3MB in the beginning and 291.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 09:37:20,667 INFO L158 Benchmark]: RCFGBuilder took 380.46ms. Allocated memory is still 352.3MB. Free memory was 291.2MB in the beginning and 268.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 09:37:20,670 INFO L158 Benchmark]: TraceAbstraction took 862050.57ms. Allocated memory was 352.3MB in the beginning and 2.7GB in the end (delta: 2.3GB). Free memory was 268.1MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-27 09:37:20,671 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.10ms. Allocated memory is still 352.3MB. Free memory was 330.5MB in the beginning and 330.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 499.69ms. Allocated memory is still 352.3MB. Free memory was 326.0MB in the beginning and 296.3MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.15ms. Allocated memory is still 352.3MB. Free memory was 296.3MB in the beginning and 293.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 43.28ms. Allocated memory is still 352.3MB. Free memory was 293.3MB in the beginning and 291.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 380.46ms. Allocated memory is still 352.3MB. Free memory was 291.2MB in the beginning and 268.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 862050.57ms. Allocated memory was 352.3MB in the beginning and 2.7GB in the end (delta: 2.3GB). Free memory was 268.1MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. 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 analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 26 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 55 known predicates. - 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: 862.0s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 705.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 822 mSolverCounterUnknown, 5030 SdHoareTripleChecker+Valid, 339.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5030 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 337.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 14148 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 893 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14170 IncrementalHoareTripleChecker+Invalid, 30033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 893 mSolverCounterUnsat, 2 mSDtfsCounter, 14170 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 822 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 772 GetRequests, 186 SyntacticMatches, 49 SemanticMatches, 537 ConstructedPredicates, 54 IntricatePredicates, 13 DeprecatedPredicates, 8027 ImplicationChecksByTransitivity, 430.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10874occurred in iteration=24, InterpolantAutomatonStates: 317, 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.5s SatisfiabilityAnalysisTime, 98.8s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 702 ConstructedInterpolants, 227 QuantifiedInterpolants, 39602 SizeOfPredicates, 200 NumberOfNonLiveVariables, 2862 ConjunctsInSsa, 707 ConjunctsInUnsatCore, 46 InterpolantComputations, 13 PerfectInterpolantSequences, 16/193 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